IMP QUESTIONS - Data Structures and Algorithms DSA using C/C++ Language.
Unit:-1
1.Data structure( Operations performed on Data structure, Classification of Data structures, Linear and Non Linear data structure, Primitive and Non-primitive data structure, Static and Dynamic data structure, Homogeneous and Non homogeneous (heterogeneous) data structure )
2. Abstract Data Type (ADT)
3. Stack Data Structure, Push, Pop and Peep Operations ,C Program for Push, Pop, Peep operations of Stack data structure, Applications of Stack Data Structure)
4. Circular Queue Data Structure, Insertion, Deletion and Traversing Operation
5. Double Ended Queue or Dequeue or Deque or head tail linked list & Priority Queue, Applications of Queue )
Unit:-2
1. Linked List Data structure , Types of Linked List, Operations performed on Linked List(Singly Linked List (SLL) Introduction and Creation Create function/algorithm,Singly Linked List (SLL) traversing/visiting operation, traverse function/algorithm )
2. Singly Linked List (SLL) Insertion operation and their types, Insert functions/algorithms, Singly Linked List (SLL) Deletion operation and their types, Delete functions/algorithms,Singly Linked List (SLL) Reversal operation, Reverse function/algorithm
3. Doubly Linked List (DLL) Introduction and creation operation, create function/algorithm, Doubly Linked List (DLL) Traversing- Backward and Forward,Doubly Linked List(DLL) insertion operation, insert functions/algorithms,Doubly Linked List(DLL) deletion operation, Delete functions/algorithms
4. Circular Linked List (CLL) Introduction and Program
5. Dynamic Stack or Linked Stack or Linked List representation of Stack, Linked Stack Operations and Program
6. Dynamic Queue or Linked Queue or Linked List representation of Queue, Linked Queue Operations and Program
Unit-3
1. Tree data structure and terminology (ट्री डाटा स्ट्रक्चर एवं परिभाषाएँ)
2. Representation of Binary Tree or Binary Search Tree(BST)
3. preorder, inorder and postorder traversal of binary tree or binary search tree(BST) with program.
4. AVL (Adelson, Velski and Landis) tree
5. Threaded Binary Tree (थ्रेडेड बाइनरी ट्री)
Unit:-4
1. Binary Search or half-interval search or logarithmic search or binary chop Introduction and function / algorithm / program
2. Insertion Sort (इंसर्शन सॉर्ट), Selection Sort (सिलेक्शन सॉर्ट )
3. Merge Sort (मर्ज सॉर्ट), Quick Sort (क्विक सॉर्ट)
4. worst case,average case and best case complexity o...
Unit:-5
1. Hashing (हैशिंग), Hash collision and its resolution
2. Graph data structure, directed graph, undirected graph and weighted graph
3. BFS algorithm introduction and implementation in C language, DFS algorithm introduction and implementation in C language
4. Spanning Tree and Minimum Spanning Tree
5. shortest path (Dijkstra's) algorithm
