DSA Mid Term Syllabus

DSA Pre-Mid Topics

1.    All General Algorithms related to search and sort.

2.    Arrays. General arrays and traversal algorithms.

a.     Polynomial algorithms, general matrices.

b.    Dynamic arrays, dynamic declaration, dynamic growth and shrinking.

c.     Inorder insertion. Deletion, inorder deletion.

d.    2D array search, traversal. Complex 2D/3D loops for any purpose.

3.    Algorithm techniques:
         Brute Force vs Divide & Conquer.

4.    Time cost. Loop cost, nested loop, initialization and boundary checking cost. Exact cost verses order of complexity.

5.    Stack: 
          using Array and Linked list. Stack ordering, ToH problem, in-order insertion in stack using a temporary stack, stack search and delete using temporary stack, Sorting using stack.

6.    Expression evaluation: Complete.

7.    Recursion:
          Recursion for Brute-force and Divided & Conquer.

8.    Queue:
           using array and linked list. General Queue, Priority Queue. Techniques to recover space before head of queue. Circular Queue. Searching/Sorting using queue.

9.    Linked list:
         Single, double, circular link list. List as stack or queue. Insertlast, insertfirst, insertInorder, deletelast, deletefirst, deleteAt, deleteAfter, deletebefore, searchAndDeleteetc in all types of link lists. Insert an existing Node(without creation). Attach/Detach techniques. Ordering/Sorting of existing link list.