1. If deadlocks occur frequently, the detection algorithm must be invoked
-
rarely
frequently
rarely & frequently
2. The functions of execution and sequencing are performed by using
-
input signals
output signals
control signals
3. Causing the CPU to step through a series of micro operations is called
-
execution
runtime
sequencing
4. A system with multiple CUP’s is called
-
time sharing system
desktop system
client severe system
5. What is the disadvantage of invoking the detection algorithm for every request?
-
overhead of the detection algorithm due to consumption of memory
excessive time consumed in the request to be allocated memory
considerable overhead in computation time
6. Bootstrap loader is always stored in
-
cache
ROM
Ram
7. A process is thrashing if
-
it is spending more time paging than executing
it is spending less time paging than executing
page fault occurs
8. A deadlock eventually cripples system throughput and will cause the CPU utilization to
-
increase
drop
stay still
9. If there are 32 segments, each of size 1 k bytes, then the logical address should have
-
13 bits
14 bits
15 bits
10. Virtual memory is normally implemented by
-
demand paging
buses
virtualization
11. Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify
-
the set of processes that have been deadlocked
the set of processes in the deadlock queue
the specific process that caused the deadlock
12. Segment replacement algorithms are more complex than page replacement algorithms because
-
segments are better than pages
pages are better than segments
segments have variable sizes
13. Which of the following operating system does not implement multitasking truly?
-
Windows 98
MS DOS
Windows XP
14. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?
15. The backing store is generally a
-
fast disk
disk large enough to accommodate copies of all memory imagesfor all users
disk to provide direct access to the memory images
16. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock
-
can never occur
may occur
has to occur
17. ‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock
-
can never occur
may occur
has to occur
18. Which of the following is independent of the address bus?
-
secondary memory
main memory
onboard memory
19. A deadlock can be broken by
-
abort one or more processes to break the circular wait
abort all the process in the system
preempt all resources from all processes
20. A deadlock can be broken by
- abort one or more processes to break the circular wait
abort all the process in the system
preempt all resources from all processes
21. The two ways of aborting processes and eliminating deadlocks are
-
abort all deadlocked processes
abort all processes
abort one process at a time until the deadlock cycle is eliminated
22. Schedulers could be anyone the following;
-
Long Term Scheduler
Short Term Scheduler
Medium Term Scheduler
23. Those processes should be aborted on occurrence of a deadlock, the termination of which?
-
is more time consuming
incurs minimum cost
safety is not hampered
24. Cost factors for process termination include
-
number of resources the deadlock process is not holding
cpu utilization at the time of deadlock
amount of time a deadlocked process has thus far consumed during its execution
25. The operation that does not involves clock cycles is
-
installation of a device
execute
fetch
26.Memory management technique in which system stores and retrieves data from secondary storage for use in main
-
fragmentation
paging
mapping
27. If we preempt a resource from a process, the process cannot continue with its normal execution and it must be
-
aborted
rolled back
terminated
28. Two basic types of operating systems are
-
Sequential and direct
Batch and timesharing
Sequential and real-time
29. To .........................to a safe state, the system needs to keep more information about the states of processes.
-
abort the process
roll back the process
queue the process
30. If the resources are always preempted from the same process .................................can occur.
-
deadlock
system crash
aging
Post a Comment
0 Comments