81.
For a magnetic disk with concentric circular
tracks, the seek latency is not linearly proportional to the seek distance due
to

(a)
non-uniform distribution of requests.

(b) arm
starting or stopping inertia.

(c) higher
capacity of tracks on the periphery of the platter.

(d) use of
unfair arm scheduling policies.

Answer:
(b)

82.
You need 500 subnets, each with about 100
usable host addresses per subnet. What network mask will you assign using a
class B network address?

(a)
255.255.255.252 (b)
255.255.255.128

(c)
255.255.255.0 (d)
255.255.254.0

Answer:
(b)

83.
Which of the following are the primary
objectives of risk monitoring in software project tracking?

P : To
assess whether predicted risks do, in fact, occur.

Q : To
ensure that risk aversion steps defined for the risk are being properly
applied.

R : To
collect information that can be used for future risk analysis.

(a) Only P
and Q (b) Only P and R

(c) Only Q
and R (d) All of P, Q, R

84.
Which data structure is used by the compiler
for managing variables and their attributes?

(a) Binary
tree (b) Link list

(c) Symbol
table (d) Parse table

Answer:
(c)

85.
The fault can be easily diagnosed in the
micro-program control unit using diagnostic tools by maintaining the contents
of

(a) flags
and counters (b) registers and
counters

(c) flags
and registers (d)
flags, registers and counters

Answer:
(d)

86.
Consider the LPP given as

Max
Z=2x

_{1 }- x_{2 }+ 2x_{3}
subject to
the constraints

2x

_{1 }+ x_{2 }≤ 10
x

_{1 }+ 2x_{2 }- 2x_{3 }≤ 20
x

_{1}+ 2x_{3}≤ 5
x

_{1},x_{2},x_{3}≥ 0
What shall
be the solution of the LPP after applying first iteration of the Simplex Method?

(a) x

_{1}= 5/2, x_{2}= 0, x_{3}= 0, Z = 5
(b) x

_{1}= 0, x_{2}= 0, x_{3}= 5/2, Z = 5
(c) x

_{1}= 0, x_{2}= 5/2, x_{3}= 0, Z = -5/2
(d) x

_{1}= 0, x_{2}= 0, x_{3}= 10, Z = 20
Answer:
(b)

87.
Shift-reduce parser consists of

(1) input
buffer (2) stack (3) parse table

Choose the
correct option from those given below:

(a) (1) and
(2) only (b) (1) and (3)
only

(c) (3) ony (d) (1), (2) and (3)

Answer:
(d)

88.
Match

**List-I**with**List-II**:**List-I List-II**

A. p → q 1.
¬(q → ¬ p)

B. p v q 2.
p ÊŒ ¬ q

C. p ÊŒ q 3.
¬p → q

D. ¬(p → q) 4.
¬p v q

Choose the
correct option from those given below:

(a) A-2,
B-3, C-1, D-4 (b) A-2,
B-1, C-3, D-4

(c) A-4,
B-1, C-3, D-2 (d) A-4,
B-3, C-1, D-2

Answer:
(d)

89.
Which of the following UNIX/Linux pipes will
count the number of lines in all the files having .c and .h as their extension
in the current working directory?

(a) cat *.ch
| wc - l (b) cat *. [c - h] | wc -l

(c) cat *.[ch]
| ls - l (d) cat *. [ch] |
wc – l

Answer:
(d)

90. The
parallel bus arbitration technique uses an external priority encoder and a
decoder. Suppose, a parallel arbiter has 5 bus arbiters. What will be the size
of priority encoder and decoder respectively?

(a) 4 × 2, 2
× 4 (b) 2 × 4, 4 × 2

(c) 3 × 8, 8
× 3 (d) 8 × 3, 3 × 8

Answer:
(d)

91. Software
validation mainly checks for inconsistencies between

(a) use
cases and user requirements.

(b)
implementation and system design blueprints.

(c) detailed
specifications and user requirements.

(d)
functional specifications and use cases.

Answer:
(c)

92. What
will be the number of states when a MOD-2 counter is followed by a MOD-5
counter?

(a) 5 (b) 10

(c) 15 (d) 20

Answer:
(b)

93. Consider
the following C-code fragment running on a 32-bit x86 machine:

typedef
struct {

union
{

unsigned char a;

unsigned
short b;

}U;

unsigned
char c;

}S;

S B[10];

S*p=&B[4];

S*q=&B[5];

p → U.b =
0x1234;

/* structure
S takes 32-bits */

If M is the
value of q – p and N is the value of ((int) & (p → c)) – ((int)p), then (M,
N) is

(a) (1, 1) (b) (3, 2)

(c) (1, 2) (d) (4, 4)

Answer:
(c)

94. Consider
the following C++ function f():

unsigned int
f (unsigned int n){

unsigned
int b = 0;

while
(n){

b + = n & 1;

n
>> = 1;

}

return
b;

}

The function
f() returns the int that represents the ____P____in the binary representation
of positive integer n, where P is

(a) number
of 0’s

(b) number
of bits

(c) number
of consecutive 1’s

(d) number
of 1’s

Answer:
(d)

95. For
which values of

*m*and*n*does the complete bipartite graph K_{m, n}have a Hamilton circuit?
(a)

*m≠n, m,n≥2*(b)*m≠n, m,n≥3*
(c)

*m=n, m,n≥2*(d)*m=n, m,n≥3*
Answer:
(c)

96. The
ability to inject packets into the Internet with a false source address is
known as

(a)
Man-in-the-middle attack (b) IP phishing

(c) IP
sniffing (d) IP spoofing

Answer:
(d)

97. Consider
the following grammar:

S → XY

X → YaY | a and Y→
bbX

Which of the
following statements is/are true about the above grammar?

(1) Strings
produced by the grammar can have consecutive three a’s.

(2) Every
string produced by the grammar have alternate a and b.

(3) Every
string produced by the grammar have at least two a’s.

(4) Every
string produced by the grammar have b’s in multiple of 2.

(a) (1) only
(b) (2) and (3) only

(c) (4) only (d) (3) and (4) only

Answer:
(d)

98. Consider
the following methods:

M1 : Mean of
maximum

M2 : Centre
of area

M3 : Height
method

Which of the
following is/are defuzzification method(s)?

(a) Only M2 (b) Only M1 and M2

(c) Only M2 and
M3 (d) M1, M2 and M3

Answer:
(d)

99. With
respect to relational algebra, which of the following operations are included
from mathematical set theory?

(1) Join (2) Intersection

(3)
Cartisian product (4) Project

(a) (1) and
(4) (b) (2) and (3)

(c) (3) and
(4) (d) (2) and (4)

Answer:
(b)

100. How
many cards must be selected from a standard deck of 52 cards to guarantee that
at least three hearts are present among them?

(a) 9 (b) 13

(c) 17 (d) 42

Answer:
(d)

## 0 Comments