CS25303 Data Structures Laboratory Syllabus:

CS25303 Data Structures Laboratory Syllabus – Anna University UG Syllabus Regulation 2025

Course Objectives:

• To demonstrate array implementation of linear data structure algorithms.
• To implement the applications using Stack.
• To implement the applications using Linked list
• To implement Binary search tree and AVL tree algorithms.
• To implement the Heap algorithm.
• To implement Dijkstra’s algorithm.
• To implement Prim’s algorithm
• To implement Sorting, Searching and Hashing algorithms.

List of Experiments:

1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)

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

Assessment Methodology: Project (30%), Assignment (10%), Practical (30%), Internal Examinations (30%)