1
GATE CSE 2024 Set 2
MCQ (More than One Correct Answer)
+1
-0.33

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

A

Sorted

B

Heap

C

Unclustered tree index

D

Unclustered hash index

2
GATE CSE 2024 Set 1
MCQ (Single Correct Answer)
+1
-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?

A

Only the root node

B

All leaf nodes

C

All internal nodes

D

Only the leftmost leaf node

3
GATE CSE 2019
MCQ (Single Correct Answer)
+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
4
GATE CSE 2016 Set 2
MCQ (Single Correct Answer)
+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.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12