DSA
1. Which of the following is not the type of queue? BPSC Tre 4.0 DSA Practice Set 2. Which of the following application makes use of a circular linked list? BPSC Tre 4.0 DSA Practice Set 3. The data structure required for Breadth First Traversal on a graph is? BPSC Tre 4.0 DSA Practice Set 4. Which algorithm is used in the top tree data structure? BPSC Tre 4.0 DSA Practice Set 5. What is the need for a circular queue? BPSC Tre 4.0 DSA Practice Set 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 7. What is an AVL tree? BPSC Tre 4.0 DSA Practice Set 8. What is a data structure? BPSC Tre 4.0 DSA Practice Set 9. What will be the output of the following program? BPSC Tre 4.0 DSA Practice Set 10. The prefix form of A-B/ (C*D^E) is? BPSC Tre 4.0 DSA Practice Set 11. Which of the following is not the application of stack? BPSC Tre 4.0 DSA Practice Set 12. What data structure would you mostly likely see in non-recursive implementation of a recursive algorithm? BPSC Tre 4.0 DSA Practice Set 13. What is a bit array? BPSC Tre 4.0 DSA Practice Set 14. Which of the following data structures can be used for parentheses matching? BPSC Tre 4.0 DSA Practice Set 15. What are the disadvantages of arrays? BPSC Tre 4.0 DSA Practice Set 16. The data structure required to check whether an expression contains a balanced parenthesis is? BPSC Tre 4.0 DSA Practice Set 17. Which of the following is the most widely used external memory data structure? BPSC Tre 4.0 DSA Practice Set 18. Which of the following statement(s) about stack data structure is/are NOT correct? BPSC Tre 4.0 DSA Practice Set 19. Which of the following is also known as Rope data structure? BPSC Tre 4.0 DSA Practice Set 20. Which of the following data structure can provide efficient searching of the elements? BPSC Tre 4.0 DSA Practice Set 21. Which of the following tree data structures is not a balanced binary tree? BPSC Tre 4.0 DSA Practice Set 22. Which data structure is used for implementing recursion BPSC Tre 4.0 DSA Practice Set 23. Which data structure is based on the Last In First Out (LIFO) principle? BPSC Tre 4.0 DSA Practice Set 24. Which data structure is needed to convert infix notation to postfix notation? BPSC Tre 4.0 DSA Practice Set 25. The height of n elements 2-3 tree is ______ BPSC Tre 4.0 DSA Practice Set 26. Which of the following data structures stores elements in a non-linear relationship? BPSC Tre 4.0 DSA Practice Set 27. Which data structure is used for efficient searching, insertion, and deletion of elements? BPSC Tre 4.0 DSA Practice Set 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 29. The result evaluating the postfix expression 10 5 + 60 6/ * 8- BPSC Tre 4.0 DSA Practice Set 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 31. Write the output of the following program: int a[ ] = {1,2,3,} *p; BPSC Tre 4.0 DSA Practice Set 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 33. The order of the binary search algorithm is _______. BPSC Tre 4.0 DSA Practice Set 34. How many distinct binary search trees can be created out of 4 distinct keys? BPSC Tre 4.0 DSA Practice Set 35. Merge Sort is an example of which algorithm design paradigm? BPSC Tre 4.0 DSA Practice Set