Unit-I

1)

2)

3)

4)

5)

6)

7)

Which of the following is responsible for the management and coordination of activities
and sharing of resources of computer
A)Application Software
B) Mother Board
C) Operating System
D) RAM
Ans: C
When a computer is first turned on or restarted, a special type of absolute loader is
executed, called a
A) Compile and Go loader
B) Boot loader
C) Bootstrap loader
D) Relating loader
Ans: C
Which of the following is not a part of operating system?
A) supervisor
B) performance monitor
C) job-control program
D) input/output control program
Ans: B
Moving Process from main memory to disk is called
A) scheduling
B) caching
C) swapping
D) spooling
Ans: C
Interval between the time of submission and completion of the job is called
A) Waiting time
B) Turnaround time
C) Throughput
D) Response time
Ans: B
A scheduler which selects processes from secondary storage device is called
A) Short term scheduler
B) Long term scheduler
C) Medium term scheduler
D) Process scheduleR
Ans: C
Jobs which are admitted to the system for processing is called
A) long-term scheduling
B) short-term scheduling
C) medium-term scheduling
D) queuing
Ans: A

8)

9)

The scheduling in which CPU is allocated to the process with least CPU-burst time is
called
A) Priority Scheduling
B) Shortest job first Scheduling
C) Round Robin Scheduling
D) Multilevel Queue Scheduling
Ans: B
Program preemption is
A) Forced de allocation of the CPU from a program which is executing on the CPU.
B) Release of CPU by the program after completing its task.
C) Forced allotment of CPU by a program to itself.
D) A program terminating itself due to detection of an error.

Ans: A
Throughput of a system is
10)
A) Number of programs processed by it per unit time
B) Number of times the program is invoked by the system
C) Number of requests made to a program by the system
D) Number of system calls invoked in a program
Ans: A
In interactive environments such as time-sharing systems, the primary requirement is
11)
to provide reasonably good response time and in general, to share system resources
equitably. In such situations, the scheduling algorithm that is most popularly applied is
________.
A) Shortest-job First
B) Elevator
C) Round-Robin
D) First-Come-First-Serve.
Ans: C
Which of the following is not a fundamental process state
12)
A) ready
B) terminated
C) executing
D) blocked
Ans: D
Which amongst the following is not an advantage of Distributed systems?
13)
A)Reliability
B)Incremental growth
C)Resource sharing
D)availability
Ans: A
The turn-around time of a user job is the
14)
A) time since its submission to the time its results become available
B) time duration for which the CPU is allotted to the job
C) total time taken to execute the job
D) time taken for the job to move from assembly phase to completion phase.
Ans: C

15)

The Occurrence of event is usually signaled by

A) boot strap program
B) Interrupt
C) RAM
D) Linker

Ans: B
If Round Robin is used with a time quantum of 1 second, the turnaround time for Job 2
16)
will be

A) 1 second
B) 2 seconds
C)1 hour
D) 1 hour, 1 second
Ans: B
For multiprogramming systems, most UNIX operating systems use
17)
A) semaphore
B) demand paging
C) monitor
D) bounded wait
Ans: B
Process State is a part of
18)
A) Process Control block
B) Inode
C) File Allocation Table
D) Segmentation table
Ans : A
The kernel keeps track of the state of each task by using a data structure called __
19)
A) Process control block
B) User control block
C) Memory control block
D) File Control block
Ans : A
In a multithreaded environment _______.
20)
A) Each thread is allocated with new memory from main memory.
B Main thread terminates after the termination of child threads.
C) Every process can have only one thread.
D) child thread terminates after main thread
Ans: B
CPU Scheduling is the basis of _________ operating system
21)
A)Batch
B) Real time
C)Multiprogramming
D)Mono-programming

Ans: C
A major problem with priority scheduling is _________.
22)
A )Definite blocking
B )Starvation
C )Low priority
D) hi priority
Ans: B
Saving the state of the old process and loading the saved state of the new process is
23)
called ________.
A) Context Switch
B) State
C) Multi programming
D) SYSGEN
Ans : A
In Priority Scheduling a priority number (integer) is associated with each process. The
24)
CPU is allocated to the process with the highest priority (smallest integer = highest
priority). The problem of, Starvation ? low priority processes may never execute, is
resolved by __________.
A) Terminating the process.
B) Aging
C) Mutual Exclusion
D) Semaphore
Ans : B
Which of the following is not a model of multithreading
25)
A) Many-to-one
B) One-to-one
C) Many-to-many
D)One-to-Many
Ans:D
Which system call is used to create a separate, duplicate process?
26)
A) fork()
B) exec()
C)clone()
D) dup()
Ans: A
Communication between the user thread library and the kernel is known as
27)
A) Signal handling
B) Scheduler activation
C) Multithreading
D) Synchronization
Ans: B
Which one among the following is not a function of OS?
28)
A)Resource allocation
B)Accounting
C)Debugging
D)
Protection & security
Ans: C

29)

..Provides an interface to sevice made available by an OS.

A)Interrrupts
B)Systemcalls
C)I/O devices
D)
System bus

Ans: B
As the process enters the system it is put into
30)
A)Ready queue
B)Job queue
C)Processor
D)
I/O queue
Ans: B
Contextext switching is the function of
31)
A) Dispatcher
B) Processor
C) Interrupt handler
D)RAM
Ans: A
Load balancing approches involve
32)
A) Only Push migration
B) Only pull migration
C) Push and pull migration
D) No push and pull migration
Ans: C
Many systems implementing the many-to-many or two-level model place the following
33)
intermediated data structure between the user and kernel threads.
A) KUP
B) LWD
C) UKD
D) LWP
Ans: D
Idea behind thread pool is.
34)
A) Create number of threads at and wait for work
B) Create number of threads once the request are arrived
C) Create each thread separately for each request
D) Create a single thread for bulk of requests
Ans: A
Scheduling algorithm evaluation doesnt involve
35)
A) Deterministic modeling
B) Queuing modeling
C) Simulations
D)Swapping
Ans: D
Benefit of multithreading
36)
A) Responsiveness
B) Accounting
C) Ability to evolve

D)Scheduling
Ans: A
When the process is interrupted in changes the state as
37)
A) Ready to running
B) Running to terminated
C) Running to waiting
D) Running to ready
Ans: D
Number of types of schedulers
38)
A) 2
B) 3
C) 4
D)5
Ans: B
Time from submission of a request until the first response is produced
39)
A) Turnaround time
B) Waiting time
C) Response time
D)Throughput
Ans: C
In LINUX clone() is invoked
40)
A) To create parent process
B) To provide how much sharing is to take place between parent and child
C) Not to provide any sharing between parent and child
D)Child should not access parent data
Ans: B

UNIT-II
1)

2)

3)

Mutual exclusion
A) if one process is in a critical region others are excluded
B) prevents deadlock
C) requires semaphores to implement
D) is found only in the Windows NT operating system
Ans: A
The section of code which accesses shared variables is called as __________.
A) Critical section
B) Block
C) Procedure
D) Semaphore
Ans: A
In one of the deadlock prevention methods, impose a total ordering of all resource
types, and require that each process requests resources in an increasing order of
enumeration. This voilates the _______________ condition of deadlock
A) Mutual exclusion

B) Hold and Wait

C) Circular Wait
D) No Preemption

4)

Ans:C
Semaphore can be used for solving __________.
A) Wait & signal
B) Deadlock
C) Synchronization
D) Priority

Ans: C
The necessary condition before the deadlock can occur
5)
A) No Mutual exclusion,Hold and wait, preemption, circular wait
B) Mutual exclusion,no Hold and wait, preemption, circular wait
C) Mutual exclusion,Hold and wait, no preemption, circular wait
D) Mutual exclusion,Hold and wait, preemption, no circular wait
Ans: C
Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the
6)
following
statements
wait(S);wait(Q);
---;
signal(S);signal(Q)
and
wait(Q);
wait(S);---;signal(Q);signal(S); respectively. The above situation depicts a _________ .
A) Semaphore
B) Deadlock
C) Signal
D) Interrupt

7)

8)

9)

Ans: B
The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded
Waiting.
A) The statement is false
B) The statement is true.
C) The statement is contradictory.
D) Not related to the statement
Ans: B
_________ is the situation in which a process is waiting on another process, which is also
waiting on another process ... which is waiting on the first process. None of the
processes involved in this circular wait are making progress.
A) Deadlock
B) Starvation
C) Dormant
D) Synchronization
Ans: A
The Bankers algorithm is used
A) to prevent deadlock in OS
B) to detect deadlock in OS
C) to rectify a deadlocked state
D) to avoid deadlock in OS

Ans: D
_____ is a high level abstraction over Semaphore.
10)
A) Shared memory

B) Message passing
C) Monitor
D) Mutual exclusion
Ans: C
A binary semaphore
11)
A) has the values one or zero
B) is essential to binary computers
C) is used only for synchronisation
D) is used only for mutual exclusion
Ans : A
A process said to be in ___________ state if it was waiting for an event that will never
12)
occur.
A) Safe
B) Unsafe
C) Starvation
D) Dead lock
Ans : D
Which process can affect of be affected by other processes executing in the system?
13)
A) cooperating process
B) child process
C) parent process
D) init process
Ans: A
When several processes access the same data concurrently and the outcome of the
14)
execution depends on the particular order in which the access takes place, is called
A) dynamic condition
B) race condition
C) essential condition
D) critical condition
Ans: B
If a process is executing in its critical section, then no other processes can be executing
15)
in their critical section. This condition is called
A) mutual exclusion
B) critical exclusion
C) synchronous exclusion
D)asynchronous exclusion
Ans: A
Which one of the following is a synchronization tool?
16)
A) thread
B) pipe
C) semaphore
D) socket
Ans: C
A semaphore is
17)
A) that cannot
B) that cannot
C) that cannot

a shared integer variable

drop below zero
be more than zero
drop below one

D) that cannot be more than one

Ans: A
The circular wait condition can be prevented by
18)
A) defining a linear ordering of resource types
B) using thread
C) using pipes
D) Using threads and pipes together
Ans: A
Which one of the following is the deadlock avoidance algorithm?
19)
A) bankers algorithm
B) round-robin algorithm
C) elevator algorithm
D) karns algorithm
Ans: A
A problem encountered in multitasking when a process is perpetually denied necessary
20)
resources is called
A) deadlock
B) starvation
C) inversion
D) aging
Ans: B
Which one of the following is a visual ( mathematical ) way to determine the deadlock
21)
occurrence?
A) resource allocation graph
B) starvation graph
C) inversion graph
D) Bankers mentioned
Ans: A
To avoid deadlock
22)
A) resource allocation must be done only once
B) all deadlocked processes must be aborted
C) inversion technique can be used
D) there must be a fixed number of resources to allocate
Ans: D
The request and release of resources are ___________.
23)
A) command line statements
B) interrupts
C) system calls
D) special programs
Ans: C
For a deadlock to arise, which of the following is not the necessary condition
24)
A) Mutual exclusion
B) Starvation
C) No preemption
D) Circular wait
Ans: B

25)

For a Hold and wait condition to prevail :

A) A process must be not be holding a resource, but waiting for one to be freed,
and then request to acquire it
B) A process must be holding at least one resource and waiting to acquire
additional resources that are being held by other processes
C) A process must hold at least one resource and not be waiting to acquire
additional resources
D) Process must not hold any resource

Ans: B
Deadlock prevention is a set of methods :
26)
A) to ensure that at least one of the necessary conditions cannot hold
B) to ensure that all of the necessary conditions do not hold
C) to decide if the requested resources for a process have to be given or not
D) to recover from a deadlock
Ans: A
For non sharable resources like a printer, mutual exclusion :
27)
A) must exist
B) must not exist
C) may exist
D) may not exist
Ans: A
To ensure no preemption, if a process is holding some resources and requests another
28)
resource that cannot be immediately allocated to it :
A) then the process waits for the resources be allocated to it
B) the process keeps sending requests until the resource is allocated to it
C) the process resumes execution without the resource being allocated to it
D) then all resources currently being held are preempted
Ans: D
Given a priori information about the ________ number of resources of each type that
29)
maybe requested for each process, it is possible to construct an algorithm that ensures
that the system will never enter a deadlock state.
A) minimum
B) average
C) maximum
D) approximate
Ans: C
A deadlock avoidance algorithm dynamically examines the __________, to ensure that a
30)
circular wait condition can never exist.
A) resource allocation state
B) system storage state
C) operating system
D) resources
Ans: A
A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0
31)
requires 10 tape drives, P1 requires 4 and P2 requires 9 tape drives.
Process
P0

P1
P2
Maximum needs (process-wise : P0 through P2 top to bottom)
10
4
9
Currently allocated (process-wise)
5
2
2
Which of the following sequence is a safe sequence ?
A) P0, P1, P2
B) P1, P2, P0
C) P2, P0, P1
D) P1, P0, P2
Ans: D
The content of the matrix Need is :
32)
A) Allocation Available
B) Max Available
C) Max Allocation
D) Allocation Max
Ans: C
A system with 5 processes P0 through P4 and three resource types A, B, C has A with
33)
10 instances, B with 5 instances, and C with 7 instances. At time t0, the following
snapshot has been taken :
Process
P0
P1
P2
P3
P4
Allocation (process-wise : P0 through P4 top to bottom)
ABC
010
200
302
211
002
Max (process-wise : P0 through P4 top to bottom)
ABC
753
322
902
222
433
Available

ABC
332
The sequence leads the system to :
A) an unsafe state
B) a safe state
C) a protected state
D) a deadlock
Ans: B
An edge from process Pi
34)
A) Pi is waiting for Pj
B) Pj is waiting for Pi
C) Pi is waiting for Pj
D) Pj is waiting for Pi

to
to
to
to
to

Pj in a wait for graph indicates that :

release a resource that Pi needs
release a resource that Pj needs
leave the system
leave the system

Ans: A
A computer system has 6 tape drives, with n processes competing for them. Each
35)
process may need 3 tape drives. The maximum value of n for which the system is
guaranteed to be deadlock free is :
A) 2
B) 3
C) 4
D) 1
Ans: A
If we preempt a resource from a process, the process cannot continue with its normal
36)
execution and it must be :
A) aborted
B) rolled back
C) terminated
D) queued
Ans: B
If the resources are always preempted from the same process, __________ can occur.
37)
A) deadlock
B) system crash
C) aging
D) starvation
Ans: D
Semaphore is a/an _______ to solve the critical section problem.
38)
A) hardware for a system
B) special program for a system
C) integer variable
D) system call
Ans: C
The main disadvantage of spinlocks is that :
39)
A) they are not sufficient for many process
B) they require busy waiting
C) they are unreliable sometimes
D) they are too complex for programmers
Ans: B

40)

The dining philosophers problem will occur in case of :

A) 5 philosophers and 5 chopsticks
B) 4 philosophers and 5 chopsticks
C) 3 philosophers and 5 chopsticks
D) 6 philosophers and 5 chopsticks
Ans: A

Prepared by
Name of the Faculty
: Sheena Mohammed
Designation
: Assistant Professor
Department
: Computer Science and Engineering