1
GATE CSE 2008
MCQ (Single Correct Answer)
+1
-0.3
A clustering index is defined on the fields which are of type
A
non-key and ordering
B
non-key and non-ordering
C
key and ordering
D
key and non-ordering
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:
A
5
B
4
C
3
D
2
3
GATE CSE 2000
MCQ (Single Correct Answer)
+1
-0.3
B+-trees are preferred to binary trees in databases because
A
Disk capacities are greater than memory capacities
B
Disk access is much slower than memory access
C
Disk data transfer rates are much less than memory data transfer rates
D
Disks are more reliable than memory
4
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
Which of the following is correct?
A
B-trees are for storing data on disk and B+ trees are for main memory.
B
Range queries are faster on B+ trees.
C
B-trees are for primary indexes and B+ trees are for secondary indexes.
D
The height of a B+ tree is independent of the number of records.
GATE CSE Subjects
Software Engineering
Web Technologies
EXAM MAP
Medical
NEETAIIMS
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
Civil Services
UPSC Civil Service
Defence
NDA
Staff Selection Commission
SSC CGL Tier I
CBSE
Class 12