28.

29.

30.

31.

32.

33.

34.

35:

36.

37.

38.

V1108 Pages: 6

A Turing machine that is able to simulate other Turing machines

a) Nested Turing (b) Universal Turing ©) Counter (d) Multi-tape
machines machine machine Turing
Machine

While applying pumping lemma over a regular language, we consider a string w that belongs
to L and fragment it into parts.

a) 2 (b) 5 c) 3 (d) 6

How many states will be there for the minimum state DFA that accepts strings which ends with
‘aa’ over the alphabet set {a,b}?

a) 1 (b) 2 c) 3 (d) 4
Which of the following operators is not present in any regular expression?
a) union (b) concatenation © Kleene closure (d) division

The page table contains

a) base address of (9) page offset c) page size (d) none of the
each page in mentioned
physical
memory

Which of the following statements are true?

I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation

111. Round robin is better than FCFS in terms of response time

a) 10/1) (0) 18/16 111 only ௦) [शाता only (ம்‌ I, ILand 111

If the disk head is located initially at 32, find the number of disk moves required with FCEFS if
the disk queue of I/O blocks requests are 98, 37, 14, 124, 65, 72

a) 319 (b) 326 c) 338 (d) 360

A counting semaphore is initialized to 4. Then 8 P(wait) and 3 V (signal) operations are
performed on the semaphore. The final value of the semaphore is

a) 1 (b) -1 c) 2 (6) -2
Simplest way of deadlock recovery is

a) Roll back (0) Pre-emptresource ௦) Lockoneofthe (9) Kill the one of
process the process
Suppose that a process is in “Blocked” state waiting for some I/O service. When the service is

completed, it goes to the :

a) Running state (b) Ready state c) Suspended state (d) Terminated
state
In fixed size partition, the degree of multiprogramming is bounded by

a) the number of (b) the CPU €) thememory size (d) all of the
partitions utilization mentioned

Page 4 of 6