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