1
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
Which level of locking provides the highest degree of concurrency in a relational database?
A
Page.
B
Table.
C
Row.
D
Page, table and row level locking allow the same degree of concurrency.
2
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Consider the following schedule S of transactions T1 and T2: GATE CSE 2004 Database Management System - Transactions and Concurrency Question 23 English Which of the following is TRUE about the schedule S?
A
S is serializable only as T1,T2
B
S is serializable only as T2,T1
C
S is serializable both as T1, T2 and T2, T2
D
S is not serializable either as T1 or as T2
3
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?
A
24
B
25
C
26
D
27
4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Consider a table T in a relational database with a key field K. A B-tree of order p is used as an access structure on K, where p denotes the maximum number of tree pointers in a B-tree index node. Assume that K is 10 bytes long; disk block size is 512 bytes; each data pointer PD is 8 bytes long and each block pointer PB is 5 bytes long. In order for each B-tree node to fit in a single disk block, the maximum value of p is
A
20
B
22
C
23
D
32
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12