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