GATE CSE 2008 | File Structures and Indexing Question 16 | Database Management System

PREVIOUS NEXT

GATE CSE 2008

MCQ (Single Correct Answer)

-0.3

A clustering index is defined on the fields which are of type

non-key and ordering

non-key and non-ordering

key and ordering

key and non-ordering

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.

PREVIOUS NEXT

GATE CSE Subjects

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

Algorithms

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

Digital Logic

K Maps Boolean Algebra Combinational Circuits Number Systems Sequential Circuits

Database Management System

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

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

Software Engineering

Compiler Design

Lexical Analysis Parsing Syntax Directed Translation Code Generation and Optimization

Web Technologies

General Aptitude

Numerical Ability Logical Reasoning Verbal Ability

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

Computer Organization

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