DIU-BLC
Algorithm Design and Analysis (Self Study)
0%
Previous
Course data
General
Student Interest Survey
Announcements
Assignment
Breath First Search (BFS) Assignment
Graph Assignment
Online Live Class (Big Blue Button)
Week 01
Discussion on Week-01Forum
Prerequisite Documents
Minimum Spanning Tree
BFS and DFS
Introduction with the Asymptotic Notation
Discussion on Week-02Forum
Week-03 Searching and Sorting Algorithm Based on Brute Force Approach
Quiz-01
Discussion on Week-03Forum
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
Mid Term Examination Instruction
Discussion about Mid Term Exam
Mid Term Exam Part 1 (Quiz)
Plagiarism Report on SE214 Mid Exam (Quiz)
Mid Term Exam Part 2 (Written Exam)
Topic 10
Quiz -01
Discussion on Week-06Forum
Dynamic Programming Intro
Fibonacci Tree (DP)
Week-08 Introduction to Dynamic Programming (Continue)
Discuss on Week-08 content if you have any problem and confusion.
LCS Table Fillup
MSCS
MSCS Algorithm Code
LIS
LIS Code Submission
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
Presentation Slide Submission
Week-14 Final Examination
Fall_2020_Algorithm_Design_and_Analysis_Final_Question
Student Feedback Form July 2020
BLC courses feedback form July 2020
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 (SL241)
Home
Report
Skip to main content
Course info
Home
Courses
DIU
SE 214 (SL241)
Summary
Algorithm Design and Analysis (Self Study)
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.
Skill Level
:
Beginner