1
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
2
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
3
GATE CSE 2004
MCQ (Single Correct Answer)
+1
-0.3
$${73_x}$$ (in base $$-$$ $$x$$ number system) is equal to $${54_y}$$ (in base $$-y$$ number system), the possible values of $$x$$ and $$y$$ are
A
$$8,$$ $$16$$
B
$$10,$$ $$12$$
C
$$9,$$ $$13$$
D
$$8,$$ $$11$$
4
GATE CSE 2004
MCQ (Single Correct Answer)
+2
-0.6
Let $$A=1111$$ $$1010$$ and $$B=0000$$ $$1010$$ be two $$8$$-bit $$2's$$ complement numbers. Their product in $$2's$$ complement is
A
$$1100$$ $$0100$$
B
$$1001$$ $$1100$$
C
$$1010$$ $$0101$$
D
$$1101$$ $$0101$$
EXAM MAP
Medical
NEET
Graduate Aptitude Test in Engineering
GATE CSEGATE ECEGATE EEGATE MEGATE CEGATE PIGATE IN
CBSE
Class 12