DIU-BLC
Algorithm Design and Analysis (Spring 21)
0%
Previous
Course data
General
Student Interest Survey
Announcements
Assignment
Breath First Search (BFS) Assignment
Graph Assignment
Week 01
Discussion on Week-01Forum
Graph Representation 01
Prerequisite Documents
Minimum Spanning Tree
BFS and DFS
Introduction with the Asymptotic Notation
Discussion on Week-02Forum
DFS Algorithm Assignment
Complexity Analysis Assignment
Week-03 Searching and Sorting Algorithm Based on Brute Force Approach
Quiz-01
Discussion on Week-03Forum
Sorting Assignment
Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach
Discussion on Week-04Forum
Week-05 Introduction to Greedy Approach
Assignment 01
Discussion on Week-05Forum
Presentation
Presentation Assignment
Complexity Analysis
Complexity Analysis
Mid Term Exam
Discussion about Mid Term Exam
Mid Term Exam Part 1 (Quiz)
Mid Term Exam Part 2 (Written Exam)
Topic 12
Quiz -02
Discussion on Week-06Forum
ডাইনামিক প্রোগ্রামিং – ১ (ফিবোনাচ্চি)
ফিবোনাচ্চি Tree
Knapack
Week-08 Introduction to Dynamic Programming (Continue)
Discuss on Week-08 content if you have any problem and confusion.
LCS
Longest Increasing Subsequence
LIS assignment
Week-09 Introduction to Graph And Graph Traversal
Discussion on Week-09
Assignment 02
Week-10 Graph Application
Discussion on Week-10
Week-11 Graph: Single Source Shortest Path Algorithm
Discuss on Week-11
Week-12 Graph: All Pair Shortest Path Algorithm
Discuss on Week-12
Week-13 Final Presentation and Lab Final
Discuss on Week-13
Week-14 Final Examination
Algorithm Design and Analysis Final Quiz
Algorithm Assessment
Student Feedback Form July 2020
BLC courses feedback form July 2020
Research Servey
Research Survey
Next
DIU-BLC
Side panel
Guidelines
For Teachers
For Students
Search
Close
Search
Toggle search input
Log in
Username
Password
Remember username
Forgot Password?
Log in
Create new account
Site Navigation
SE 214 (SI-211)
Home
Skip to main content
Course info
Home
Courses
DIU
Faculty of Science and Information Technology
Software Engineering
SWE Spring 21
SE 214 (SI-211)
Summary
Algorithm Design and Analysis (Spring 21)
Design and Analysis of Algorithms
Course Outcomes:
Ability to analyze the performance of algorithms.
Ability to choose appropriate algorithm design techniques for solving problems.
Ability to understand how the choice of data structures and the algorithm design methods impact the performance of programs.
To clear up troubles the usage of set of rules design methods including the grasping approach, divide and overcome, dynamic programming, backtracking and department, and certain.
To understand the variations among tractable and intractable problems.
To introduce p and np classes.
Teacher:
Shariful Islam
Skill Level
:
Beginner