JKSSB Mock Tests

Why do modern relational databases and file systems like NTFS heavily rely on B-Tree (Balanced Tree) data structures?

A. They provide beautiful graphical UI representations
B. They compress text data by 80%
C. They maintain sorted data and allow searches, sequential access, and insertions in logarithmic time, minimizing disk I/O reads
D. They inherently encrypt data blocks
Answer: Option C
Solution (By JKSSB Mock Tests Team)
B-Trees are shallow and wide. Because disk reads are slow, finding a record in 3 deep hops is vastly superior to a deep, unbalanced binary tree.
This Question Belongs to: Computer mcqs Computer set 1

More Questions from Computer set 1

Target SSC, Railway, UPSC & JKSSB Exams

Welcome to JKSSB Mock Tests's comprehensive question bank. Practicing objective multiple-choice questions (MCQs) on topics like Computer set 1 is essential for clearing high-competition exams such as SSC CGL, CHSL, Railway RRB NTPC, UPSC Prelims, and JKSSB.

The solution provided above gives you the exact logical breakdown needed to handle similar queries in the actual exam environment. To maximize your score, we recommend solving the related questions provided on this page and taking our free randomized mock tests to evaluate your time management skills.

Frequently Asked Questions

Yes, the concepts covered in Computer mcqs are highly relevant and repeatedly asked in SSC (CGL, MTS, CHSL), Railway (RRB NTPC, ALP), UPSC, and state PSC exams like JKSSB.

After reading the direct solution, try to understand the core concept behind it. Use our platform to practice similar questions from the same topic to reinforce your memory and improve accuracy.