CIT211

1. Which of the following does the Banker's algorithm need to know to work?

2. ________ deadlocks are deadlocks that are detected in a distributed system but don't actually exist .

3. With dynamic loading, a routine is not loaded until it is ________

4. When a process creates a new process, _____ possibilities exist in terms of execution

5. Under dynamic ___________ , all processes that use a language library execute only one copy of the library code

6. The goal of ___________ is to shuffle the memory contents to place all free memory together in one large block

7. _________ is a technique of gradually increasing the priority of processes that wait in the system for a long time

8. ______ different types of implementation models relate fibers and kernel level threads

9. ________ Time is the interval from the time of submission of a process to the time of completion

10. The decision to place the operating system in either low memory or high memory is affected by the location of the ________ vector

11. In __________ capacity buffer, the sender must block until the recipient receives the message

12. ________ deadlocks can occur in distributed systems when distributed transactions or concurrency control is being used.

13. The first problem in selecting a scheduling algorithm is defining the _________ to be used

14. Deadlock _______ requires that the operating system be given in advance additional information concerning which resources a process will request and use during its lifetime

15. Cancellation of a target thread may occur in ______ different scenarios

16. In which of the following address-binding scheme is the logical- and physical-address spaces differ?

17. The criteria for comparing CPU-scheduling algorithms include the following except: ________

18. Which of the following memory management algorithm suffers from external fragmentation?

19. An I/O-bound program would typically have many very short ___________ bursts

20. With dynamic linking, a ______ is included in the image for each library-routine reference

21. The _________ is the module that gives control of the CPU to the process selected by the short-term scheduler

22. Paging is a form of ______ relocation

23. In Unbounded capacity buffer, the sender never ______

24. The advantage of dynamic loading is that an _________ routine is never loaded

25. Which of the following does the Banker's algorithm need to know to work?

26. Which of the following schemes requires help from the operating system?

27. In which of the following ways can a signal be delivered?

28. Blocking message passing is known as _________

29. The selection of the first-fit versus best-fit strategies can affect the amount of _________

30. Analytical methods of CPU scheduling algorithm evaluation use ____________ analysis to determine the performance of an algorithm

31. The benefits of multi-threading include the following except: ________

32. Canceling a thread _________ may not free a necessary system-wide resource.

33. The class of OS that has very little user-interface capability, and no end-user utilities is __________ OS

34. Under ________, all processes that use a language library execute only one copy of the library code

35. A solution to indefinite blocking of low-priority processes is __________

36. __________ synchronization refers to the idea of keeping multiple copies of a data-set in coherence with one another.

37. In a system that selects victims for rollback primarily on the basis of cost factors, _________ may occur

38. For the Banker's algorithm to work, it needs to know ________ things

39. A process goes from the ‘Ready’ state to ________ state

40. The ________ mapping from virtual to physical addresses is done by the memory-management unit

41. _________ signals are delivered to the same process that performed the operation causing the signal

42. The behaviour of the processes __________ unsafe states

43. Every logical address is bounded by the paging hardware to some ________ address

44. The concept of logical address space that is bound to a separate physical-address space is __________ to proper memory management

45. Which of the following scheduling algorithms is a type of priority scheduling algorithm?

46. The task of terminating a thread before it has completed is called thread __________

47. Under which of the following circumstances can CPU scheduling decisions take place?

48. Turnaround Time does not include which of the following?

49. A nano-kernel is a very _________ operating system kernel

50. _______ is the most general scheduling scheme, and also the most complex