Click over what you need:

Syllabus Books Lecture Slides
Questions Topicwise Questions Suggestions

👉 Click Here to open the other courses of CSE


 Other Names of this Course / Subject 
Algorithm, Algorithm Design



 Syllabus                                                                                                                 
> Techniques for analysis of algorithms;
> Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programming, backtracking, branch and bound;
> Basic search and traversal techniques;
> Topological sorting;
> Connected components, spanning trees, shortest paths;
> Flow algorithms; Approximation algorithms;
> Parallel algorithms; Algebraic simplification and transformations;
> Lower bound theory; NP-completeness, NP-hard, and NP-complete problems.



 Books 
> Introduction to Algorithms
Thomas H. Cormen and others [3rd Edition]

> Introduction to Algorithms
Thomas H. Cormen and others [3rd Edition]



 Lecture Slides 

👆

Sorry! Lecture Slides for this course are not available now. We'll try to add it later.



 Questions of Previous Years 

👆

(According to Barishal University)

> 1st Mid: 6th Batch, 5th Batch

> 2nd Mid: 6th Bah

> Semester Final: 6th Batch, 5th Batch, 4th Batch

> Others: 5th Batch



 Suggestions / Others 
👆
> All Codes of Algorithm [By Muntasir Moonaz, CSE 6th, BU]



 Topicwise Questions 
👆
> Click Here to Open the Topicwise Questions



👉 Click Here to open the other courses of CSE