B-tree of order n is a order-n multiway tree in which each non-root node contains __________(a) at most (n – 1)/2 keys(b) exact (n – 1)/2 keys(c) at least 2n keys(d) at least (n – 1)/2 keysEnquiry is from B-Trees in portion B-Trees of Data Structures & Algorithms IThis question was addressed to me during an interview for a job.

B-tree of order n is a order-n multiway tree in which each non-root no

1.	B-tree of order n is a order-n multiway tree in which each non-root node contains __________(a) at most (n – 1)/2 keys(b) exact (n – 1)/2 keys(c) at least 2n keys(d) at least (n – 1)/2 keysEnquiry is from B-Trees in portion B-Trees of Data Structures & Algorithms IThis question was addressed to me during an interview for a job.
Answer» Right choice is (d) at LEAST (N – 1)/2 keys The EXPLANATION is: A non-root node in a B-tree of order n contains at least (n – 1)/2 keys. And contains a MAXIMUM of (n – 1) keys and n SONS.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following is false?(a) 2-3 tree requires less storage than the BST(b) lookup in 2-3 tree is more efficient than in BST(c) 2-3 tree is shallower than BST(d) 2-3 tree is a balanced treeThe above asked question is from B-Trees in chapter B-Trees of Data Structures & Algorithms IThis question was posed to me in quiz.
AVL trees provide better insertion the 2-3 trees.(a) True(b) FalseQuestion is from B-Trees in division B-Trees of Data Structures & Algorithms IThe question was posed to me in a job interview.
Which of the following is not true about the 2-3 tree?(a) all leaves are at the same level(b) it is perfectly balanced(c) postorder traversal yields elements in sorted order(d) it is B-tree of order 3My question comes from B-Trees in section B-Trees of Data Structures & Algorithms II have been asked this question in class test.
LLRB maintains 1-1 correspondence with 2–3 trees.(a) True(b) FalseThis is a very interesting question from B-Trees topic in section B-Trees of Data Structures & Algorithms IThe question was posed to me during an online exam.
Which of the following data structure can provide efficient searching of the elements?(a) unordered lists(b) binary search tree(c) treap(d) 2-3 treeQuestion is from B-Trees in chapter B-Trees of Data Structures & Algorithms IThe question was posed to me in final exam.
Which of the following the BST is isometric with the 2-3 tree?(a) Splay tree(b) AA tree(c) Heap(d) Red – Black treeI'm obligated to ask this question of B-Trees in section B-Trees of Data Structures & Algorithms II had been asked this question in an online quiz.
The height of 2-3 tree with n elements is ______(a) between (n/2) and (n/3)(b) (n/6)(c) between (n) and log2(n + 1)(d) between log3(n + 1) and log2(n + 1)This interesting question is from B-Trees topic in section B-Trees of Data Structures & Algorithms IThis question was addressed to me by my school teacher while I was bunking the class.
2-3 tree is a specific form of _________(a) B – tree(b) B+ – tree(c) AVL tree(d) HeapQuestion is taken from B-Trees topic in division B-Trees of Data Structures & Algorithms II had been asked this question during an interview.
Which one of the following data structures are preferred in database-system implementation?(a) AVL tree(b) B-tree(c) B+ -tree(d) Splay treeI would like to ask this question from B-Trees topic in chapter B-Trees of Data Structures & Algorithms II had been asked this question during an interview for a job.
Which of the following is false?(a) Compared to B-tree, B+ -tree has larger fanout(b) Deletion in B-tree is more complicated than in B+ -tree(c) B+ -tree has greater depth than corresponding B-tree(d) Both B-tree and B+ -tree have same search and insertion efficienciesI want to ask this question from B-Trees topic in section B-Trees of Data Structures & Algorithms II got this question during an interview.

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment