Course Title: Analysis and design of Algorithms Text Books/Readings: Thomas H Corman, Charles E. Leiserson, Ronald L.

Rivest and Clifford Stein, Intr oduction to Algorithms (2nd edition, 2001). M. A. Iqbal, Graph Theory & Algorithms, Electronic Edition, 2009.

Grading Scheme: Quizzes: 35% Midterm: 30% Final Exam: 35% Module Titles: o o o Algorithms for sorting and selection (2 Week) Standard Sorting algorithms: Selection, Insertion Sort (CLR-Chapter 2) Sorting in linear time: Counting, Bucket Quick Sort and Merge Sort (CLR-Chapter 7) Dynamic Programming and Greedy Algorithm (3.5 Week)

o Knapsack: Element selection, Change problem(Bounded and Unbounded) (CLR-Chap ter 15) o The Knapsack Problem

MIDTERM o . o o o o Matrix Chain (CLR-Chapter 15) Graph algorithms (6 Week) Representation of graphs (CLR-Chapter 22) Depth first search (CLR-Chapter 22) Breadth first search (CLR-Chapter 22) MST (CLR-Chapter 23)

o Shortest Path : Single Source, Single Pair, All Pair (CLR-Chapter 23-24) (bE LLMAN FORD+ VARIATIONS, Floyd warshall) o o Connected components, strongly connected components Algorithmic Issues & Complexity Calculations