Data structure MCQ Set-9

PropellerAds
  1. 1. The  notation is
    • Symmetric
    • Reflexive
    • Transitive
    • (a), (b) and (c) above.
  2. 2. From the following choose the one which belongs to the algorithm paradigm other than . to which others from the following belongs to.
    • Minimum & Maximum problem
    • Knapsack problem
    • Selection problem
    • Merge sort
  3. 3. Identify the name of the sorting in which time is not proportional to n2.
    • Selection sort
    • Bubble sort
    • Qucik sort
    • Insertion sort
  4. 4. The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as
    • Principleof Duality
    • Principle of Feasibility
    • Principle of Optimality
    • Principle of Dynamicity.
  5. 5. Which of the following versions of merge sort algorithm does uses space efficiently?
    • Contiguous version
    • Array version
    • Linked version
    • Structure version
    • Heap version.
  6. 6. Identify the correct problem for multistage graph from the list given below.
    • Resource allocation problem
    • Traveling salesperson problem
    • Producer consumer problem
    • Barber’s problem
  7. 7. How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
    • c
    • cn
    • n
    • 2c
  8. 8. A problem L is NP-complete iff L is NP-hard and
    • L ≈ NP
    • L α NP
    • L ε NP
    • L = NP
  9. 9. What would be the cost value for any answering node of a sub tree with root ‘r’ using branch-bound algorithm?
    • Maximum
    • Minimum
    • Optimal
    • Average
  10. 10. From the following choose the one which belongs to the algorithm paradigm other than . to which others from the following belongs to.
    • Minimum & Maximum problem
    • Knapsack problem
    • Selection problem
    • Merge sort
  11. 11. Identify the name of the sorting in which time is not proportional to n2.
    • Selection sort
    • Bubble sort
    • Qucik sort
    • Insertion sort
  12. 12. The optimal solution to a problem is a combination of optimal solutions to its subproblems. This is known as
    • Principleof Duality
    • Principle of Feasibility
    • Principle of Optimality
    • Principle of Dynamicity.
  13. 13. Which of the following versions of merge sort algorithm does uses space efficiently?
    • Contiguous version
    • Array version
    • Linked version
    • Structure version
    • Heap version.
  14. 14. Identify the correct problem for multistage graph from the list given below.
    • Resource allocation problem
    • Traveling salesperson problem
    • Producer consumer problem
    • Barber’s problem
  15. 15. How many edges are there in a Hamiltonian cycle if the edge cost is ‘c’ and the
    • c
    • cn
    • n
    • 2c
  16. 16. A problem L is NP-complete iff L is NP-hard and
    • L ≈ NP
    • L α NP
    • L ε NP
    • L = NP
  17. 17. What would be the cost value for any answering node of a sub tree with root ‘r’ using branch-bound algorithm?
    • Maximum
    • Minimum
    • Optimal
    • Average

Practice Now Data Structure Online Tests