My Report

Data Structure I Mock Test 6


Correct Answer: 2 points | Wrong: -1 point
Grades: A* (100% score) | A (80%-99%) | B (60%-80%) | C (40%-60%) | D (0%-40%)
advertisement
 10%

Question 1 of 10

1. A B+ tree can contain a maximum of 7 pointers in a node. What is the minimum number of keys in leaves?

Question 1 of 10

Question 2 of 10

2. 2-3-4 trees are B-trees of order 4. They are an isometric of _____ trees.

Question 2 of 10

Question 3 of 10

3. Is partitioning method used by Tango Tree.

Question 3 of 10

Question 4 of 10

4. What is the average running time of a treap?

Question 4 of 10

Question 5 of 10

5. Which of the following data structure can provide efficient searching of the elements?

Question 5 of 10

Question 6 of 10

6. Which of the following is the most widely used external memory data structure?

Question 6 of 10

Question 7 of 10

7. Who developed the concept of tango tree?

Question 7 of 10

Question 8 of 10

8. What is the time complexity for inserting the string and forming a new string in the rope data structure?

Question 8 of 10

Question 9 of 10

9. What is the time complexity for searching k+1 auxiliary trees?

Question 9 of 10

Question 10 of 10

10. Which of the following is the self-adjusting binary search tree?

Question 10 of 10


 

Manish Bhojasia - Founder & CTO at Sanfoundry
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He lives in Bangalore, and focuses on development of Linux Kernel, SAN Technologies, Advanced C, Data Structures & Alogrithms. Stay connected with him at LinkedIn.

Subscribe to his free Masterclasses at Youtube & discussions at Telegram SanfoundryClasses.