GATE CS 2026 (Afternoon) — Question 46

Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)MCQ2 marks · −2/3 if wrongMedium

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. S1: A hash index must be a dense index S2: A B+ tree index can be a sparse index Which one of the following options is correct?
  1. A
    Both S1 and S2 are true
  2. B
    Both S1 and S2 are false
  3. C
    S1 is true and S2 is false
  4. D
    S1 is false and S2 is true
Practise the full 2026-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAThis week's 10-question challengeSame 10 past-GATE questions for everyone this week — see where you stand.
Practise more on File Organization & Indexing (e.g., B and B+ Trees)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group