GATE CS 2024 (Afternoon) — Question 26

Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)MSQ1 markEasy

Which of the following file organizations is/are I/O efficient for the scan operation in DBMS?
  1. A
    Sorted
  2. B
    Heap
  3. C
    Unclustered tree index
  4. D
    Unclustered hash index
Practise the full 2024-AN paper
Challenge a friend: WhatsApp Telegram
Recommended book · affiliate linkDatabase System Concepts (Korth)Normalisation, SQL, transactions and indexing — the DBMS syllabus in one book.
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