Data Structures and Algorithms Practical Work Book

Complete laboratory work book with 10 essential data structure implementations, test cases, and memory layouts in C.

Data Structures and Algorithms · CACS201 · Semester 3

Curriculum

Unit 2•Unit 2 of 2

Unit 2: Linear Data Structures: Stacks and Applications

Lab 01: Implementation of Stack ADT using Array with Push, Pop, and Display.
Lab 02: Conversion of Infix Expression to Postfix using Stack.
Lab 03: Evaluation of Postfix Expression using Stack Operations.
Lab 04: Implementation of Circular Queue using Array and Modulo Arithmetic.
Lab 05: Singly Linked List: Insertion (Front, End, Specific Position) and Deletion.
Lab 06: Linked List implementation of Stack and Linear Queue.
Lab 07: Binary Search Tree (BST) Creation and Inorder/Preorder/Postorder Traversals.
Lab 08: Quick Sort implementation using Hoares Partitioning Scheme.
Lab 09: Merge Sort implementation using Divide and Conquer Strategy.
Lab 10: Graph Traversal using Breadth First Search (BFS) and Depth First Search (DFS).

What is the worst-case time complexity of Quick Sort algorithm? (a) O(n) (b) O(n log n) (c) O(n^2) (d) O(log n)objective · 1 marks
Differentiate between Linear Queue and Circular Queue. Explain how modulo arithmetic prevents false overflow.short · 5 marks