Jawaharlal Nehru Technological University Hyderabad 2002 B.Tech Computer Science and Engineering gate - Question Paper

execution of a program terminates, a different program is immediately scheduled
for execution.
(a) A (b) A and B (c) A and C (d) A, B and C
Join All India M ock G AT E Classroom T est Series - 2006 conducted by GATE Forum in over 25 cities all over India. ques.
Papers including part tests and full tests are designed by Iisc alum ni according to the recent syllabus. Percentile, All India Rank,
interaction with Iisc alum ni in our online discussion forum s, and m ore. Registration begins 10
M ay, 2005. For m ore details,
th
visit
www
.
gateforum
.
com
Think GATE Think G ATE Forum

GATE CS - 2002 GATE Forum www.gateforum .com
Join discussion of this test paper at http://forum .gatem entor.com
2.22 In the index allocation scheme of blocks to a file, the maximum possible size of
the file depends on
(a) the size of the blocks, and the size of the address of the blocks.
(b) the number of blocks used for the index, and the size of the blocks.
(c) the size of the blocks, the number of blocks used for the index, and the size
of the address of the blocks.
(d) None of the above
2.23 A B
- tree index is to be built on the Name attribute of the relation learner.
+
presume that all learner names are of length eight bytes, disk blocks are of size 512
bytes, and index pointers are of size four bytes. provided this scenario, what would be
+
the best option of the degree (i.e. the number of pointers per node) of the B
-
tree?
(a) 16 (b) 42 (c) 43 (d) 44
2.24 Relation R is decomposed using a set of functional dependencies, F, and relation
S is decomposed using a different set of functional dependencies, G. One
decomposition is definitely BCNF, the other is definitely. 3NF, but it is not known
which is which. To make a guaranteed identification, which 1 of the subsequent
tests should be used on the decompositions? (Assume that the closures of F and
G are available).
(a) Dependency-preservation (b) Lossless-join
(c) BCNF definition (d) 3NF definition
2.25 From the subsequent instance of a relation schema R(A,B,C), we can conclude that:

Earning:   Approval pending.