1..………….
processors share memory and a clock; communication usually takes place
through the shared memory
A) Loosely Coupled
B) Tightly coupled
C) Real time Systems
D) Distributed systems
2 In …………………………… one server standby while the other runs the application
A) Asymmetric multiprocessing
B) Symmetric Clustering
C) Asymmetric Clustering.
D) Symmetric multiprocessing
3.If one processor fails, then the remaining processors will share the work of the failed
processors. This is known as ……………………………
A) Risk tolerant
B) fault tolerant
C) Load tolerant
D) Hot standby mode
4 Each program can control the CPU for as long as it needs CPU. This type of scheduling
called
A) SJF
B)Cooperative
C) preemptive
D)Priority
5. Master – slave relationship exist in
A) Asymmetric multiprocessing
B) Symmetric Clustering
C) Asymmetric Clustering
D) Symmetric multiprocessing
6. The process of creating as many child processes from the parent process is called
A) spanning
B) swapping
C) spawning
D) All
7 A long CPU bound job may take the CPU and force short job to wait for a long time called
convoy effect occurs in
A) SJF
B) SRTF
C) FCFS
D) Priority scheduling
8. Low priority process may never get executed called …………..
A) Indefinite blocking
B) Aging
C) Graceful degradation
D) Convoy effect
9. …………………………..selects which processes should be brought into the ready queue.
A) Long Term Scheduler
B) Short Term Scheduler
C) Processor
D) Medium term Scheduler
10 if a new process arrives with CPU burst length less than remaining time of current
executing process, preempt. This scheme is known as
A) SRTF
B) SJF Non preemptive
C) Convoy effect
D) Aging
11………………… is invoked very frequently (milliseconds))
A) Long term Scheduler
B) Short Term Scheduler
C) Processor
D) Medium term Scheduler
12 …………………… is invoked very infrequently (seconds, minutes)
A) Long term Scheduler
B) Short Term Scheduler
C) Processor
D) Medium term Scheduler
13. The long-term scheduler controls the……………………..
A) Central Processing Unit
B) Memory Unit
C) Degree of Multiprogramming
D) Convoy effect
14. ………………….. spends more time doing computations; few very long CPU bursts.
A) CPU Bound Process
B) I/O Bound Process
C) Memory Bound process
D) Convoy effect
15. In Unix ………………. system call creates new process.
A) Fork
B) Exec
C) Wait
D) Pipe
16. …………………………. Is the time it takes for the dispatcher to stop one process and start
another running.
A) Dispatch Latency
B) Dispatch Time
C) Dispatch Scheduling
D)Waiting time
17. ………..... is the amount of time to execute a particular process
A) Waiting Time
B) Response Time
C) Turnaround Time
D) Completion Time
18. ………..... is the module that gives control of the CPU to the process selected by the short-
term scheduler.
A) Job scheduler
B) Scheduler
C) Dispatcher
D) Kernel
19 . In …………………………………. a process can move between the various queues.
A) Multilevel Feedback Queue
B) Multilevel Priority Queue
C) Multilevel Queue
D) Round Robin
20. If process Pi is executing in its critical section, then no other processes can be executing
in their critical sections. This is called………………………………
A) Mutual Inclusion
B) Mutual Exclusion
C) Critical Exclusion
D)None
21 ………………………….. is the situation where several processes access – and manipulate
shared data concurrently.
A) Safe State
B) Critical Section
C) Race Condition
D)Starvation
22 Available, Max, Allocation and Need are the data structures of ……………………. Algorithm
A) Lamport Algorithm
B) Bakery Algorithm
C) Banker’s Algorithm
D) Peterson Algorithm
23 ………………………….. section a process performs certain operation indicating its exit from
the CS and thereby enables one of the waiting processes to enter its CS
A) Entry Section
B) Remainder Section
C) Exit Section
D) Critical Section
24 which condition is optional for the solution to the critical section problem?
A) Mutual Exclusion
B) Progress
C) Bounded Waiting
D) None
25 when no one is in the critical section, and someone wants in. Then those processes not
in their ………………………….. section should decide who should go in, in a finite time.
A) Entry Section
B) Remainder Section
C) Exit Section
D) Critical Section
26 ………………………….. decrements the value of semaphore by 1
A) Signal
B) Wait
C)V(S)
D)None
27 A process may never be removed from the semaphore queue in which it is suspended is
called
A) Starvation
B) Blocking
C) Busy waiting
D) None
28 Gradually increasing the priority of a process called
A) Aging
B) Semaphore
C)Mutual exclusion
D)None
29 ………………………….. semaphores give simultaneous access to some resource for a limited
number of users
A) Counting
B) Binary
C) Mutex
D)None
30 While a process is in CS any other process tries to enter its CS must loop continuously in
the entry code. This type of semaphore also called a …………………………..
A) spinlock
B) lock
C)Mutex
D)Deadlock
