DIU-BLC
Algorithm (Summer 2021)
0%
Previous
Course data
Welcome Note
Algorithms Project List
Week-01 Preparing Background
Week-02: Notation and Complexity Analysis
Discussion on Week-02
Week-03 Searching and Sorting Algorithm Based on Brute Force Approach
Announcements of Quiz - 1
Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach
Lab Performance Test - 1: Section: O-2
Instruction for Lab Performance Test - 01_Section: O-2
Week-05 Introduction to Greedy Approach
Week-06: Introduction to Dynamic Programming
Week-07 Mid-Term Examination
Week-08: Introduction to Dynamic Programming (Continue)
Discussion on Week-08
Week-09: Introduction to Graph And Graph Traversal
Week-10: Graph Application
Week-11: Graph: Single Source Shortest Path Algorithm
Discussion on Week-11
Graph
BFS
DFS
TS
SCC
Kruskal
Prims
Dijkstra
Exercise
Week-12: Graph: All Pair Shortest Path Algorithm
Week-13: Final Presentation and Lab Final
Week-14: Final Examination
Discussion on Week-14
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
CSE 214/215 (SM-212)
Home
Calendar
Skip to main content
To operate the Blended Learning Center(BLC) at optimal level, maintenance will be performed every day at 8:30 AM and at 5:00 PM regularly which can take up to 30 minutes. Please consider scheduling your activity in the BLC platform accordingly.
Algorithm (Summer 2021)
Home
Courses
DIU
Faculty of Science and Information Technology
Computer Science and Engineering
CSE Summer 2021
CSE 214/215 (SM-212)
Resources
Topic
Name
Description
Algorithms Project List
Week-04 Searching and Sorting Algorithm Based on Divide and Conquer Approach
Lab Performance Test - 1: Section: O-2
Instruction for Lab Performance Test - 01_Section: O-2
Week-11: Graph: Single Source Shortest Path Algorithm
Graph
BFS
DFS
TS
SCC
Kruskal
Prims
Dijkstra
Exercise