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

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

Category

GATE CSE Subjects

Discrete Mathematics

Mathematical Logic Probability Set Theory & Algebra Combinatorics Linear Algebra Graph Theory Calculus

Programming Languages

Basic of Programming Language Function and Recursion Pointer and Structure in C

Theory of Computation

Undecidability Finite Automata and Regular Language Push Down Automata and Context Free Language Recursively Enumerable Language and Turing Machine

Operating Systems

Process Concepts and Cpu Scheduling Synchronization and Concurrency File System IO and Protection Deadlocks Memory Management

Digital Logic

Number Systems Boolean Algebra K Maps Combinational Circuits Sequential Circuits

Computer Organization

Computer Arithmetic Memory Interfacing Pipelining Machine Instructions and Addressing Modes Alu Data Path and Control Unit IO Interface Secondary Memory

Database Management System

Er Diagrams Functional Dependencies and Normalization Structured Query Language Relational Algebra Transactions and Concurrency File Structures and Indexing

Data Structures

Arrays Stacks and Queues Linked List Trees Graphs Hashing

Computer Networks

Concepts of Layering Lan Technologies and Wi-Fi Data Link Layer and Switching Network Layer Routing Algorithm TCP UDP Sockets and Congestion Control Application Layer Protocol Network Security

Algorithms

Complexity Analysis and Asymptotic Notations Searching and Sorting Divide and Conquer Method Greedy Method P and NP Concepts Dynamic Programming

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Software Engineering

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability