Back to Browse

GATE CSE 2009

580 views
Dec 24, 2021
4:02

Planning to take coaching on Unacademy http://bit.ly/gate_unacademy or https://unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- https://t.me/joinchat/X5egW_cvdt9kMGY1 Telegram discussion Group link:- https://t.me/joinchat/VCyGUmVq8RNkMzhl Downloads resources from here https://education4fun.com/gate-cse/ MCQ (Single Correct Answer) GATE CSE 2009 The following key values are inserted into a B+-tree in which order of the internal nodes is 3, and that of the leaf nodes is 2, in the sequence given below. The order of internal nodes is the maximum number of tree pointers in each node, and the order of leaf nodes is the maximum number of data items that can be stored in it. The B+- tree is initially empty. 10, 3, 6, 8, 4, 2, 1 The maximum number of times leaf nodes would get split up as a result of these insertions is A) 2 B) 3 C) 4 D) 5

Download

1 formats

Video Formats

360pmp410.2 MB

Right-click 'Download' and select 'Save Link As' if the file opens in a new tab.

GATE CSE 2009 | NatokHD