Data Structures and Algorithms Practical Work Book
Complete laboratory work book with 10 essential data structure implementations, test cases, and memory layouts in C.
Verified Lab ManualCACS201· TU
Data Structures and Algorithms Practical Work Book
TU · BCA · Data Structures and Algorithms
Data Structures and Algorithms Laboratory Manual
Course Code: CACS201 | Practical Marks: 40 Marks
Core Laboratory Practical Exercises:
- 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).
