1.

In a time-sharing operating system, when the time slot given

to a process is completed, the process goes from the running
state to the :
a) Blocked state
b) Ready state
c) Suspended state
d) Terminated state

2. A thread shares its resources(like data section, code

section, open files, signals) with :
a) other process similar to the one that the thread belongs to
b) other threads that belong to similar processes
c) other threads that belong to the same process
d) All of these
3. In the ______ algorithm, the disk arm starts at one end of the
disk and moves toward the other end, servicing requests till
the other end of the disk. At the other end, the direction is
reversed and servicing continues.
a) LOOK
b) SCAN
c) C-SCAN
d) C-LOOK
4. Bounded waiting implies that there exists a bound on the
number of times a process is allowed to enter its critical
section :
a) After a process has made a request to enter its critical
section and before the request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical
section
d) none of these.

5. Contiguous allocation has a problem that linked allocation

solves.
a) external fragmentation
b) internal fragmentation
c) memory allocation
d) None
6. Optimal page replacement algorithm is difficult to
implement, because :
a) it requires a lot of information
b) it requires future knowledge of the reference string
c) it is too complex
d) it is extremely expensive
7. Whenever a process needs I/O to or from a disk it issues a
______________.
a) system call to the CPU
b) system call to the operating system
c) a special procedure
d) All of these
8. The set of tracks that are at one arm position make up a
___________.
a) magnetic disks
b) electrical disks
c) assemblies
d) cylinders
9. SSTF algorithm, like SJF __________ of some requests.
a) may cause starvation
b) will cause starvation
c) does not cause starvation
d) causes aging

10.
The real disadvantage of a linear list of directory entries
is the :
a) size of the linear list in memory
b) linear search to find a file
c) it is not reliable
d) All of these
11.
In indexed allocation :
a) each file must occupy a set of contiguous blocks on the
disk
b) each file is a linked list of disk blocks
c) all the pointers to scattered blocks are placed together in
one location
d) None of these
12.
For each file their exists a ___________, that contains
information about the file, including ownership, permissions
and location of the file contents.
a) metadata
b) file control block
c) process control block
d) All of these
13.
There is no __________ with linked allocation.
a) internal fragmentation
b) external fragmentation
c) starvation
d) All of these
14.
How many times Fork will be executed?
For (i=1; i<=n; i++)
{
Fork ();
}

a) 2n
d) none

b) 2n -1

c) n

15. To avoid the race condition, the number of processes that may be
simultaneously inside their critical section is
a) 8
b) 1
c) 16
d) All of these
16. In round robin CPU scheduling as time quantum is increased
the average turnaround time
a) Increases
b) decreases
d) varies irregularly

c) remains constant

17. Pool based allocation of memory achieves better usage.

Memory can be preempted from inactive programs and used to
accommodate active programs. This is called
A) Preemption

B) Swapping

C) Spooling

D) Scheduling

18. If the disk head is located initially at 32, find the number of
disk moves required with FCFS if the disk queues of I/O blocks
requests are 98, 37, 14, 124, 65, 67.
A) 239
D)325

B)310

C)321

19. Consider 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 occur?
A) 7
B) 9
C) 10
D) 13
20. Resources are allocated to the process on non-sharable basis
is

A) Mutual exclusion
B) Hold and wait
C) No pre-emption
D) Circular waits
21. Which of these is/are the desirable features of an Operating
system?
A) Extensible
B )Portable
C) Reliable
D) All of the above
22. Which operating system implementation has to focus on the
issue of Good response time
A) Batch Processing
B) Multiprogramming
C) Distributed
D) Time sharing
23. Program Priorities, Preemption are the key concepts of
A) Batch Processing
B) Real time
C) Multiprogramming
D) Time sharing
24. Applications like Banking and reservations require which type
of OS?
A) Real Time
B) Hard Real Time
C) Soft Real Time
D) None of the above
25. Which of these is a disadvantage of first Come First Serve?
A) Convoy Effect
B) Small average and worst-case waiting times
C) Simplicity
D) Non-preemptive

ANSWERS:
1-B
2-C
3-B
4-A
5-A
6-B
7-B
8-D
9-A
10-B
11-C
12-B
13-B
14-B
15-B
16-D
17-B
18-C

19-D
20-A
21-D
22-D
23-C
24-C
25-A