DS
DS
1. Functions of Dequeue
2. B-Tree with Degree 2 and Degree 4
3. Tower of Hanoi
4. Algorithms for Queue, stack Using Linked List
5. Dynamic Memory Allocation With Types
6. Algorithm For Insertion of Array
7. Algorithm For Converting Infix To Postfix For Given Expression
(X-(Y+Z))*{(R+E)/(T-U+V)}
8. Kruskal’s and Prism Algorithm And problem
9. Time And Space Complexity Of Linear And Binary Search
10.Types Of Linked List
11.Row And Column Major for Matrix Address Calculation
12.Asymptotic Notations
13.Various Operations in Stack and Queue.
14.AVL Tree & BST
15.Pointers With Examples
16.Bubble and Heap sort
17.Hashing & Hoffman Coding
18.Various Operations in BST
19.Traversing In BST
20.Complexities of All Processes From Unit 1-5