| Course Name | Data Structures and Algorithms |
| Course Code | 19CCE202 |
| Program | B. Tech. in Computer and Communication Engineering |
| Semester | Three |
| Year Taught | 2019 |
Algorithm Analysis – Methodologies for Analyzing Algorithms – Asymptotic Notation – Recurrence Relations – Data Structures – Linear Data Structures (Stacks – Queues – Linked-Lists – Vectors) -Trees (Binary Search Trees – AVL trees – Red-Black trees – B-trees) – Hash-Tables (Dictionaries – Associative Arrays – Database Indexing – Caches – Sets) and Union – Find Structures.
Searching and Sorting (Insertion and Selection Sort – Quick sort – Merge sort – Heap sort – Bucket Sort and Radix Sort) – Comparison of sorting algorithms and lower bounds on sorting – Fundamental Techniques – The Greedy Method – Divide and Conquer – Dynamic Programming.
Graph Algorithms: Elementary Algorithms – Breadth-first search – Depth-first search – Topological sort – strongly connected components – Minimum Spanning Trees – Single-Source Shortest Paths – All-Pairs Shortest Paths – Maximum Flow – Network Flow and Matching – Flows and Cuts.
Evaluation Pattern
| Assessment | Internal | External |
| Periodical 1 (P1) | 15 | – |
| Periodical 2 (P2) | 15 | – |
| *Continuous Assessment (CA) | 20 | – |
| End Semester | – | 50 |
| *CA – Can be Quizzes, Assignment, Projects, and Reports. | ||
Objectives
Course Outcomes
CO – PO Mapping
| PO/PSO/CO | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 |
| CO1 | 3 | 3 | 3 | 3 | – | – | – | – | 3 | 3 | – | 3 | 3 | – |
| CO2 | 3 | 3 | – | 3 | – | – | – | – | 3 | 3 | – | – | 3 | – |
| CO3 | 3 | 3 | 3 | 3 | – | – | – | – | 3 | 3 | – | 3 | 3 | – |
| CO4 | 3 | 3 | – | 3 | 3 | – | – | – | 3 | 3 | – | – | 3 | – |
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.
