Design and Analysis of Algorithms(2024-25)

Welcome to the course

We will be following three text books
• Text book1 : Fundamentals of Computer Algorithms by Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran
• Text book2 : Introduction to the design and analysis of Algorithms, Anany Levitin
• Text book3 : Introduction to Algorithms by Thomas H. Cormen, charles e. leiserson, ronald l. rivest, clifford stein
• (Unit-I) Introduction : Text book1 (Pages 1 to 62)
• (Unit-II) Decrease and conquer : Text book2 ( Click here )
• (Unit-II) Divide and conquer : Text book1 (Pages 136 to 196)
• (Unit-II) Transofrm and conquer : Text book2 ( Click here)
• (Unit-III) Greedy : Text book1 (Pages 210 to 269)
• (Unit-IV) Dynamic Programming : Text book1 (Pages 272 to 317)
• (Unit-V) BackTracking : Text book1 (Pages 359 to 392)
• (Unit-V) Branch and Bound : Text book1 (Pages 399 to 431)