Mathematics · Database Management Systems
In a B-tree, block size is 1 KB (1024 bytes), search key size is 8 bytes, data pointer size is 10 bytes, and block/tree pointer size is 14 bytes. What is the maximum number of data pointers possible in an internal (non-leaf) node?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 131✓
- 232
- 330
- 433
Correct answer
31
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Mathematics?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Database Management Systems MCQs →Want more practice questions on Database Management Systems?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Mathematics · Database Management Systems