Syllabus Data Structures - (CS25C08) 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. (Chapter - 1) Practicals • Single and Multidimensional arrays • Singly, Doubly and Circular Linked Lists Stacks and Queues : Stack : Representations - Operations - Implementations - Applications. Queue : Representations - Operations - Implementations - Types - Applications. (Chapter - 2) Practicals • String reverse operations and Expression evaluation • Circular Queue and Priority Queue Trees: Representations - Types - Binary Search Trees (BSTs) - AVL Tree - Operations: Search, Traversals, Rotations - Balanced BSTs - Splay trees - B-trees - Binary Heaps. (Chapter - 3) Practicals • Traversal operation • AVL Tree rotations • Query and Update operations on Balanced BSTs Sorting, Searching & 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. (Chapter - 4) Practicals • Quick and Heap Sort • Binary Search and Hashing Graphs : Representation - Types - Operations - Prim’s, Kruskal algorithms - Dijkstra’s algorithm - Connected and Biconnected Components. (Chapter - 5) Practicals • BFS and DFS algorithms • Minimum Spanning Tree and shortest path algorithms
