Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations - NIMCET
Aspire Study - Best NIMCET Coaching

🎯 Crack NIMCET with Aspire Study

🔹 India's Most Trusted MCA Coaching
💻 Live + Recorded Classes | 👨‍🏫 Expert Faculty
📝 All India Test Series | 🎯 Personal Mentorship

🥈 NIMCET AIR 2: Ayush Garg

🚀 Join Aspire Now

📂 Aspire Study Library

Question Id : 19048 | Context : UGC NET Computer Science Dec 2019 (Paper II)
In a B-Tree, each node represents a disk block. Suppose one block holds $8192$ bytes. Each key uses $32$ bytes. In a B-tree of order $M$ there are $M-1$ keys. Since each branch is on another disk block, we assume a branch is of $4$ bytes. The total memory requirement for a non-leaf node is:

Aspire Study Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
📲
Ask Your Question or Put Your Review.

loading...