1

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum number of tree pointers in a B-tree index node. Assume that K is 10 bytes long; disk block size is 512 bytes; each data pointer P

_{D}is 8 bytes long and each block pointer P_{B}is 5 bytes long. In order for each B-tree node to fit in a single disk block, the maximum value of p is2

GATE CSE 2004

MCQ (Single Correct Answer)

+2

-0.6

The order of an internal node in a B

^{+}tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?3

GATE CSE 2002

MCQ (Single Correct Answer)

+2

-0.6

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?Questions Asked from File Structures and Indexing (Marks 2)

Number in Brackets after Paper Indicates No. of Questions

GATE CSE Subjects

Theory of Computation

Operating Systems

Algorithms

Database Management System

Data Structures

Computer Networks

Software Engineering

Compiler Design

Web Technologies

General Aptitude

Discrete Mathematics

Programming Languages