Back close
Admissions

Course Detail

Course Name Algorithms Lab
Course Code 26CSA381
Program 5 Year Integrated B.C.A – M.C.A
Semester 5
Credits 1
Campus Mysuru

Syllabus

  • 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 

Objectives and Outcomes

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 

COs 

Description 

CO1 

Implement searching and sorting algorithms and analyze their performance 

CO2 

Analyze iterative and recursive algorithms using empirical and theoretical methods 

CO3 

Design and implement algorithms using standard design paradigms 

CO4 

Evaluate algorithm efficiency using asymptotic notation and complexity analysis 

CO5 

Apply algorithmic problemsolving skills to learn advanced computing techniques independently 

 

CO-PO Mapping 

PO 

PO1 

PO2 

PO3 

PO4 

PO5 

PO6 

PO7 

PO8 

CO 

CO1 

3 

2 

3 

2 

0 

0 

0 

1 

CO2 

3 

3 

2 

2 

0 

0 

0 

1 

CO3 

2 

3 

3 

2 

1 

0 

0 

1 

CO4 

3 

3 

2 

2 

0 

0 

1 

1 

CO5 

2 

1 

2 

2 

0 

0 

0 

3 

Textbooks

  • 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.  

Evaluation Pattern

Assessment Weightage (%)
Continuous Assessment 70
End Semester Exam 30
Total Marks 100

DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.

Admissions Apply Now