Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for b-tree
42
votes
6
answers
21
GATE CSE 2002 | Question: 2.23, UGCNET-June2012-II: 26
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512$ bytes, and index pointers are of size $4$ bytes. Given the scenario, what ... of the degree (i.e. number of pointers per node) of the $B^+$ - tree? $16$ $42$ $43$ $44$
A $B^+$ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all the student names are of length $8$ bytes, disk blocks are of size $512...
Kathleen
14.0k
views
Kathleen
asked
Sep 15, 2014
Databases
gatecse-2002
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
42
votes
5
answers
22
GATE CSE 1997 | Question: 19
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The root (if it is an internal node) has between $1$ and $2d$ key values. The distance ... $4$ with $52$ leaves? What is the minimum number of leaves in a $B^+$-tree of order $d$ and height $h(h\geq 1)$?
A $B^+$ - tree of order $d$ is a tree in which each internal node has between $d$ and $2 d$ key values. An internal node with $M$ key values has $M + 1$ children. The roo...
Kathleen
14.8k
views
Kathleen
asked
Sep 29, 2014
Databases
gate1997
databases
b-tree
normal
descriptive
+
–
51
votes
4
answers
23
GATE CSE 2015 Set 3 | Question: 46
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block pointer is $8$ $\text{bytes}$ long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is ______.
Consider a B+ tree in which the search key is $12$ $\text{bytes}$ long, block size is $1024$ $\text{bytes}$, record pointer is $10$ $\text{bytes}$ long and the block poin...
go_editor
21.2k
views
go_editor
asked
Feb 15, 2015
Databases
gatecse-2015-set3
databases
b-tree
normal
numerical-answers
+
–
18
votes
3
answers
24
GATE CSE 2019 | Question: 14
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? B+ Tree is a height-balanced tree Non-leaf nodes have pointers to data records Key values in each node are kept in sorted order Each leaf node has a pointer to the next leaf node
Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table?B+ Tree is a height-balanc...
Arjun
10.4k
views
Arjun
asked
Feb 7, 2019
Databases
gatecse-2019
databases
b-tree
1-mark
+
–
0
votes
0
answers
25
TestBook TestSeries question to find max child possible in B+ Tree
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes which can be used to store all the keys? A. 17 B. 19 C. 59 D. 57
In a B+ Tree index having order 6, which is the maximum number of child pointers it can have. Keys are numbered from 1 to 83. What can be the maximum number of nodes whic...
Sahil_Lather
490
views
Sahil_Lather
asked
Jan 29, 2023
Databases
b-tree
testbook-test-series
databases
+
–
0
votes
0
answers
26
Unacademy AIMT -1
the answer is 28
the answer is 28
TusharKumar
592
views
TusharKumar
asked
Dec 23, 2022
Databases
databases
b-tree
unacademy-test-series
+
–
40
votes
5
answers
27
GATE CSE 2016 Set 2 | Question: 21
B+ Trees are considered BALANCED because. The lengths of the paths from the root to all leaf nodes are all equal. The lengths of the paths from the root to all leaf nodes differ from each other by at most $1$. The number of children of any two non-leaf sibling nodes differ by at most $1$. The number of records in any two leaf nodes differ by at most $1$.
B+ Trees are considered BALANCED because.The lengths of the paths from the root to all leaf nodes are all equal.The lengths of the paths from the root to all leaf nodes d...
Akash Kanase
11.6k
views
Akash Kanase
asked
Feb 12, 2016
Databases
gatecse-2016-set2
databases
b-tree
normal
+
–
0
votes
1
answer
28
do we have B trees in gate 2023 syllabus?
Sai eswar
611
views
Sai eswar
asked
Oct 24, 2022
Unknown Category
b-tree
syllabus
+
–
31
votes
5
answers
29
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 ...
Madhav
10.8k
views
Madhav
asked
Feb 14, 2017
Databases
gatecse-2017-set2
databases
b-tree
numerical-answers
normal
+
–
1
votes
1
answer
30
Igate2022 Test Series
consider a ABC university and the relation took(StudentID, CourseNo, Quarter, Year, Units, Grade) contains the grades for the courses completed by ABC students during the last 20 years. For simplicity, assume that there are 25,000 students enrolled each quarter, and ... the B+ use, in the worst case. (n denotes the maximum number of pointers in a node.) Ans 3 Please explain
consider a ABC university and the relation took(StudentID, CourseNo, Quarter, Year, Units, Grade) contains the grades for the courses completed by ABC students during the...
SKMAKM
488
views
SKMAKM
asked
Sep 19, 2022
Databases
indexing
b-tree
test-series
+
–
33
votes
4
answers
31
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...
makhdoom ghaya
8.2k
views
makhdoom ghaya
asked
Dec 9, 2016
Databases
descriptive
gate1989
databases
b-tree
+
–
45
votes
4
answers
32
GATE CSE 2000 | Question: 1.22, UGCNET-June2012-II: 11
B$^{+}$-trees are preferred to binary trees in databases because Disk capacities are greater than memory capacities Disk access is much slower than memory access Disk data transfer rates are much less than memory data transfer rates Disks are more reliable than memory
B$^{+}$-trees are preferred to binary trees in databases becauseDisk capacities are greater than memory capacitiesDisk access is much slower than memory accessDisk data t...
Kathleen
15.4k
views
Kathleen
asked
Sep 14, 2014
Databases
gatecse-2000
databases
b-tree
normal
ugcnetcse-june2012-paper2
+
–
44
votes
3
answers
33
GATE CSE 2015 Set 2 | Question: 6
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following...
go_editor
13.2k
views
go_editor
asked
Feb 12, 2015
Databases
gatecse-2015-set2
databases
b-tree
normal
numerical-answers
+
–
50
votes
6
answers
34
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$
Kathleen
21.5k
views
Kathleen
asked
Sep 12, 2014
Databases
gatecse-2008
databases
b-tree
normal
+
–
2
votes
1
answer
35
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.
LRU
788
views
LRU
asked
Dec 22, 2021
Databases
test-series
databases
b-tree
+
–
1
votes
1
answer
36
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
casberg
497
views
casberg
asked
Nov 23, 2021
DS
data-structures
b-tree
tree
ace-booklet
+
–
47
votes
5
answers
37
GATE IT 2007 | Question: 85
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links. Keys $K15$ and then $K25$ are inserted into this tree in that order. Now the key $K50$ is deleted from the $B^+$ tree resulting after the two ... (i) and (ii) are true Statements (ii) and (iii) are true Statements (iii) and (i) are true All the statements are false
Consider the $B^{+}$ tree in the adjoining figure, where each node has at most two keys and three links.Keys $K15$ and then $K25$ are inserted into this tree in that orde...
Ishrat Jahan
17.6k
views
Ishrat Jahan
asked
Oct 30, 2014
Databases
gateit-2007
databases
b-tree
normal
+
–
0
votes
1
answer
38
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?
Markzuck
465
views
Markzuck
asked
Dec 18, 2018
Databases
made-easy-test-series
databases
b-tree
+
–
Page:
« prev
1
2
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register