1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
A clustering index is defined on the fields which are of type
2
GATE CSE 2005
MCQ (Single Correct Answer)
+1
-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:
3
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
B+-trees are preferred to binary trees in databases because
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is correct?
Questions Asked from File Structures and Indexing (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude