Вы находитесь на странице: 1из 10

1) Round robin scheduling is essentially the preemptive version of ________.

1 FIFO
2 Shortest job first
3 Shortes remaining
4 Longest time first
Right Ans ) 1
2) A page fault occurs
1 when the page is not in the memory
2 when the page is in the memory
3 when the process enters the blocked state
4 when the process is in the ready state
Right Ans ) 1
3) Which of the following will determine your choice of systems software for you
r computer ?
1 Is the applications software you want to use compatible with it ?
2 Is it expensive ?
3 Is it compatible with your hardware ?
4 Both 1 and 3
Right Ans ) 4
4) Let S and Q be two semaphores initialized to 1, where P0 and P1 processes the
following statements wait(S);wait(Q); ---; signal(S);signal(Q) and wait(Q); wai
t(S);---;signal(Q);signal(S); respectively. The above situation depicts a ______
___ .
1 Semaphore
2 Deadlock
3 Signal
4 Interrupt
Right Ans ) 2
5) What is a shell ?
1 It is a hardware component
2 It is a command interpreter
3 It is a part in compiler
4 It is a tool in CPU scheduling
Right Ans ) 2
6) Routine is not loaded until it is called. All routines are kept on disk in a
relocatable load format. The main program is loaded into memory & is executed. T
his type of loading is called _________
1 Static loading
2 Dynamic loading
3 Dynamic linking
4 Overlays
Right Ans ) 3
7) In the blocked state
1 the processes waiting for I/O are found
2 the process which is running is found
3 the processes waiting for the processor are found
4 none of the above
Right Ans ) 1
8) What is the memory from 1K - 640K called ?
1 Extended Memory
2 Normal Memory
3 Low Memory
4 Conventional Memory
Right Ans ) 4
9) Virtual memory is __________.
1 An extremely large main memory
2 An extremely large secondary memory
3 An illusion of extremely large main memory
4 A type of memory used in super computers.
Right Ans ) 3
10) The process related to process control, file management, device management,
information about system and communication that is requested by any higher level
language can be performed by __________.
1 Editors
2 Compilers
3 System Call
4 Caching
Right Ans ) 3
11) If the Disk head is located initially at 32, find the number of disk moves r
equired with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,6
7.
1 310
2 324
3 315
4 321
Right Ans ) 4
12) Multiprogramming systems ________.
1 Are easier to develop than single programming systems
2 Execute each job faster
3 Execute more jobs in the same time
4 Are used only on large main frame computers
Right Ans ) 3
13) Which is not the state of the process ?
1 Blocked
2 Running
3 Ready
4 Privileged
Right Ans ) 4
14) The solution to Critical Section Problem is : Mutual Exclusion, Progress and
Bounded Waiting.
1 The statement is false
2 The statement is true.
3 The statement is contradictory.
4 None of the above
Right Ans ) 2
15) The problem of thrashing is effected scientifically by ________.
1 Program structure
2 Program size
3 Primary storage size
4 None of the above
Right Ans ) 1
16) The state of a process after it encounters an I/O instruction is __________.
1 Ready
2 Blocked/Waiting
3 Idle
4 Running
Right Ans ) 2
17) The number of processes completed per unit time is known as __________.
1 Output
2 Throughput
3 Efficiency
4 Capacity
Right Ans ) 2
18) _________ 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 proce
ss. None of the processes involved in this circular wait are making progress.
1 Deadlock
2 Starvation
3 Dormant
4 None of the above
Right Ans ) 1
19) Which of the following file name extension suggests that the file is Backup
copy of another file ?
1 TXT
2 COM
3 BAS
4 BAK
Right Ans ) 4
20) Which technique was introduced because a single job could not keep both the
CPU and the I/O devices busy?
1 Time-sharing
2 SPOOLing
3 Preemptive scheduling
4 Multiprogramming
Right Ans ) 4
21) A critical region
1 is a piece of code which only one process executes at a time
2 is a region prone to deadlock
3 is a piece of code which only a finite number of processes execute
4 is found only in Windows NT operation system
Right Ans ) 1
22) The mechanism that bring a page into memory only when it is needed is called
_____________
1 Segmentation
2 Fragmentation
3 Demand Paging
4 Page Replacement
Right Ans ) 3
23) PCB =
1 Program Control Block
2 Process Control Block
3 Process Communication Block
4 None of the above
Right Ans ) 2
24) FIFO scheduling is ________.
1 Preemptive Scheduling
2 Non Preemptive Scheduling
3 Deadline Scheduling
4 Fair share scheduling
Right Ans ) 2
25) Switching the CPU to another Process requires to save state of the old proce
ss and loading new process state is called as __________.
1 Process Blocking
2 Context Switch
3 Time Sharing
4 None of the above
Right Ans ) 2
26) Which directory implementation is used in most Operating System?
1 Single level directory structure
2 Two level directory structure
3 Tree directory structure
4 Acyclic directory structure
Right Ans ) 3
27) The Banker¿s algorithm is used
1 to prevent deadlock in operating systems
2 to detect deadlock in operating systems
3 to rectify a deadlocked state
4 none of the above
Right Ans ) 1
28) A thread
1 is a lightweight process where the context switching is low
2 is a lightweight process where the context swithching is high
3 is used to speed up paging
4 none of the above
Right Ans ) 1
29) ______ is a high level abstraction over Semaphore.
1 Shared memory
2 Message passing
3 Monitor
4 Mutual exclusion
Right Ans ) 3
30) A tree sturctured file directory system
1 allows easy storage and retrieval of file names
2 is a much debated unecessary feature
3 is not essential when we have millions of files
4 none of the above
Right Ans ) 1
74) Scheduling is ________
1) allows processor to use the jobs
2) Not required in uni processor system
3) Allowing jobs to use the processor
4) None.
Answer: 3
Level:1
75) In which of the following scheduling schemes does context switching never ta
ke place.
1) Round robin
2) SJF
3) FCFS
4) Priority
Answer: 3
Level:1
76) In multilevel queue scheduling (CPU scheduling) arrange the following in the
order lowest to highest priority.
a) Interactive process
b) Batch process
c) System process
d) Student process
1) a, b, c, d
2) d, c, b, a
3) c, a, b, d
4) c, b, a, d
Answer: 3
As per def of multi level q
Level:2
77) Belady s Anomaly is present in _________
1) LIFO
2)FIFO
3) FCFS
4)SJF
Answer:2
Exp: as per def of Belady s anamoly
Level:2
78)FCFS scheduling is the simplest algorithm, but it can cause short process to
wait for very long processes. True/False
Answer: True
Level:1
79) In which of the following scheduling schemes does context switching take pla
ce.
1) SJF
2) FCFS
3) Priority
4) both 1 and 3
Answer: 4
Level:1
80)Which of the following is not a CPU scheduling algorithm?
1) SCAN
2) SJF
3) FCFS
4) Round robin
Answer: 1
81) Process A has arrived in the system by time 0 and requires 5 time units in t
he CPU, process B has arrived by time 1 and requires 3 time units, process C has
arrived by time 2 and requires 1 time unit. Assuming negligible processes switc
hing time, and that all processes are CPU bound and that a new quantum starts wh
enever a process finishes, the average time for Round robin (Q=3) is ___________
1) 3.33
2) 2.33
3) 2.89
4) 4.67
Answer: 1
82) Which of the scheduling algorithm gives the minimum average waiting time for
a given set of processes?
1) FCFS
2) SJF
3) Round Robin
4) Priority
Answer: 2
83) Forcible removal of a resource from a process is possible through _____
1) Scheduling
2) Preemption
3) Dispatching
4) None
Answer: 2
84) Which of the following gives control of the CPU to the process selected by s
hort term scheduler?
1) Context switching
2) Thread
3) Interrupt
4) Dispatcher
Answer: 4
85) Which of the following is strictly preemptive?
1) FCFS
2) Priority
3) Round Robin
4) SJF
Answer: 3
86) The performance of round robin algorithm depends on
1) Preemption
2) Time Quantum
3) Non-preemption
4) Priority
Answer: 2
87)The following are the processes and their burst time:
P1 : 6, P2 : 8 P3 : 7 P4 : 3.. The average turn around time if SJF is used is __
__mille seconds
1) 7
2) 13
3) 19
4) 7.6
Answer: 2
88)Allocate the smallest hole that is big enough , is which type of fit in dynam
ic storage allocation problem.
1) First fit
2) Best fit
3) Worst fit
4) None
Answer: 2
89)Round robin algorithm is suitable for which type of systems?
1) Real time systems
2) Embedded
3) Multiprogramming
4) Time sharing
Answer: 4
90)The major problem with priority scheduling algorithm is _________.
1) Indefinite blocking
2) Takes large turnaround time
3) Deadlock occurs
4) All the above
Answer: 2
91)If the time quantum is very big in round robin CPU scheduling algorithm, then
it acts as
1) SJF scheduling
2) FCFS
3) Priority
4) SJF with preemption
Answer: 2
92)Medium term scheduler is based on
1) Scroll in, scroll out
2) Wrap in, wrap out
3) Swap in, swap out
4) Fetch in, fetch out
Answer: 3
93)In which of the following context switching never takes place?
1) SJF
2) Round robin
3) Preemptive policy
4) None
Answer: 1
94)The hardware mechanism that enables a device to notify the CPU is called ____
___.
1) Interrupt
2) Polling
3) System call
4) None
Answer: 2
95)Round robin scheduling algorithm is suitable for Time sharing systems. True/
False
Answer: True
96)__________ selects the process from secondary storage and loads them into mem
ory for execution.
1) Medium term scheduler
2) Short term scheduler
3) Long term scheduler
4) None
Answer: 3
97)To maximize CPU utilization and throughput we should maximize turnaround time
and minimize waiting time. True/ False?
Answer: False
Exp: we should minimize turnaround time and minimize waiting time.
98)The function of resident monitor is Memory management. True/ False
Answer: False
Expl: The function of resident monitor is Automatic job scheduling.
99) Round robin scheduling is essentially the preemptive version of ________.
1) FIFO
2) Shortest job first
3) Shortest remaining
4) FCFS
Ans: 1
100) 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.
1) 310
2) 324
3) 315
4) 321
Ans:- (4)
101) FIFO scheduling is ________.
1) Preemptive Scheduling
2) Non Preemptive Scheduling
3) Deadline Scheduling
4) Fair share scheduling
Ans: - 2
102) Using Priority Scheduling algorithm, find the average waiting time for the
following set of processes given with their priorities in the order: Process : B
urst Time : Priority respectively . P1 : 10 : 3 , P2 : 1 : 1 , P3 : 2 : 4 , P4 :
1 : 5 , P5 : 5 : 2.
1) 8 milliseconds
2) 8.2 milliseconds
3) 7.75 milliseconds
4) 3 milliseconds
Ans: 2
103) Which of the following disk scheduling techniques has a drawback of starvat
ion?
1) SCAN
2) SSTF
3) FCFS
4) LIFO
Ans:- 2
104) Which of the following is a criterion to evaluate a scheduling algorithm?
1) CPU Utilization: Keep CPU utilization as high as possible.
2) Throughput: number of processes completed per unit time.
3) Waiting Time: Amount of time spent ready to run but not running.
4) All of the above
Ans: - 4
105) Which of the following is not a disk scheduling algorithm?
1) SCAN
2) Elevator / LOOK
3) FCFS
4) Working set
Ans: 4
106) Which of these scheduling algorithms allows a process to move up and down b
etween queues?
1) Round robin
2) First-Come, First-Served scheduling
3) Multilevel feedback queue scheduling
4) Priority scheduling
Ans:- 3
107) If a new process arrives with CPU burst time less than remaining CPU burst
time of current executing process, preempt. This scheduling algorithm is known a
s ____________.
1) Shortest-Job-First
2) Priority
3) FCFS
4) None of the above
Ans :- 1
108) Which of these is not a part of the process scheduler?
1. Context Switch
2. Long, medium and short term scheduler
3. Dispatcher
4. Program Control
Ans:- 4
109) The ready list in an operating system contains jobs ________.
1) waiting for I/O
2) being executed by the processor
3) waiting for the processor to be allotted to them
4) waiting for input only
Ans:- ( 3)
110) Round robin scheduling ________.
1) Is quite complex to implement
2) Allows interactive tasks quicker access to the processor
3) Allows processor bound tasks more time in the processor
4) Gives each task the same chance at the processor
Ans 4
111) Which of these scheduling algorithms allows a process to move up and down b
etween queues?
1) Round robin
2) First-Come, First-Served scheduling
3) Multilevel feedback queue scheduling
4) Priority scheduling
Ans: - ( 3 )
112) In a process scheduling, the mechanism for scheduling and policy can be set
by _____________ and _____________ respectively.
1) Kernel & user process
2) User Process & threads
3) Shell & Kernel
4) Kernel & Threads
Ans:- 1
113) ________ scheduler selects the jobs from the pool of jobs and loads into th
e ready queue.
1) Long term
2) Short term
3) Medium term
4) None of the above
Ans: - 1
114) Which one of the following is true for a CPU having a single interrupt requ
est line and a single interrupt grant line?
1) Neither vectored interrupt nor multiple interrupting devices are possible.
2) Vectored interrupts are not possible but multiple interrupting devices are po
ssible
3) Vectored interrupts and multiple interrupting devices are both possible.
4) Vectored interrupt is possible but multiple interrupting devices are not poss
ible
Answer: 2
115) Which of the process scheduling algorithm do you expect to produce the smal
lest average waiting time
1) SJF
2) FCFS
3) round-robin
4) All the above
Answer:1

Вам также может понравиться