Gate Preparation

Please provide me computer Engg solve question paper for Gate exam Preparation.

Here you are looking for computer Engg solve question paper for Gate exam Preparation. As you want here I am providing you

Question paper;

1 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
Answer: (C)

2 The Boolean function x, y, + xy + x, y
A) x, + y,
B) x + y
C) x + y,
D) x, + y
Answer: (D)

3 In an MxN matrix such that all non-zero entries are covered in a rows and b columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, is
A) £ a + b
B) £ max {a, b}
C) £ min {M-a, N-b}
D) £ min {a, b}
Answer: (A)

4 The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies:
A) name, courseNo -> grade
B) rollNo, courseNo -> grade
C) name -> rollNo
D) rollNo -> name

The highest normal form of this relation scheme is
Answer: (A)

5 The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by
A) the instruction set architecture
B) page size
C) physical memory size
D) number of processes in memory
Answer: (D)

For full question paper you can download this attachment it is free to dopwnload.

Attached Files Available for Download

Computer Engg solve question paper for Gate Preparation.doc (26.5 KB, 29 views)