Anna University, Subject code – CS3301, deals with the B.E Computer Science and Engineering Semester -III Data Structures syllabus regulation 2021 relating to affiliated institutions. From here, Students can get assistance in preparing notes to excel in academic performance.

We include every topic of the Data Structures Syllabus, to understand the subject very well. It will help you to improve your idea of syllabus of CS3301-Data Structures Syllabus on your finger tips to go ahead in a clear path of preparation. In this following article Data Structures Syllabus, will help you, Hope you share with your friends.

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

**Aim Of Concept:**

- To understand the concepts of ADTs.
- To Learn linear data structures – lists, stacks, and queues.
- To understand non-linear data structures – trees and graphs.
- To understand sorting, searching and hashing algorithms.
- To apply Tree and Graph structures.

**CS3301- Data Structures Syllabus**

**Unit I:** Lists

Abstract Data Types (ADTs) – List ADT – Array-based implementation – Linked list implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists – Polynomial ADT – Radix Sort – Multilists.

**Unit II:** Stacks And Queues

Stack ADT – Operations – Applications – Balancing Symbols – Evaluating arithmetic expressionsInfix to Postfix conversion – Function Calls – Queue ADT – Operations – Circular Queue – DeQueue – Applications of Queues.

**Unit III:** Trees

Tree ADT – Tree Traversals – Binary Tree ADT – Expression trees – Binary Search Tree ADT – AVL Trees – Priority Queue (Heaps) – Binary Heap.

**Unit IV:** Multiway Search Trees And Graphs

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph – Breadth-first traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort – Dijkstra’s algorithm – Minimum Spanning Tree – Prim’s algorithm – Kruskal’s algorithm

**Unit V:** Searching, Sorting And Hashing Techniques

Searching – Linear Search – Binary Search. Sorting – Bubble sort – Selection sort – Insertion sort – Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining – Open Addressing –Rehashing – Extendible Hashing.

**Text Books:**

- Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education, 2005.
- Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007

**References:**

- Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition, Pearson Education, 2015.
- Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms”, Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
- Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st edition, Pearson, 2002.
- Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

**Related Posts On Semester III:**

- MA3354 – Discrete Mathematics
- CS3351 – Digital Principles and Computer Organization
- CS3352 – Foundations of Data Science
- CS3391 – Object-Oriented Programming