DSA

1. Which of the following is not the type of queue? BPSC Tre 4.0 DSA Practice Set x 2. Which of the following application makes use of a circular linked list? BPSC Tre 4.0 DSA Practice Set x 3. The data structure required for Breadth First Traversal on a graph is? BPSC Tre 4.0 DSA Practice Set x 4. Which algorithm is used in the top tree data structure? BPSC Tre 4.0 DSA Practice Set x 5. What is the need for a circular queue? BPSC Tre 4.0 DSA Practice Set x 6. Which of the following points is/are not true about Linked List data structure when it is compared with an array? BPSC Tre 4.0 DSA Practice Set x 7. What is an AVL tree? BPSC Tre 4.0 DSA Practice Set x 8. What is a data structure? BPSC Tre 4.0 DSA Practice Set x 9. What will be the output of the following program? BPSC Tre 4.0 DSA Practice Set x 10. The prefix form of A-B/ (C*D^E) is? BPSC Tre 4.0 DSA Practice Set x 11. Which of the following is not the application of stack? BPSC Tre 4.0 DSA Practice Set x 12. What data structure would you mostly likely see in non-recursive implementation of a recursive algorithm? BPSC Tre 4.0 DSA Practice Set x 13. What is a bit array? BPSC Tre 4.0 DSA Practice Set x 14. Which of the following data structures can be used for parentheses matching? BPSC Tre 4.0 DSA Practice Set x 15. What are the disadvantages of arrays? BPSC Tre 4.0 DSA Practice Set x 16. The data structure required to check whether an expression contains a balanced parenthesis is? BPSC Tre 4.0 DSA Practice Set x 17. Which of the following is the most widely used external memory data structure? BPSC Tre 4.0 DSA Practice Set x 18. Which of the following statement(s) about stack data structure is/are NOT correct? BPSC Tre 4.0 DSA Practice Set x 19. Which of the following is also known as Rope data structure? BPSC Tre 4.0 DSA Practice Set x 20. Which of the following data structure can provide efficient searching of the elements? BPSC Tre 4.0 DSA Practice Set x 21. Which of the following tree data structures is not a balanced binary tree? BPSC Tre 4.0 DSA Practice Set x 22. Which data structure is used for implementing recursion BPSC Tre 4.0 DSA Practice Set x 23. Which data structure is based on the Last In First Out (LIFO) principle? BPSC Tre 4.0 DSA Practice Set x 24. Which data structure is needed to convert infix notation to postfix notation? BPSC Tre 4.0 DSA Practice Set x 25. The height of n elements 2-3 tree is ______ BPSC Tre 4.0 DSA Practice Set x 26. Which of the following data structures stores elements in a non-linear relationship? BPSC Tre 4.0 DSA Practice Set x 27. Which data structure is used for efficient searching, insertion, and deletion of elements? BPSC Tre 4.0 DSA Practice Set x 28. In a binary search tree, which subtree of a node contains elements that are greater than the node’s value? BPSC Tre 4.0 DSA Practice Set x 29. The result evaluating the postfix expression 10 5 + 60 6/ * 8- BPSC Tre 4.0 DSA Practice Set x 30. In a balanced binary tree, the height of two sub-trees of every node can not differ by more than BPSC Tre 4.0 DSA Practice Set x 31. Write the output of the following program: int a[ ] = {1,2,3,} *p; BPSC Tre 4.0 DSA Practice Set x 32. A queue has configuration a, b, c, d. If you want to get the configuration d, c, b, a, you need a minimum of _______. BPSC Tre 4.0 DSA Practice Set x 33. The order of the binary search algorithm is _______. BPSC Tre 4.0 DSA Practice Set x 34. How many distinct binary search trees can be created out of 4 distinct keys? BPSC Tre 4.0 DSA Practice Set x 35. Merge Sort is an example of which algorithm design paradigm? BPSC Tre 4.0 DSA Practice Set x 36. The order of the binary search algorithm is _______. BPSC TRE 4 DSA Practice set 1 37. The preorder traversal of a binary search tree is 15, 10, 12, 11,20, 18, 16, 19. Which one of the following is the postorder traversal of the tree? BPSC TRE 4 DSA Practice set 1 38. How many distinct binary search trees can be created out of 4 distinct keys? BPSC TRE 4 DSA Practice set 1 39. Which of the following statements is true about Big-O notation? BPSC TRE 4 DSA Practice set 1 40. Which of the following is NOT a step in the Divide and Conquer algorithm? BPSC TRE 4 DSA Practice set 1 41. How many edges does a spanning tree of a graph with N vertices have? BPSC TRE 4 DSA Practice set 1 42. Which of the following is NOT a graph traversal algorithm? BPSC TRE 4 DSA Practice set 1 43. Which of the following is NOT an NP-Complete problem? BPSC TRE 4 DSA Practice set 1 44. Which of the following is an advantage of using arrays? BPSC TRE 4 DSA Practice set 1 45. Which of the following is NOT a basic operation performed on a data structure? BPSC TRE 4 DSA Practice set 1 46. In a binary search tree, which subtree of a node contains elements that are greater than the node’s value? BPSC TRE 4 DSA Practice set 1 47. Merge Sort is an example of which algorithm design paradigm? BPSC TRE 4 DSA Practice set 1 48. Which of the following data structures stores elements in a non-linear relationship? BPSC TRE 4 DSA Practice set 1 49. Which data structure is used for efficient searching, insertion, and deletion of elements? BPSC TRE 4 DSA Practice set 1 50. The result evaluating the postfix expression 10 5 + 60 6 / * 8 BPSC TRE 4 DSA Practice set 1 51. In a balanced binary tree, the height of two sub-trees of every node can not differ by more than BPSC TRE 4 DSA Practice set 1 52. A queue has configuration a, b, c, d. If you want to get the configuration d, c, b, a, you need a minimum of _______. BPSC TRE 4 DSA Practice set 1 53. What is the worst-case time complexity of binary search on a sorted array? BPSC TRE 4 DSA Practice set 1 54. Which traversal of a Binary Search Tree always produces the elements in ascending order? BPSC TRE 4 DSA Practice set 1 55. How many distinct binary search trees can be created using 3 distinct keys? BPSC TRE 4 DSA Practice set 1 56. Which asymptotic notation represents the lower bound of an algorithm’s growth rate? BPSC TRE 4 DSA Practice set 1 57. Which of the following algorithms is a classic example of the Divide and Conquer technique? BPSC TRE 4 DSA Practice set 1 58. A tree has 10 vertices. How many edges does it contain? BPSC TRE 4 DSA Practice set 1 59. Which graph traversal algorithm uses a queue data structure? BPSC TRE 4 DSA Practice set 1 60. Which of the following problems was the first problem proven to be NP-Complete? BPSC TRE 4 DSA Practice set 1 61. What is the time complexity of accessing an element at a given index in an array? BPSC TRE 4 DSA Practice set 1 62. Which operation involves visiting each element of a data structure systematically? BPSC TRE 4 DSA Practice set 1 63. In a binary search tree, where are values smaller than a node generally stored? BPSC TRE 4 DSA Practice set 1 64. What is the worst-case time complexity of Merge Sort? BPSC TRE 4 DSA Practice set 1 65. Which of the following is an example of a non-linear data structure? BPSC TRE 4 DSA Practice set 1 66. What is the average time complexity of searching for an element in a hash table? BPSC TRE 4 DSA Practice set 1 67. What is the result of the postfix expression 5 3 + 2 *? BPSC TRE 4 DSA Practice set 1 68. What is the balance factor of a node in an AVL tree? BPSC TRE 4 DSA Practice set 1 69. Which principle is followed by a standard queue data structure? BPSC TRE 4 DSA Practice set 1 70. What is the best-case time complexity of binary search? BPSC TRE 4 DSA Practice set 1 71. Which sequence represents the correct preorder traversal of a binary tree? BPSC TRE 4 DSA Practice set 1 72. How many distinct binary search trees can be formed using 5 distinct keys? BPSC TRE 4 DSA Practice set 1 73. Which asymptotic notation represents a tight bound on an algorithm’s growth rate? BPSC TRE 4 DSA Practice set 1 74. Which sorting algorithm uses the Divide and Conquer strategy by dividing an array into two halves? BPSC TRE 4 DSA Practice set 1 75. Which of the following is a necessary property of a spanning tree? BPSC TRE 4 DSA Practice set 1 76. Which graph traversal algorithm commonly uses a stack or recursion? BPSC TRE 4 DSA Practice set 1 77. Which of the following is an NP-Complete problem? BPSC TRE 4 DSA Practice set 1 78. What is the worst-case time complexity of inserting an element at the beginning of an array containing n elements? BPSC TRE 4 DSA Practice set 1 79. Which data-structure operation is used to add a new element? BPSC TRE 4 DSA Practice set 1 80. Which traversal of a Binary Search Tree produces elements in sorted order? BPSC TRE 4 DSA Practice set 1 81. What is the best-case time complexity of Merge Sort? BPSC TRE 4 DSA Practice set 1 82. Which of the following is a linear data structure? BPSC TRE 4 DSA Practice set 1 83. What is a collision in hashing? BPSC TRE 4 DSA Practice set 1 84. Which data structure is commonly used to evaluate a postfix expression? BPSC TRE 4 DSA Practice set 1 85. Which of the following is a self-balancing binary search tree? BPSC TRE 4 DSA Practice set 1 86. In a queue, insertion of a new element normally takes place at which end? BPSC TRE 4 DSA Practice set 1 87. Which data structure is most commonly used to implement Breadth-First Search (BFS) of a graph? BPSC TRE 4 DSA Practice set 1 88. Which condition is necessary for applying binary search efficiently on an array? BPSC TRE 4 DSA Practice set 1 89. Which sequence represents the correct postorder traversal of a binary tree? BPSC TRE 4 DSA Practice set 1 90. Which mathematical sequence gives the number of structurally distinct BSTs that can be formed using N distinct keys? BPSC TRE 4 DSA Practice set 1 91. What is the Big-O time complexity of accessing an element by index in an array? BPSC TRE 4 DSA Practice set 1 92. Which step of Divide and Conquer involves breaking a problem into smaller subproblems? BPSC TRE 4 DSA Practice set 1 93. What is the maximum number of edges that can be present in a simple undirected graph with N vertices? BPSC TRE 4 DSA Practice set 1 94. What is the time complexity of BFS for a graph represented using an adjacency list? BPSC TRE 4 DSA Practice set 1 95. Which of the following is an NP-Complete problem related to finding a fully connected subset of vertices in a graph? BPSC TRE 4 DSA Practice set 1 96. Which of the following is generally true about deleting an element from the middle of an array? BPSC TRE 4 DSA Practice set 1 97. Which data-structure operation is used to remove an existing element? BPSC TRE 4 DSA Practice set 1 98. What is the average-case time complexity of searching for an element in a balanced Binary Search Tree? BPSC TRE 4 DSA Practice set 1 99. Which operation is mainly responsible for combining the sorted subarrays in Merge Sort? BPSC TRE 4 DSA Practice set 1 100. Which data structure is primarily used to represent hierarchical relationships? BPSC TRE 4 DSA Practice set 1 101. Which technique stores multiple collided elements in a linked list at the same hash index? BPSC TRE 4 DSA Practice set 1 102. What is the postfix form of the infix expression A + B? BPSC TRE 4 DSA Practice set 1 103. Which operation is used to restore the balance of an AVL tree after an insertion? BPSC TRE 4 DSA Practice set 1 104. Which condition represents a full circular queue of size N when one position is kept empty? BPSC TRE 4 DSA Practice set 1 105. Which search algorithm generally has O(N) worst-case time complexity? BPSC TRE 4 DSA Practice set 1 106. If the inorder traversal of a Binary Search Tree is 10, 20, 30, 40, 50, what can be concluded? BPSC TRE 4 DSA Practice set 1 107. What is the number of distinct BSTs possible with 6 distinct keys? BPSC TRE 4 DSA Practice set 1 108. What is the time complexity of traversing all N elements of an array once? BPSC TRE 4 DSA Practice set 1 109. In the Divide and Conquer paradigm, what does the Conquer step generally involve? BPSC TRE 4 DSA Practice set 1 110. What happens when one edge is removed from a tree? BPSC TRE 4 DSA Practice set 1 111. What is the time complexity of DFS for a graph represented using an adjacency list? BPSC TRE 4 DSA Practice set 1 112. Which of the following is an NP-Complete graph problem? BPSC TRE 4 DSA Practice set 1 113. How are elements of a traditional array generally stored in memory? BPSC TRE 4 DSA Practice set 1 114. Which operation is used to determine whether a particular element exists in a data structure? BPSC TRE 4 DSA Practice set 1 115. What is the worst-case time complexity of searching in a highly skewed Binary Search Tree containing n nodes? BPSC TRE 4 DSA Practice set 1 116. Which recurrence relation represents the standard Merge Sort algorithm? BPSC TRE 4 DSA Practice set 1 117. Which data structure is commonly used to represent a network of interconnected entities? BPSC TRE 4 DSA Practice set 1 118. Which collision resolution technique checks the next available position sequentially? BPSC TRE 4 DSA Practice set 1 119. What is the postfix form of the infix expression A * (B + C)? BPSC TRE 4 DSA Practice set 1 120. Which rotation is generally required to correct an LL imbalance in an AVL tree? BPSC TRE 4 DSA Practice set 1 121. Which data structure is most suitable for evaluating a postfix expression? BPSC TRE 4 DSA Practice set 1 122. If a sorted array contains 1024 elements, approximately how many divisions are required in the worst case by binary search? BPSC TRE 4 DSA Practice set 1 123. For a Binary Search Tree containing distinct keys, which traversal can be used to obtain the keys in sorted descending order? BPSC TRE 4 DSA Practice set 1 124. Which recurrence relation correctly represents the number of distinct BSTs that can be formed using N distinct keys? BPSC TRE 4 DSA Practice set 1 125. What is the time complexity of two nested loops, each executing N times? BPSC TRE 4 DSA Practice set 1 126. What is the typical worst-case time complexity of Merge Sort? BPSC TRE 4 DSA Practice set 1 127. What happens when an additional edge is added to a tree? BPSC TRE 4 DSA Practice set 1 128. Which traversal is generally suitable for finding the shortest path in an unweighted graph? BPSC TRE 4 DSA Practice set 1 129. Which of the following problems is known to be NP-Complete? BPSC TRE 4 DSA Practice set 1 130. Which searching algorithm can find an element in O(log n) time in a sorted array? BPSC TRE 4 DSA Practice set 1 131. Which of the following is generally considered a basic operation on data structures? BPSC TRE 4 DSA Practice set 1 132. Which of the following is a self-balancing Binary Search Tree? BPSC TRE 4 DSA Practice set 1 133. Which of the following sorting algorithms is based on the Divide and Conquer approach? BPSC TRE 4 DSA Practice set 1 134. In a Binary Search Tree, where are values smaller than the root generally stored? BPSC TRE 4 DSA Practice set 1 135. What does the load factor of a hash table represent? BPSC TRE 4 DSA Practice set 1 136. What is the result of the postfix expression 8 2 / 3 +? BPSC TRE 4 DSA Practice set 1 137. Which rotation is generally required to correct an RR imbalance in an AVL tree? BPSC TRE 4 DSA Practice set 1 138. What is the time complexity of enqueue and dequeue operations in a queue implemented using a linked list with front and rear pointers? BPSC TRE 4 DSA Practice set 1 139. Which data structure naturally supports binary search when its elements are maintained in sorted order? BPSC TRE 4 DSA Practice set 1 140. What is the worst-case time complexity of searching for an element in an unbalanced Binary Search Tree containing N nodes? BPSC TRE 4 DSA Practice set 1 141. If N distinct keys are inserted into a Binary Search Tree in strictly increasing order, what type of tree is generally produced? BPSC TRE 4 DSA Practice set 1 142. Which of the following represents logarithmic time complexity? BPSC TRE 4 DSA Practice set 1 143. Which recurrence relation represents the typical running time of Merge Sort? BPSC TRE 4 DSA Practice set 1 144. Which algorithm is commonly used to find a Minimum Spanning Tree of a connected weighted graph? BPSC TRE 4 DSA Practice set 1 145. Which of the following is a common application of DFS? BPSC TRE 4 DSA Practice set 1 146. Which statement correctly describes the relationship between P and NP? BPSC TRE 4 DSA Practice set 1 147. What is the worst-case time complexity of linear search in an unsorted array of n elements? BPSC TRE 4 DSA Practice set 1 148. Which operation changes the value of an existing element without necessarily adding or removing an element? BPSC TRE 4 DSA Practice set 1 149. Which traversal visits the root node before its left and right subtrees? BPSC TRE 4 DSA Practice set 1 150. Which property is generally associated with the standard Merge Sort algorithm? BPSC TRE 4 DSA Practice set 1 151. Which traversal of a Binary Search Tree produces elements in sorted order? BPSC TRE 4 DSA Practice set 1 152. Which of the following is a desirable property of a good hash function? BPSC TRE 4 DSA Practice set 1 153. What is the result of the postfix expression 6 2 3 + *? BPSC TRE 4 DSA Practice set 1 154. Which AVL imbalance case requires a double rotation? BPSC TRE 4 DSA Practice set 1 155. Which of the following is an application of a stack data structure? BPSC TRE 4 DSA Practice set 1 156. What is the space complexity of the iterative version of binary search on an array? BPSC TRE 4 DSA Practice set 1 157. How many distinct Binary Search Trees can be formed using 3 distinct keys? BPSC TRE 4 DSA Practice set 1 158. What is the maximum height of a Binary Search Tree containing N nodes? BPSC TRE 4 DSA Practice set 1 159. If an algorithm performs exactly 100 operations regardless of input size N, what is its asymptotic time complexity? BPSC TRE 4 DSA Practice set 1 160. Which algorithm uses Divide and Conquer and has an average-case time complexity of O(N log N)? BPSC TRE 4 DSA Practice set 1 161. How many edges are present in a spanning tree containing 25 vertices? BPSC TRE 4 DSA Practice set 1 162. Which data structure is primarily associated with Breadth-First Search? BPSC TRE 4 DSA Practice set 1 163. If an NP-Complete problem can be solved in polynomial time, what would follow? BPSC TRE 4 DSA Practice set 1 164. Which of the following data structures provides efficient random access using an index? BPSC TRE 4 DSA Practice set 1 165. Which operation arranges data elements according to a specified order? BPSC TRE 4 DSA Practice set 1 166. Which of the following is a property of a Binary Search Tree? BPSC TRE 4 DSA Practice set 1 167. What is the typical auxiliary space complexity of the standard recursive Merge Sort for an array? BPSC TRE 4 DSA Practice set 1 168. Which data structure follows the Last In, First Out principle? BPSC TRE 4 DSA Practice set 1 169. Which of the following is NOT a common collision resolution technique in hash tables? BPSC TRE 4 DSA Practice set 1 170. Which notation places the operator before its operands? BPSC TRE 4 DSA Practice set 1 171. What is the balance factor of an AVL node whose left and right subtrees have equal heights? BPSC TRE 4 DSA Practice set 1 172. A deque is a data structure in which insertion and deletion can be performed at which ends? BPSC TRE 4 DSA Practice set 1 173. Which recurrence relation represents the time complexity of binary search? BPSC TRE 4 DSA Practice set 1 174. If a Binary Search Tree is constructed by inserting 10, 20, 30, 40 in this order, what type of tree is produced? BPSC TRE 4 DSA Practice set 1 175. Which traversal of a Binary Search Tree produces the keys in sorted ascending order? BPSC TRE 4 DSA Practice set 1 176. Which of the following generally grows fastest as N becomes very large? BPSC TRE 4 DSA Practice set 1 177. Which algorithm repeatedly divides the search interval into two halves? BPSC TRE 4 DSA Practice set 1 178. A connected graph has 8 vertices and 12 edges. How many edges must be removed to obtain a spanning tree? BPSC TRE 4 DSA Practice set 1 179. Which traversal technique can be used to detect a cycle in an undirected graph? BPSC TRE 4 DSA Practice set 1 180. Which of the following is generally solved in polynomial time rather than being NP-Complete? BPSC TRE 4 DSA Practice set 1 181. Which of the following is a disadvantage of a fixed-size array? BPSC TRE 4 DSA Practice set 1 182. Which of the following is NOT primarily a data-structure operation? BPSC TRE 4 DSA Practice set 1 183. What is the maximum possible height of a Binary Search Tree containing n nodes? BPSC TRE 4 DSA Practice set 1 184. Which of the following is a major difference between Merge Sort and Quick Sort? BPSC TRE 4 DSA Practice set 1 185. Which data structure follows the First In, First Out principle? BPSC TRE 4 DSA Practice set 1 186. What is the worst-case time complexity of searching in a hash table? BPSC TRE 4 DSA Practice set 1 187. Which notation normally requires operator precedence and parentheses to determine the order of evaluation? BPSC TRE 4 DSA Practice set 1 188. What is the worst-case time complexity of searching in an AVL tree? BPSC TRE 4 DSA Practice set 1 189. Consider the following stack operations: push(10), push(20), pop(), push(30), pop(). What is the sequence of elements removed from the stack? BPSC TRE 4 DSA Practice set 1 190. In a binary search tree, the average search time is generally _______ for a reasonably balanced tree. BPSC TRE 4 DSA Practice set 1 191. Which traversal is most suitable for deleting all nodes of a binary tree safely? BPSC TRE 4 DSA Practice set 1 192. What is the worst-case time complexity of searching in a completely skewed Binary Search Tree containing N nodes? BPSC TRE 4 DSA Practice set 1 193. If an algorithm has a running time of 3N2 + 5N + 10, what is its asymptotic Big-O complexity? BPSC TRE 4 DSA Practice set 1 194. Which recurrence is characteristic of an algorithm that divides a problem into two equal subproblems and performs linear work to combine their results? BPSC TRE 4 DSA Practice set 1 195. Which statement about a spanning tree of a connected graph is correct? BPSC TRE 4 DSA Practice set 1 196. Which of the following correctly matches a graph traversal algorithm with its commonly associated data structure? BPSC TRE 4 DSA Practice set 1 197. Which of the following statements about polynomial-time reduction is correct? BPSC TRE 4 DSA Practice set 1 198. Which statement correctly compares array and linked-list access by position? BPSC TRE 4 DSA Practice set 1 199. Which of the following correctly matches a data structure with a common operation? BPSC TRE 4 DSA Practice set 1 200. Which of the following is used to restore balance in an AVL tree? BPSC TRE 4 DSA Practice set 1 201. Which of the following problems is commonly solved using the Divide and Conquer technique? BPSC TRE 4 DSA Practice set 1 202. Which data structure is commonly used to implement Breadth-First Search (BFS)? BPSC TRE 4 DSA Practice set 1 203. Which data structure generally provides O(log n) average search time when it is balanced and maintains its ordering property? BPSC TRE 4 DSA Practice set 1 204. While evaluating a postfix expression, what should be done when an operator is encountered? BPSC TRE 4 DSA Practice set 1 205. Which statement about an AVL tree is correct? BPSC TRE 4 DSA Practice set 1