1
GATE CSE 2022
Numerical
+1
-0.33

Consider two files systems A and B, that use contiguous allocation and linked allocation, respectively. A file of size 100 blocks is already stored in A and also in B. Now, consider inserting a new block in the middle of the file (between 50th and 51st block), whose data is already available in the memory. Assume that there are enough free blocks at the end of the file and that the file control blocks are already in memory. Let the number of disk accesses required to insert a block in the midele of the file in A and B are nA and nB, respectively, then the value of nA + nB is _____________.

2
GATE CSE 2019
+1
-0.33
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?
A
B+ tree is a height-balanced tree
B
Non-leaf nodes have pointers to data records
C
Each leaf node has a pointer to the next leaf node
D
Key values in each node are kept in sorted order
3
GATE CSE 2016 Set 2
+1
-0.3
B+ Trees are considered BALANCED because
A
the lengths of the paths from the root to all leaf nodes are all equal.
B
the lengths of the paths from the root to all leaf nodes differ from each other by at most 1.
C
the number of children of any two non-leaf sibling nodes differ by at most 1.
D
the number of records in any two leaf nodes differ by at most 1.
4
GATE CSE 2015 Set 2
Numerical
+1
-0
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 _________