Course

• Introduction to algorithm lab environment and problem analysis 
• Linear search and binary search – implementation and comparison 
• Bubble sort – performance analysis 
• Insertion sort and selection sort 
• Comparative study of simple sorting algorithms 
• Divide and conquer – merge sort 
• Quick sort and performance comparison 
• Recursion fundamentals – factorial, Fibonacci 
• Tower of Hanoi – recursive analysis 
• Analysis of iterative vs recursive algorithms 
• Back substitution method for recurrence relations 
• Master’s theorem – practical validation 
• Greedy algorithm (basic problems) 
• Algorithm optimization case study 

Course Objective(s) 

• Provide hands‑on experience in implementing standard algorithms. 

• Enable students to analyze time and space complexity through practical experimentation. 

• Develop skills in designing and comparing algorithmic solutions. 

• Reinforce recursive and iterative problem‑solving techniques. 

Course Outcomes 

CO-PO Mapping 

• Analysis of Algorithms, Jeffrey J McConnel, Jones and Bartlett Publishers, Inc, 2nd Revised edition, 2 November 2007  
• Introduction to the Design and Analysis of Algorithms, Anany Levitin, Third Edition, Pearson Education, 2012  
• Introduction to Algorithms, Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. Third Edition, Prentice-Hall of India Private Limited; 2009.