GATE CSE 2005 | File Structures and Indexing Question 21 | Database Management System

Database Management System

Er Diagrams

Marks 1 Marks 2

Functional Dependencies and Normalization

Marks 1 Marks 2

Structured Query Language

Marks 1 Marks 2

Relational Algebra

Marks 1 Marks 2

Transactions and Concurrency

Marks 1 Marks 2

File Structures and Indexing

Marks 1 Marks 2

GATE CSE 2005

MCQ (Single Correct Answer)

-0.3

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are:

GATE CSE 2000

MCQ (Single Correct Answer)

-0.3

B⁺-trees are preferred to binary trees in databases because

Disk capacities are greater than memory capacities

Disk access is much slower than memory access

Disk data transfer rates are much less than memory data transfer rates

Disks are more reliable than memory

GATE CSE 1999

MCQ (Single Correct Answer)

-0.3

Which of the following is correct?

B-trees are for storing data on disk and B⁺ trees are for main memory.

Range queries are faster on B⁺ trees.

B-trees are for primary indexes and B⁺ trees are for secondary indexes.

The height of a B⁺ tree is independent of the number of records.

GATE CSE 1998

MCQ (Single Correct Answer)

-0.3

There are five records in a database.

Name	Age	Occupation	Category
Rama	27	CON	A
Abdul	22	ENG	A
Jennifer	28	DOC	B
Maya	32	SER	D
Dev	24	MUS	C

There is an index file associated with this and it contains the values 1, 3, 2, 5 and 4. Which one of the fields is the index built from?

Age

Name

Occupation