This section contains more frequently asked Data Structure Basics MCQs in the various University level and competitive examinations.

PRACTICE IT NOW TO SHARPEN YOUR CONCEPT AND KNOWLEDGE

view hide answers

1. which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 20 item : 1 2 3 profit : 25 24 15 weight : 18 15 10

  • 498
  • 480
  • 499
  • 485

2. which is optimal value in the case of fractional knapsack problem, capacity of knapsack is 10 item : 1 2 3 4 5 profit : 12 32 40 30 50 weight : 4 8 2 6 1

  • 345
  • 384
  • 354
  • 350

3. 4 -Queen problem what is the space complexity

  • O(|V|)
  • O(|E|)
  • O(|V|+|E|)
  • O(|V2|)

4. In the case of Fibnocci heap the running time of Prim’s algorithm is _________

  • O(E log V)
  • O(V log E)
  • O( log V)
  • O(E log E)

5. Time complexity of 4-queen problem

  • O(|V|)
  • O(|E|)
  • O(|V|+|E|)
  • O(|V2|)

6. If the graph is represented as an adjacency matrix then the time complexity of Kruskal’s algorithm is ____________

  • O(E log V)
  • O(VlogE)
  • O(V2)
  • O(logE)

7. BFS is best compared to DFS in the case of ________________

  • The graph’s width is large
  • The graph’s depth is large
  • The graph consists of many nodes
  • The graph is complex

8. The timecomplexity of Strassen’s algorithm is ___________

  • O(E log V)
  • O(V2)
  • O(nlog7)
  • O(log n7)

9. By Strassen’s equation what is wrong in the following equation

  • p1=(a+d)(e+h)
  • p3=(a-c)(e+f)
  • p2=(-e+g)d
  • p4=(a+b)h

10. By Strassen’s equation what is wrong in the following equation

  • p1=(a+d)(e+h)
  • p3=(a-c)(e+f)
  • p7=(-e+g)d
  • p4=(a-b)h
Share with : Share on Linkedin Share on Twitter Share on WhatsApp Share on Facebook