31.
The number of strings of length 4 that are
generated by the regular expression (0|∈) 1+2* (3|∈), where | is an alternation character, {+, *}
are quantification characters, and ∈
is the null string, is:
(A) 08 (B) 10
(C) 11 (D) 12
Answer: D
32. The
content of the accumulator after the execution of the following 8085 assembly
language program, is:
MVI
A, 42H
MVI
B, 05H
UGC: ADD B
DCR B
JNZ
UGC
ADI
25H
HLT
(A) 82 H (B) 78 H
(C) 76 H (D) 47 H
Answer: C
33. In
.............., the bodies of the two loops are merged together to form a
single loop provided that they do not make any references to each other.
(A) Loop
unrolling (B) Strength
reduction
(C) Loop
concatenation (D) Loop jamming
Answer: D
34. Which
of the following is not typically a benefit of dynamic linking?
I. Reduction
in overall program execution time.
II.
Reduction in overall space consumption in memory.
III.
Reduction in overall space consumption on disk.
IV.
Reduction in the cost of software updates.
(A) I and IV (B) I only
(C) II and
III (D) IV only
Answer: B
35. Which
of the following is FALSE ?
(A) The
grammar S ⟶
aSb|bSa|SS|∈,
where S is the only non-terminal symbol and ∈ is the null string, is ambiguous.
(B) SLR is powerful
than LALR.
(C) An LL(1)
parser is a top-down parser.
(D) YACC
tool is an LALR(1) parser generator.
Answer: B
36. Consider
the reference string
0 1 2 3 0 1
4 0 1 2 3 4
If FIFO page
replacement algorithm is used, then the number of page faults with three page
frames and four page frames are .......... and ........... respectively.
(A) 10, 9 (B) 9, 9
(C) 10, 10 (D) 9, 10
Answer: D
37. Suppose
there are four processes in execution with 12 instances of a Resource R in a
system.
The maximum
need of each process and current allocation are given below:
Process
|
Max. Need
|
Current
Allocation
|
P1
|
8
|
3
|
P2
|
9
|
4
|
P3
|
5
|
2
|
P4
|
3
|
1
|
With
reference to current allocation, is system safe? If so, what is the safe
sequence?
(A) No (B) Yes, P1 P2
P3 P4
(C) Yes, P4
P3 P1 P2 (D)
Yes, P2 P1 P3 P4
Answer: C
38. If
the Disk head is located initially at track 32, find the number of disk moves
required with FCFS scheduling criteria if the disk queue of I/O blocks requests
are:
98, 37, 14,
124, 65, 67
(A) 320 (B) 322
(C) 321 (D) 319
Answer: C
39. In
UNIX, ............ creates three subdirectories: 'PIS' and two subdirectories
'progs' and ‘data’ from just created subdirectory 'PIS'.
(A) mdkir
PIS/progs PIS/data PIS
(B) mkdir
PIS progs data
(C) mkdir
PIS PIS/progs PIS/data
(D) mkdir
PIS/progs data
Answer: C
40. A
scheduling Algorithm assigns priority proportional to the waiting time of a
process. Every process starts with priority zero (lowest priority). The
scheduler re-evaluates the process priority for every 'T' time units and
decides next process to be scheduled. If the process have no I/O operations and
all arrive at time zero, then the scheduler implements .............. criteria.
(A) Priority
scheduling (B) Round
Robin Scheduling
(C) Shortest
Job First (D) FCFS
Answer: B
0 Comments