GATE CS 2017 (Afternoon) — Question 49

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

In a B\(^+\) tree, if the search-key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then the maximum order of the B\(^+\) tree is________.
Practise the full 2017-AN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAWhat rank do your marks get?GATE score, likely All-India Rank and qualifying marks for your category.
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