DS IMP

Click Here for DS G-drive

Ch:-1 intro.. 10%

👉Algorithms and it's Characteristic
👉ADT
👉Time Complexity Vs space Complexity imp
👉linear vs non linear data Structure mimp

Ch-2 Array 

👉Spares matrix

Ch-3  Stack
👉PUSH/POP algorithm mimp
👉Infix to Postfix Expression mimp
👉Reverse Polish Compilation
👉Tower of Hanoi

Ch-4  Queue 

👉Stack vs Queue
👉Operations of Queue
👉Circular Queue
👉Priority Queue mimp
👉insert/Delete operation in circular Queue

Ch-5 Linked List

👉Singly Linked List mimp   insertion/deletion
👉Doubly Linked List mimp  insertion/deletion
👉Circular Linked list mimp insertion/deletion

Ch -2, 3,4,5 30%

Ch-6  Tree

👉Binary Tree Traversal mimp
👉Binary Search Tree mimp
👉AVL Trees mimp
👉LL, RR, RL, LR
👉B-Trees mimp
👉2-3 Trees

 CH-7  Graphs

👉Basic Terminology
👉Display Graph (BFS) /(DFS) MIMP
👉Minimum Spanning Tree
👉Kruskal's Algorithm imp

Ch-6, 7  30%

Ch-8 Hashing 

👉Hashing Functions
👉Collision Resolution Techniques

Ch-9 File Structure

👉Indexed Sequential File
👉Random File
👉multi-key File Organization

Ch-8, 9 15%

Ch-10 Sorting and Searching  15%

👉Bubble/selection/Quick/Merge..Sort
👉Searching

Click Here for DS G-drive