Specific preparation plan for DSA Lab:

1) Different versions of GCD programs done in class and lab. (SEE Theory and Lab Exam)

2) Insertion of a node, deletion of a node from a singly linked list; creation/construction of a linked list to
test the methods.

3) Insertion of an entry (node), deletion of an entry (node) from a queue (enqueuer and dequeuer
methods); creation/construction of a queue to test the methods.

4) Push and Pop methods for stack; checking if a list of parentheses is well-matched;
creation/construction of a stack to test the methods.

5) Binary Search

6) Inorder, pre-order and post order traversal algorithms and programs of a binary tree.

Creation/construction of a binary tree to test the methods.

7) Bubble Sort

8) Insertion Sort algorithm and program

9) Circularly Linked List

10)Doubly Linked List