Course Contents

• Time complexity measures

• Algorithm Design using Divide and Conquer

• Binary Search

• Merge Sort

• Quick Sort

• Matrix multiplication

• Algorithm Design using Greedy Approach

• Text Compression

• Minimum cost road network

• Shortest Path from A to B

• Knapsack problem

• Algorithm Design using Dynamic Programming

• Fibonacci number generation

• Shortest Path between any two given nodes

• Travelling Salesman Problem

• Chain Matrix multiplication

• Knapsack problem

• String matching (DNA sequencing)

• Optimal BST

• Flow Shop Scheduling

• Algorithm Design using Backtracking

• Meeting scheduling problem (graph Coloring)

• N-Queen problem

• Discussion on Extremely Difficult problems

• TSP

• Circuit Design Testing

• Network Monitoring Problem

• Non-Deterministic Algorithm

• P and NP

----------------------------------------------------------------------------
Reference Books:

• Design and Analysis of Algorithms by Goodrich and Tamassia, WILEY

• Algorithms by Johnsonbaugh and Schaefer, PEARSON

• Design and Analysis of Algorithms by S. Sridhar, oxford University Press

• Introduction to Algorithms, by Cormen and others 3rd Edition, PHI

• Lot of Material available ONLINE in tutorial form

----------------------------------------------

Tentative Evaluation Scheme

• 3 Quiz Tests : 20

• Lab work : 25

• Mid Term : 20

• End Term : 35

---------------------

Tentative class Hours

• Following slots are available for the course

• Monday 4- 6 PM

• Wednesday 5 – 6 PM

• Thursday 3 – 4 PM

• Friday 5 – 6 PM

• Extra classes may be scheduled on other days

-------------------------------------------------

• -----------