ATTENTION:
Kindly note that you will be presented with 50 questions randomized from the NOUN question bank. Make sure to take the quiz multiple times so you can get familiar with the questions and answers, as new questions are randomized in each attempt.
Good luck!
CIT211
1 / 50
1. For the Banker's algorithm to work, it needs to know ________ things
2 / 50
2. Paging is a form of ______ relocation
3 / 50
3. ______ different types of implementation models relate fibers and kernel level threads
4 / 50
4. A process goes from the ‘Ready’ state to ________ state
5 / 50
5. Under ________, all processes that use a language library execute only one copy of the library code
6 / 50
6. In Unbounded capacity buffer, the sender never ______
7 / 50
7. Turnaround Time does not include which of the following?
8 / 50
8. _________ signals are delivered to the same process that performed the operation causing the signal
9 / 50
9. The task of terminating a thread before it has completed is called thread __________
10 / 50
10. The criteria for comparing CPU-scheduling algorithms include the following except: ________
11 / 50
11. Cancellation of a target thread may occur in ______ different scenarios
12 / 50
12. _________ is a technique of gradually increasing the priority of processes that wait in the system for a long time
13 / 50
13. The decision to place the operating system in either low memory or high memory is affected by the location of the ________ vector
14 / 50
14. An I/O-bound program would typically have many very short ___________ bursts
15 / 50
15. The concept of logical address space that is bound to a separate physical-address space is __________ to proper memory management
16 / 50
16. Which of the following does the Banker's algorithm need to know to work?
17 / 50
17. A nano-kernel is a very _________ operating system kernel
18 / 50
18. The benefits of multi-threading include the following except: ________
19 / 50
19. The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS
20 / 50
20. When a process creates a new process, _____ possibilities exist in terms of execution
21 / 50
21. _______ is the most general scheduling scheme, and also the most complex
22 / 50
22. A solution to indefinite blocking of low-priority processes is __________
23 / 50
23. Under dynamic ___________ , all processes that use a language library execute only one copy of the library code
24 / 50
24. The behaviour of the processes __________ unsafe states
25 / 50
25. The goal of ___________ is to shuffle the memory contents to place all free memory together in one large block
26 / 50
26. In __________ capacity buffer, the sender must block until the recipient receives the message
27 / 50
27. In which of the following address-binding scheme is the logical- and physical-address spaces differ?
28 / 50
28. The selection of the first-fit versus best-fit strategies can affect the amount of _________
29 / 50
29. In which of the following ways can a signal be delivered?
30 / 50
30. Analytical methods of CPU scheduling algorithm evaluation use ____________ analysis to determine the performance of an algorithm
31 / 50
31. The advantage of dynamic loading is that an _________ routine is never loaded
32 / 50
32. With dynamic linking, a ______ is included in the image for each library-routine reference
33 / 50
33. Which of the following does the Banker's algorithm need to know to work?
34 / 50
34. The ________ mapping from virtual to physical addresses is done by the memory-management unit
35 / 50
35. Canceling a thread _________ may not free a necessary system-wide resource.
36 / 50
36. ________ Time is the interval from the time of submission of a process to the time of completion
37 / 50
37. Blocking message passing is known as _________
38 / 50
38. Which of the following schemes requires help from the operating system?
39 / 50
39. With dynamic loading, a routine is not loaded until it is ________
40 / 50
40. __________ synchronization refers to the idea of keeping multiple copies of a data-set in coherence with one another.
41 / 50
41. Which of the following memory management algorithm suffers from external fragmentation?
42 / 50
42. Which of the following scheduling algorithms is a type of priority scheduling algorithm?
43 / 50
43. Every logical address is bounded by the paging hardware to some ________ address
44 / 50
44. The _________ is the module that gives control of the CPU to the process selected by the short-term scheduler
45 / 50
45. Deadlock _______ requires that the operating system be given in advance additional information concerning which resources a process will request and use during its lifetime
46 / 50
46. Under which of the following circumstances can CPU scheduling decisions take place?
47 / 50
47. ________ deadlocks are deadlocks that are detected in a distributed system but don't actually exist .
48 / 50
48. ________ deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used.
49 / 50
49. The first problem in selecting a scheduling algorithm is defining the _________ to be used
50 / 50
50. In a system that selects victims for rollback primarily on the basis of cost factors, _________ may occur
Restart quiz
Rate this quiz
