Design & Analysis of Algorithms

Introduction, comparison sorting, integer sorting, and selection; lower bounds, divide and conquer, master theorem, dynamic programming, graph representation, traversal, ordering, shortest paths, greedy algorithms, minimum spanning trees, string algorithms, amortized analysis, computational geometry, NP-completeness and approximation.

Hours: XYZ where X = Lecture, Y = Lab, Z = Credit
All hours are per week.
3 Lab hours constitute 1 credit hour
1 credit hour implies 1 lecture of 50mins per academic week. 16 weeks in total.
Pre-Requisite courses are courses required to be completed before this course may be taken
Co-Requisite courses are courses required to be taken along with this course