CSE 208

CSE 207 Algorithms Sessional

3 hours in a week, 0.75 credits

Introduction to algorithms; Correctness proof and techniques for analysis

of algorithms; Master Theorem; Methods for the design of efficient

algorithms: divide and conquer, greedy methods, dynamic programming;

Graph algorithms: DFS, BFS, Applications of DFS and BFS, MST

algorithms, shortest path algorithms, maximum flow and maximum

bipartite matching; Lower bound theory; NP-completeness; NP-hard and

NP-complete problems; Coping with hardness: backtracking, branch and

bound, approximation algorithms;String matching algorithms; FFT and

its applications.