| Course Name | Design and Analysis of Algorithms Lab |
| Course Code | 26CSA584 |
| Program | M. C. A. |
| Semester | 2 |
| Credits | 1 |
| Campuses | Amritapuri, Mysuru |
Searching algorithms: Linear, Binary, and Hashing and its analysis. Sorting Algorithms: Bubble sort, insertion sort, selection sort, merge sort, quick sort, and its analysis. Greedy Methodology: Fractional knapsack, Job sequencing, Optimal Merge pattern with time complexity. Dynamic Programming: 0 or 1 knapsack problem, TSP and its analysis. Graph and tree applications: BFS, DFS, BST, Minimum Spanning Tree, Dijkstra’s, Floyd’s algorithm with time complexity.
Course Description
The primary objective of this course is to introduce the design and analysis of algorithms. Students will learn how to design an efficient algorithm with a computable problem. This includes modelling the problem, selecting appropriate algorithm design techniques, analyzing the efficiency of algorithms and proving the correctness of algorithms.
Course Objectives
Course Outcomes
|
COs |
Description |
|
CO1 |
Analyze and compare searching and sorting algorithms to determine their suitability for different problem contexts and data characteristics. |
|
CO2 |
Design and implement algorithmic solutions using greedy and dynamic programming paradigms to solve structured optimization and decision‑based problems. |
|
CO3 |
Apply and analyze graph‑ and tree‑based algorithms to model, solve, and interpret problems involving hierarchical and network‑oriented data structures. |
CO-PO Mapping
|
PO/PSO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
|
CO |
||||||||
|
CO1 |
3 |
3 |
2 |
– |
1 |
– |
– |
1 |
|
CO2 |
3 |
3 |
3 |
– |
1 |
– |
– |
1 |
|
CO3 |
3 |
3 |
3 |
– |
1 |
– |
– |
1 |
|
CO4 |
3 |
3 |
3 |
– |
1 |
– |
– |
1 |
|
CO5 |
3 |
3 |
3 |
– |
1 |
– |
– |
2 |
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.
