3 Credit Hour Course
Intended For Level 2 Term 1 Students
Prerequisite: CSE103, CSE203
Graph algorithms: MST algorithms, shortest path algorithms, maximum ow and maximum bipartite matching; Lower bound theory; Advanced data Structures: balanced binary search trees (AVL trees, red-black trees, splay trees, skip lists), advanced heaps (Fibonacci heaps, binomial heaps); Hashing; NP-completeness; NP-hard and NP-complete problems; coping with hardness: backtracking, branch and bound, approximation algorithms; String matching algorithms; FFT and its applications.
