CD3281 Data Structures and Algorithms Laboratory Syllabus:

CD3281 Data Structures and Algorithms Laboratory Syllabus – Anna University Regulation 2021


 To implement ADTs in Python
 To design and implement linear data structures – lists, stacks, and queues
 To implement sorting, searching and hashing algorithms
 To solve problems using tree and graph structures


1. Implement simple ADTs as Python classes
2. Implement recursive algorithms in Python
3. Implement List ADT using Python arrays
4. Linked list implementations of List
5. Implementation of Stack and Queue ADTs
6. Applications of List, Stack and Queue ADTs
7. Implementation of sorting and searching algorithms
8. Implementation of Hash tables
9. Tree representation and traversal algorithms
10. Implementation of Binary Search Trees
11. Implementation of Heaps
12. Graph representation and Traversal algorithms
13. Implementation of single source shortest path algorithm
14. Implementation of minimum spanning tree algorithms


At the end of the course, the student should be able to:
CO1:Implement ADTs as Python classes
CO2:Design, implement, and analyse linear data structures, such as lists, queues, and stacks, according to the needs of different applications
CO3:Design, implement, and analyse efficient tree structures to meet requirements such as searching, indexing, and sorting
CO4:Model problems as graph problems and implement efficient graph algorithms to solve them


1. Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures & Algorithms in Python”, John Wiley & Sons Inc., 2013


1. Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011
2. Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education, 1983.
3. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to Algorithms”, Second Edition, McGraw Hill, 2002.
4. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson Education, 2014