GATE CSE 2026 Set 2 | File Structures and Indexing Question 1 | Database Management System

GATE CSE 2026 Set 2

MCQ (Single Correct Answer)

-0

$$ \text { In the context of DBMS, consider the two sets } \mathbf{T} \text { and } \mathbf{S} \text { given below. } $$

$$ \begin{array}{ll}\,\,\,\,\, \text { T } &\,\,\,\,\, \text { S } \\ \text { I: } \text { Logical schema } & \text { L: Views } \\ \text { II: } \text { Physical schema } & \text { M: File organization and indexes } \\ \text { III: External schema } & \text { N: Relations } \end{array} $$

Which one of the following is the correct match from $T$ to $S$ ?

$\mathrm{I}-\mathrm{L}$, II -M , III -N

$ I -M , II -L , III -N$

$\mathrm{I}-\mathrm{N}, \mathrm{II}-\mathrm{M}$, III -L

$\mathrm{I}-\mathrm{N}, \mathrm{II}-\mathrm{L}, \mathrm{III}-\mathrm{M}$

GATE CSE 2024 Set 2

MCQ (More than One Correct Answer)

-0

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?

Sorted

Heap

Unclustered tree index

Unclustered hash index

GATE CSE 2024 Set 1

MCQ (Single Correct Answer)

-0.33

In a B+ tree, the requirement of at least half-full (50%) node occupancy is relaxed for which one of the following cases?

Only the root node

All leaf nodes

All internal nodes

Only the leftmost leaf node

GATE CSE 2021 Set 2

Numerical

-0

A data file consisting of 1,50,000 student-records is stored on a hard disk with block size of 4096 bytes. The data file is sorted on the primary key RollNo. The size of a record pointer for this disk is 7 bytes. Each student-record has a candidate key attribute called ANum of size 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 _______

Your input ____