GATE CS 2019 (Forenoon) — Question 24

Database Management Systems (DBMS)File Organization & Indexing (e.g., B and B+ Trees)MCQ1 mark · −1/3 if wrongEasy

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?
  1. A
    B+ tree is a height balanced tree
  2. B
    Non-leaf nodes have pointers to data records
  3. C
    Key values in each node are kept in sorted order
  4. D
    Each leaf node has a pointer to the next leaf node
Practise the full 2019-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
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