CS25302 Data Structures Syllabus:

CS25302 Data Structures Syllabus – Anna University UG Syllabus Regulation 2025

Course Objectives:

• This course presents various data structures and their importance to provide a comprehensive view about problem solving skills.

Linear Data Structures: Abstract Data Types- Internal Representation of Primitive Data Structures- One Dimensional and Multi-Dimensional Arrays- linear lists- Singly, doubly, Circular linked lists- Applications.

Stacks and Queues: Stack: Representations – Operations – Implementations – Applications. Queue: Representations – Operations – Implementations – Types – Applications

Trees: Representations – Types – Binary Search Trees (BSTs) – AVL Tree – Operations: Search, Traversals, Rotations – Balanced BSTs- Splay trees- B-treesBinary Heaps.

Sorting, Searching and Hashing Techniques: Linear and Binary Search – Bubble Sort – Insertion Sort- Merge Sort- Bucket Sort- Quick Sort- Heap sort- Hashing techniques- Dictionaries- Hash function- Collision – Separate chaining- open addressing.

Graphs: Representation – Types – Operations – Prim’s, Kruskal algorithms – Dijikstra’s algorithm – Connected and Biconnected Components

Weightage: Continuous Assessment: 40%, End Semester Examinations: 60%.

Assessment Methodology: Assignments (20%), Solution to application-oriented problems using software (20%), Review of GATE questions (20%), Internal Examinations (40%).

References

1. Gilberg, R. F., & Forouzan, B. A, “Data Structures: A Pseudocode Approach”, Cengage Learning India Private Limited, 2023
2. Mark Allen Weiss, “Data Structures and Algorithm Analysis in C++”, 4th Edition, Pearson, 2014.
3. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson, 2001.
4. D.S. Malik, Data Structures Using C++, 2nd Edition, Cengage, 2012.

e- Resources

• https://nptel.ac.in/courses/106102064
• https://nptel.ac.in/courses/106105085
• https://leetcode.com/