DS Quetions.docx_20241003_155730_0000.pdf

UNIT-1 Q.1.Define Data structure. Explain various types of data structure. Q. 2 Elaborate the term Time complexity of an algorithm? Q. 3 Explain Omega notation with example. Q. 4 Explain the term Best case, Average case, Wrost case define For various algorithm. Q. 5 Difference between file orga...

UNIT-1 Q.1.Define Data structure. Explain various types of data structure. Q. 2 Elaborate the term Time complexity of an algorithm? Q. 3 Explain Omega notation with example. Q. 4 Explain the term Best case, Average case, Wrost case define For various algorithm. Q. 5 Difference between file organization & data structure. Q. 6 Explain Big ( O ) notation with example. Q. 7 What is data structure? Explain linear data structure in detail. Q. 8 Explain Time complexity with their components and example. Q. 9 What do you mean by Asymptotic notation? Q. 10 Explain Theta notation with example. Q. 11 How would you define array s describe the storage structure of array also explain various types of array in detail. Q. 12 Explain multidimension array with example. UNIT-2 Q.1.Explain the concept of stack with diagram Q. 2.Define stack with its operations Q. 3.Explain how we can represent stack using array Q.4.Explain how we can represent stack using linkedlist. Q.5.Explain push and pop operation of stack with diagram and code Q. 6.Define Queue and different operation on queue with code Q. 7.Explain the queue operations using array Q. 8.Explain the concept of queue using linkedlist. Q.9.Define circular queue with example Q. 10.Explain the concept of dequeue with example Q. 11.Exaplain priority queue with example Unit-3 1.Difference between linear data structure & non-linear data structure 2.Explain linear list with its different operations of linear list 3.How we can represent linear list using array 4.Define linked list with its different operations 5.How we can insert elements in the linked list explain with code at the beginning 6.How we can insert elements in the middle of the linked list explain with code 7.Defin doubly linked list with its different operations 8.How we can insert an element at the beginning of doubly linked list explain with code 9.How we can insert a elements at the middle of doubly linked list 10.Write down the difference between singly linked list and doubly linked list 11.Diffenence between arrays and linked list. Unit 4 1. Define Sorting also explain its types. 2. Explain Selection Sort algorithm with example. 3. Write down the code for selection sort algorithm? 4. Explain Bubble Sort algorithm with example. 5. Write down the code for Bubble Sort algorithm? 6. Explain Insertion Sort algorithm with example. 7. Write down the code for insertion sort algorithm? 8. Explain Linear Search algorithm with example? 9. Write down the code for linear search algorithm. 10. Explain Binary Search algorithm with example. 11. Write down the code for Binary Search algorithm? 12. Write down the difference between Internal Sorting and External Sorting algorithm? Unit 5 1. Define Tree and its terminologies. 2. Explain the way of Representing a tree? 3. What is mean by Binary Tree also explain its different types? 4. Explain different ways of Representation of Binary Tree. 5. Explain In-Order Traversal with example. 6. Explain Pre-Order Traversal with example. 7. Explain Post-Order Traversal with example.