Crack
GATE
C
G
Topic
Indexing
Databases
0
/ 11 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
1
0.3
0
0.7
2018
0
0
0
0
2019
1
1
0
0
2020
1
0
0
1
2021
0.5
0
0
0.5
2022
0
0
0
0
2023
1
0
0
1
2024
0.5
0.5
0
0
2025
1
0
0.5
0.5
2026
0.5
0.5
0
0
1
CS 2026 Set 2 · 2 marks · MCQ · Moderate
An index in a DBMS is said to be dense if an index entry appears for every search-key value in the indexed file. Otherwise it is called a sparse index. Consider the following two statements.
2
CS 2025 Set 1 · 1 mark · MSQ · Moderate
Consider the following
B
+
B^+
B
+
tree with
5
5
5
nodes, in which a node can store at most
3
3
3
key values. The value
23
23
23
is now inserted in the
B
+
B^+
B
+
tree. Which of the following option(s) is/are CORRECT?
3
CS 2025 Set 2 · 2 marks · NAT · Hard
In a
B
+
\mathrm{B^+}
B
+
- tree where each node can hold at most four key values, a root to leaf path consists of the following nodes:
4
CS 2024 Set 1 · 1 mark · MCQ · Easy
In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?
5
CS 2023 · 2 marks · NAT · Moderate
Consider a database of fixed-length records, stored as an ordered file. The database has 25,000 records, with each record being 100 bytes, of which the primary key occupies 15 bytes. The data file is block-aligned in that each data record is fully contained within a block. The database is indexed by a primary index file, which is also stored as a block-aligned ordered file. The figure below depicts this indexing scheme.
6
CS 2021 Set 2 · 1 mark · NAT · Moderate
A data file consisting of
1
,
50
,
000
1,50,000
1
,
50
,
000
student-records is stored on a hard disk with block size of
4096
4096
4096
bytes. The data file is sorted on the primary key
RollNo
. The size of a record pointer for this disk is
7
7
7
bytes. Each student-record has a candidate key attribute called
ANum
of size
12
12
12
bytes. Suppose an index file with records consisting of two fields,
ANum
value and the record pointer to the corresponding student record, is built and stored on the same disk. Assume that the records of data file and index file are not split across disk blocks. The number of blocks in the index file is ____ .
7
CS 2020 · 2 marks · NAT · Moderate
Consider a database implemented using B+ tree for file indexing and installed on a disk drive with block size of
4
K
B
4\,\mathrm{KB}
4
KB
. The size of search key is
12
b
y
t
e
s
12\,\mathrm{bytes}
12
bytes
and the size of tree/disk pointer is
8
b
y
t
e
s
8\,\mathrm{bytes}
8
bytes
. Assume that the database has one million records. Also assume that no node of the B+ tree and no records are present initially in main memory. Consider that each record fits into one disk block. The minimum number of disk accesses required to retrieve any record in the database is ____.
8
CS 2019 · 1 mark · MCQ · Easy
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?
9
CS 2015 Set 1 · 1 mark · MCQ · Easy
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called
10
CS 2015 Set 2 · 1 mark · NAT · Moderate
With reference to the B+ tree index of order
1
1
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
7
7
and less than
15
15
15
" is ____.
11
CS 2015 Set 3 · 2 marks · NAT · Easy
Consider a B+ tree in which the search key is
12
b
y
t
e
s
12\,\mathrm{bytes}
12
bytes
long, block size is
1024
b
y
t
e
s
1024\,\mathrm{bytes}
1024
bytes
, record pointer is
10
b
y
t
e
s
10\,\mathrm{bytes}
10
bytes
long and block pointer is
8
b
y
t
e
s
8\,\mathrm{bytes}
8
bytes
long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is _______.