Data Structures Laboratory
Subject Overview
The practical companion to Data Structures, implementing linear search and binary search trees, quick sort, polynomial representation, heap sort, linked list and queue operations, merge sort, priority queues, doubly linked lists, stacks, Dijkstra's shortest path, dictionary-order binary search trees, and graph traversal and hashing techniques. A 2-credit core lab paper.
Unit-wise Syllabus
1 units — click WhatsApp below to get the full notes for each
Unit 1: Data structure implementation
Linear search and binary search tree implementation, quick sort, polynomial representation using arrays, min/max heap sort, iterative and recursive binary search, linked list operations (insert/delete/update/reverse), array insertion at a specified position, call-by-value/reference swap, circular queue simulation, merge sort, three-queue priority queue, doubly linked list operations, stack PUSH/POP with overflow/underflow handling, Dijkstra's shortest path, dictionary-order binary search tree via inorder traversal, BFS and DFS implementation, hashing technique implementation and complexity measurement