Course Detail


CSE207


Data Structures and Algorithms II

3 Credit Hour Course

Intended For Level 2 Term 1 Students

Prerequisite: CSE105

Graph algorithms: minimum spanning tree algorithms, shortest path algorithms, maximum flow and maximum bipartite matching; Advanced data Structures: balanced binary search trees (AVL trees, red-black trees, splay trees) skip list, 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.