ALL GATE QUESTIONS SUBJECTWISE
×

ER Diagrams

1 Mark Questions 2 Marks Questions

Functional Dependencies and Normalization

1 Mark Questions 2 Marks Questions

SQL 

1 Mark Questions 2 Marks Questions

Relational Algebra and Relational Calculus

1 Mark Questions 2 Marks Questions

Transactions and Concurrency Control

1 Mark Questions 2 Marks Questions

File Structures  and Indexing

1 Mark Questions 2 Marks Questions



GATE 2002 Question - Marks 2

A B+ - tree index is to be built on the Name attribute of the relation STUDENT. Assume that all student names are of length 8 bytes, disk blocks are of size 512 bytes, and index pointers are of size 4 bytes. Given this scenario, what would be the best choice of the degree (i.e. the number of pointers per node) of the B+ - tree?
(a) 16
(b) 42
(c) 43
(d) 44


Total 7 Questions



Share: