Register

Search results for b-tree

0 votes
0 answers
41
Unacademy AIMT -1
the answer is 28
the answer is 28
User Avatar
0 votes
1 answer
43
do we have B trees in gate 2023 syllabus?
User Avatar
31 votes
5 answers
44
GATE CSE 2017 Set 2 | Question: 49
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ____
In a B+ Tree , if the search-key value is $8$ bytes long , the block size is $512$ bytes and the pointer size is $2\;\text{B}$ , then the maximum order of the B+ Tree is ...
User Avatar
33 votes
4 answers
46
GATE CSE 1989 | Question: 12a
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted into the $B^+$ tree. Obtain the modified $B^+$ tree after insertion.
The below figure shows a $B^+$ tree where only key values are indicated in the records. Each block can hold upto three records. A record with a key value $34$ is inserted...
User Avatar
50 votes
6 answers
49
GATE CSE 2008 | Question: 41
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place? $3$ $4$ $5$ $6$
A B-tree of order $4$ is built from scratch by $10$ successive insertions. What is the maximum number of node splitting operations that may take place?$3$$4$$5$$6$
User Avatar
2 votes
1 answer
50
Applied Mock Test
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______ Consider that the root node is at height 0.
The smallest number of keys that will force a B-Tree of order 3 to have a height of 3 are _______Consider that the root node is at height 0.
User Avatar
1 votes
1 answer
51
Ace BITS&BYTES, #Trees #B-Tree
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560 127 & 2186 6561 & 255 255 & 2186
What is the smallest and largest number of entries for 2_3 BTree (B2_3 Tree) of height 8 (i.e 8 levels) ? 255 & 6560127 & 21866561 & 255255 & 2186
User Avatar
0 votes
1 answer
53
MadeEasy Subject Test 2019: Databases - B Tree
By default take ROOT at level 1 or 0? and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
By default take ROOT at level 1 or 0?and if asked for B tree then take all the levels but for B+ records only at leaf so only leaf level keys right?
User Avatar
1 votes
2 answers
54
DBMS basic test1
User Avatar
3 votes
1 answer
55
B+ Trees
Can anybody explain what is meant by "Minimum Space Utilization"?
Can anybody explain what is meant by "Minimum Space Utilization"?
User Avatar
1 votes
3 answers
56
UGC NET CSE | January 2017 | Part 3 | Question: 12
If following sequence of keys are inserted in a B+ tree with K(=3) pointers: 8, 5, 1, 7, 3, 12, 9, 6 Which of the following shall be correct B+ tree?
If following sequence of keys are inserted in a B+ tree with K(=3) pointers:8, 5, 1, 7, 3, 12, 9, 6Which of the following shall be correct B+ tree?
User Avatar
0 votes
3 answers
59
Self doubt
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any non-root node?
Consider a B+ tree in which the maximum number of keys in a Internal node is 5 and maximum number of keys in a leaf node is 4. What is the minimum number of keys in any n...
User Avatar
5 votes
3 answers
60
ISRO2018-49
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used? $5$ $4$ $3$ $10$
in a file which contains $1$ million records and the order of the tree is $100$, then what is the maximum number of nodes to be accessed if $B$+ tree index is used?$5$$4$...
User Avatar
Page: