My Report (&Account)

Ternary Tree Test


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

1. Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.

2. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?

3. A B-tree of order 4 and of height 3 will have a maximum of _______ keys.

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

5. Which of the following is true?

6. Figure shown below is B-tree of order 5. What is the result of deleting 130 from the tree?
Find the result of deleting 130 from the given tree

7. B-tree of order n is a order-n multiway tree in which each non-root node contains __________

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

9. B-tree and AVL tree have the same worst case time complexity for insertion and deletion.

10. What is the best case height of a B-tree of order n and which has k keys?


 

Start practicing “1000 MCQs on Data Structure”, and once you are ready, you can take tests on all topics by attempting our “Data Structure Test Series”.

advertisement
advertisement
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.