Subject code CD3281 deals with the subject Data Structures And Algorithms Laboratory of semester III from B.tech Information Technology, Anna University based on regulation 2021. In this article, we discuss the syllabus of the Data Structures And Algorithms Laboratory in a detailed manner.

We aim to provide the following article CD3281 – Data Structures And Algorithms Laboratory Syllabus with details. It will assist the students in preparing for examinations. We include the required syllabus, along with the textbooks and references added to this article. Hope you find the details required as per your needs. As per my knowledge, we included everything required in this article. Hope this information is useful. Comment below if you need more info from our website. Aplustopper will try to fulfill your needs regarding the subject.

If you want to know more about the syllabus of B.Tech Agricultural Engineering connected to an affiliated institution’s four-year undergraduate degree program. We provide you with a detailed Year-wise, semester-wise, and Subject-wise syllabus in the following link B.Tech Information Technology Syllabus Anna University, Regulation 2021.

**Aim Of Concept:**

- 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

**CD3281 – Data Structures And Algorithms Laboratory Syllabus**

**List Of Experiments:**

- Implement simple ADTs as Python classes
- Implement recursive algorithms in Python
- Implement List ADT using Python arrays
- Linked list implementations of List
- Implementation of Stack and Queue ADTs
- Applications of List, Stack and Queue ADTs
- Implementation of sorting and searching algorithms
- Implementation of Hash tables
- Tree representation and traversal algorithms
- Implementation of Binary Search Trees
- Implementation of Heaps
- Graph representation and Traversal algorithms
- Implementation of single source shortest path algorithm
- Implementation of minimum spanning tree algorithms

**Text Book:**

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

**References:**

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

**Related Posts On Semester – III:**

- CS3381 Object-Oriented Programming Laboratory
- CS3361 Data Science Laboratory
- GE3361 Professional Development

**Must Read For More:**