Subject code CD3291 deals with the subject data structures and algorithms 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 in a detailed manner.
We aim to provide the following article CD3291 – Data Structures and Algorithms 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 understand the concepts of ADTs
- To design linear data structures – lists, stacks, and queues
- To understand sorting, searching, and hashing algorithms
- To apply Tree and Graph structures
CD3291 – Data Structures and Algorithms Syllabus
Unit I: Abstract Data Types
Abstract Data Types (ADTs) – ADTs and classes – introduction to OOP – classes in Python – inheritance – namespaces – shallow and deep copying Introduction to analysis of algorithms – asymptotic notations – divide & conquer – recursion – analyzing recursive algorithms
Unit II: Linear Structures
List ADT – array-based implementations – linked list implementations – singly linked lists – circularly linked lists – doubly linked lists – Stack ADT – Queue ADT – double-ended queues – applications
Unit III: Sorting And Searching
Bubble sort – selection sort – insertion sort – merge sort – quick sort – analysis of sorting algorithms – linear search – binary search – hashing – hash functions – collision handling – load factors, rehashing, and efficiency
Unit IV: Tree Structures
Tree ADT – Binary Tree ADT – tree traversals – binary search trees – AVL trees – heaps – multiway search trees
Unit V: Graph Structures
Graph ADT – representations of graph – graph traversals – DAG – topological ordering – greedy algorithms – dynamic programming – shortest paths – minimum spanning trees – introduction to complexity classes and intractability
Text Book:
- Michael T. Goodrich, Roberto Tamassia, and Michael H. Goldwasser, “Data Structures & Algorithms in Python”, An Indian Adaptation, John Wiley & Sons Inc., 2021
References:
- Lee, Kent D., Hubbard, Steve, “Data Structures and Algorithms with Python” Springer Edition 2015
- 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:
- MA3354 Discrete Mathematics
- CS3351 Digital Principles and Computer Organization
- CS3352 Foundations of Data Science
- CS3391 Object-Oriented Programming
Must Read For More: