Back close

Course Detail

Course Name Data Structures and Algorithms
Course Code 19CCE202
Program B. Tech. in Computer and Communication Engineering
Semester Three
Year Taught 2019


Unit 1

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.

Unit 2

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.

Unit 3

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.


  • Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to Algorithms”, Third Edition, MIT Press, 2009.
  • Robert Sedgewick and Kevin Wayne, “Algorithms”, Fourth Edition, Addison Wesley, 2011.


  • Kurt Mehlhorn and Peter Sanders, “Data Structures and Algorithms:The Basic Toolbox”, Springer, 2008.
  • John V. Guttag, “Introduction to Computation and Programming using Python”, MIT Press, second edition, 2016.

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 and Outcomes


  • To learn the linear and non-linear data structures and explore its applications
  • To understand representation using graph data structure
  • To comprehend and employ basic sorting and searching algorithm

Course Outcomes

  • CO1: Ability to implement linear and non-linear data structure operations using C
  • CO2: Ability to solve problems using appropriate data structures
  • CO3: Ability to analyze the algorithms and its complexity
  • CO4: Ability to employ sorting and searching algorithms using relevant data structures

CO – PO Mapping

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.

Admissions Apply Now