menu
search
Log In

GO Book for GATECSE 2022

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects


GATE Overflow
Recent questions tagged b-tree

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged b-tree

2 votes
1 answer
1
NIELIT 2017 DEC Scientific Assistant A - Section B: 21
The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options
The $2-3-4$ tree is a self-balancing data structure, which is also called : $2-4$ tree $B+$ tree $B-$ tree None of the options
asked Mar 31, 2020 in Databases Lakshman Patel RJIT 309 views
0 votes
1 answer
2
NIELIT 2017 July Scientist B (CS) - Section B: 43
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks
Which one of the following is a key factor for preferring $B$-trees to binary search trees for indexing database relations? Database relations have a large number of records Database relations are sorted on the primary key $B$-trees require less memory than binary search trees Data transfer from disks is in blocks
asked Mar 30, 2020 in Databases Lakshman Patel RJIT 260 views
0 votes
3 answers
3
UGCNET-Jan2017-III: 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,6$ Which of the following shall be correct $B+$ tree?
asked Mar 24, 2020 in Databases jothee 324 views
4 votes
3 answers
4
NTA NET DEC 2019 (B-tree)
In a B- Tree, each node represents a disk block. Suppose one block holds 8192 bytes, each key uses 32 bytes. In a B-Tree of order M there are M-1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is (1) 32M – 32 (2) 36 M – 32 (3) 36 M – 36 (4) 32M -36
In a B- Tree, each node represents a disk block. Suppose one block holds 8192 bytes, each key uses 32 bytes. In a B-Tree of order M there are M-1 keys. Since each branch is on another disk block, we assume a branch is of 4 bytes. The total memory requirement for a non-leaf node is (1) 32M – 32 (2) 36 M – 32 (3) 36 M – 36 (4) 32M -36
asked Dec 21, 2019 in Databases Sanjay Sharma 1.3k views
0 votes
0 answers
5
KPGCET-CSE-2019-43
The distinction between B tree and B+ tree is that Π’ tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.
The distinction between B tree and B+ tree is that Π’ tree contains data at all memory locations whereas B+ tree contains data at leaf level nodes B+ tree contains data at all levels and B tree contains data only at the leaf nodes. Both contain data at all levels Both contains data only at leaf nodes.
asked Aug 4, 2019 in Databases gatecse 52 views
1 vote
1 answer
6
B TRees DBMS Self doubt
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought
In case of B Trees we split a node on insertion in case of overflow, is there any possible case in which this may lead to underflow also? as a key is promoted to parent the children formed may have subtrees, which may be broken such that we get underflow somewhere? just a thought
asked Jun 7, 2019 in Databases manisha11 175 views
1 vote
0 answers
7
DBMS Korth Edition 4 Exercise 12 Question 5 (Page No. 490)
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
Construct a $B^+$-tree for the following set of key values: $(2, 3, 5, 7, 11, 17, 19, 23, 29, 31)$ Assume that the tree is initially empty and values are added in ascending order. Construct B+-trees for the cases where the number of pointers that will fit in one node is as follows: a. Four b. Six c. Eight
asked Apr 1, 2019 in Databases akash.dinkar12 222 views
12 votes
3 answers
8
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-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
asked Feb 7, 2019 in Databases Arjun 5.2k views
0 votes
3 answers
9
B+ Tree Records
asked Feb 2, 2019 in Databases Na462 638 views
0 votes
0 answers
10
self doubt
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3. If any insertion of element causes split, first split that node without element insertion and after balanced then insert that element.
Identify the B-Tree from the following after inserting R,Y,F,X,A,M,C,D,E,T,H,V,L,G (in the order) with Branching factor of 3. If any insertion of element causes split, first split that node without element insertion and after balanced then insert that element.
asked Jan 15, 2019 in Databases Shubham Aggarwal 203 views
0 votes
0 answers
11
B+ tree
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
Can anyone suggest me any useful source from where I can read b+ tree insertion and deletion?
asked Jan 9, 2019 in Databases bts1jimin 168 views
1 vote
0 answers
12
self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
asked Jan 2, 2019 in Databases newdreamz a1-z0 180 views
0 votes
0 answers
13
MadeEasy Test Series: Databases - B Tree
According to me, since the B trees have a data pointer for each of the key values in their internal nodes, the I/O access for them should take less time since we do not need to traverse down all of the tree.
According to me, since the B trees have a data pointer for each of the key values in their internal nodes, the I/O access for them should take less time since we do not need to traverse down all of the tree.
asked Dec 28, 2018 in Databases Harsh Kumar 282 views
1 vote
1 answer
14
GO2019-FLT1-27
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data records are stored both in ... keys are repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees
Which of the following statements is incorrect with respect to B-tree and B+ trees? Deletion operation is easier in B-tree but complex in case of B+ trees. In B+ trees, data records are stored only in the leaf nodes but in B trees data records are stored both in leaf ... Search keys are repeated in case of B+ trees but not in case of B trees. Searching is faster in B+ trees compared to B trees
asked Dec 27, 2018 in Databases Ruturaj Mohanty 1.4k views
0 votes
0 answers
15
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?
asked Dec 18, 2018 in Databases Markzuck 204 views
0 votes
1 answer
16
B+ tree doubt
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
Consider a B+ -tree in which the maximum no. of keys in a root is 11. What will be minimum no. of keys in a non-root node? What will be the same in a B-Tree Please also refer the source from where clear-cut formulae are given
asked Dec 15, 2018 in Databases Subham Nagar 166 views
0 votes
2 answers
17
doubt
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??
Why B-tree & B+ tree is used in database indexing instead of other tree like BST, Binary tree etc??
asked Dec 8, 2018 in Databases mrinmoyh 162 views
0 votes
0 answers
18
MadeEasy Test Series: Databases - B Tree
The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal node is the maximum number of tree pointers in each node and the order of ... ,30,40,35,20,8,10,5 are inserted.The Maximum number of times nodes get spilt up as a result of these insertion ___
The Following key values are inserted into B+ tree in which order of internal node is 4, and that of leaf node is 3, in the sequence given below.The Order of internal node is the maximum number of tree pointers in each node and the order of leaf node is the maximum ... empty 50,15,30,40,35,20,8,10,5 are inserted.The Maximum number of times nodes get spilt up as a result of these insertion ___
asked Nov 25, 2018 in Databases jatin khachane 1 236 views
1 vote
2 answers
19
B+ Tree Self Doubt
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
what is the minimum and maximum number of keys for non-leaf nodes and leaf nodes for B+ Tree of order p?
asked Nov 23, 2018 in Databases aditi19 538 views
0 votes
0 answers
20
B tree Doubt
https://gateoverflow.in/3723/gate2004-it-79 In the above question why record pointer is considered in internal node size calculation?
https://gateoverflow.in/3723/gate2004-it-79 In the above question why record pointer is considered in internal node size calculation?
asked Nov 16, 2018 in Databases Shamim Ahmed 87 views
0 votes
0 answers
21
B+ Tree Doubt
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate2009-44
Why internal node split isn't counted in this question? Only leaf node split is counted. https://gateoverflow.in/1330/gate2009-44
asked Nov 16, 2018 in Databases Shamim Ahmed 92 views
0 votes
2 answers
23
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 non-root node?
asked Oct 30, 2018 in Databases jatin khachane 1 145 views
0 votes
1 answer
24
DBMS basic test1
asked Oct 27, 2018 in Databases Shivani gaikawad 155 views
0 votes
1 answer
25
MadeEasy Test Series: Databases - B Tree
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is ... 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?
The following key values are inserted into B+ tree in which the order of internal nodes is 4 and that of the leaf node is 5 in the sequence given below. The order of internal node is maximum number of keys in each node and the order of leaf node is the maximum number of pointers ... can carry 5 pointer then till 5 element we can insert in one leaf. So answer should be 5+ 19+23 = 47. AM i Right?
asked Oct 22, 2018 in Databases sardendu 202 views
2 votes
1 answer
26
Indexing
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
How to prove that if same size blocks are allocated to B trees and B+ trees then:- No. of index nodes in B tree >= No. Of index nodes in B+ tree
asked Oct 8, 2018 in Databases skywalker_19 248 views
0 votes
0 answers
27
# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
asked Sep 10, 2018 in Algorithms LavTheRawkstar 573 views
Page:
Dark theme
Muffin by HΓ©lio Chun
Thanks to Q2A
...