Subject code AD3271 deals with semester II of B.Tech Artificial Intelligence and Data Science regarding affiliated institutions of Anna University Regulation 2021 Syllabus. In this article, you can gather certain information relevant to the data structure design laboratory. We added the information by expertise.
We included the proper textbooks and references to assist in some way in your preparation. It will enhance your preparation and strategies to compete with the appropriate spirit with others in the examination. If you see, you can find the detailed syllabus of this subject unit-wise without leaving any topics from the unit. In this article AD3271 – Data Structures Design Laboratory Syllabus, You can simply read the following syllabus. Hope you prepare well for the examinations. I hope this information is useful. Don’t forget to share with your friends.
If you want to know more about the syllabus of B.Tech Artificial Intelligence And Data Science 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. Artificial Intelligence And Data Science Syllabus Anna University, Regulation 2021.
Aim of Objectives:
- 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
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 Books:
- Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures and Algorithms in Python” (An Indian Adaptation), Wiley, 2021.
- Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition 2015.
- Narasimha Karumanchi, “Data Structures and Algorithmic Thinking with Python” Careermonk, 2015.
References:
- Rance D. Necaise, “Data Structures and Algorithms Using Python”, John Wiley & Sons, 2011.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, “Introduction to Algorithms”, Third Edition, PHI Learning, 2010.
- Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, Fourth Edition, Pearson Education, 2014
- Aho, Hopcroft, and Ullman, “Data Structures and Algorithms”, Pearson Education India, 2002.
Related Posts On Semester – II:
You May Also Visit: