| Que.
1 |
Which of the following disk scheduling strategies is likely to
give the best through put? |
| A |
|
Farthest cylinder next |
| B |
|
Nearest cylinder next |
| C |
|
First come first served |
| D |
|
Elevator algorithm |
|
Que. 2
|
Let s be a sorted array of n integers. Let t (n) denote the time taken
for the most efficient algorithm to determine if there are two elements
with sum less than 1000 in s. Which of the following statements is true? |
| A |
|
t (n) is 0 (1) |
| B |
|
n
|
| C |
|
n log 2 n
|
| D |
|
t (n) = (n/2) |
|
Que. 3
|
A top down parser generates |
| A |
|
right most derivation |
| B |
|
left most derivation |
| C |
|
right most derivation in reverse |
| D |
|
left most derivation in reverse |
|
Que. 4
|
The root directory if a disk should be placed |
| A |
|
At a fixed address in the main memory |
| B |
|
At a fixed location on the disk |
| C |
|
anywhere on the disk |
| D |
|
At a fixed location on the system disk (E)anywhere on
the system disk |
|
Que. 5
|
conisder a system having m resources of the same type.These resources
are shared by 3 processes A,B and C,which have peak demands of 3,4
and 6 respectively.For what value of m deadlock will not occure? |
| A |
|
7 |
| B |
|
10 |
| C |
|
13 |
| D |
|
15 |
|
Que. 6
|
A linker is given object modules for a set of programs that wer compiled
separately.What information need not be included in an object module? |
| A |
|
Object code |
| B |
|
Relocation bits |
| C |
|
Names and locations of all external symbols defined in the
object module |
| D |
|
Absolute address of internal symbols |
|
Que. 7
|
A binary tree T has a leaf nodes.The number of nodes of degree 2 in
T is |
| A |
|
log2 n |
| B |
|
n-1 |
| C |
|
n |
| D |
|
2^n |
|
Que. 8
|
What is the value of A,B,C and D satisfy the following simultaneous
boolean equation A'+AB=0,AB=AC,AB+AC'+CD=C'D' |
| A |
|
A=1,B=0,C=0,D=1 |
| B |
|
A=1,B=1,C=0,D=0 |
| C |
|
A=1,B=0,C=1,D=1 |
| D |
|
A=1,B=0,C=0,D=0 |
|
Que.
9
|
A binary search tree contains the value 1,2,3,4,5,6,7,8.The tree is traversed
in pre-order and the value are printed out.Which of the following
sequence is a valid output? |
| A |
|
5 3 1 2 4 7 8 6 |
| B |
|
5 3 1 2 6 4 8 7 |
| C |
|
5 3 2 4 1 6 7 8 |
| D |
|
5 3 1 2 4 7 8 6 |
|
Que. 10
|
A computer has 6 Tape drivers,with n processes competing for them.Each
process may need two drivers.What is the maximum value of n for the system
to be deadlock free? |
| A |
|
6 |
| B |
|
5 |
| C |
|
4 |
| D |
|
3 |
-------------
For More Sample Papers Visit:
http://onestopgate.com/gate-preparation/ - http://onestopgate.com/gate-preparation/
|