20. A deadlock avoidance algorithm dynamically examines the condition can never exist. to ensure that a circular wai a. Operating system. b. Resources. c. System storage state. d. Resource allocation state. 21. Swapping be done when a process has pending I/O or has to execute I/O operations only inte operating system buffers. a. Must never. b. Maybe. с. Can. d. Must 22. The main memory accommodates ? а. CPU. b. User processes. c. Operating system. d. All of the mentioned

20. A deadlock avoidance algorithm dynamically examines the condition can never exist. to ensure that a circular wai a. Operating system. b. Resources. c. System storage state. d. Resource allocation state. 21. Swapping be done when a process has pending I/O or has to execute I/O operations only inte operating system buffers. a. Must never. b. Maybe. с. Can. d. Must 22. The main memory accommodates ? а. CPU. b. User processes. c. Operating system. d. All of the mentioned

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 11P

See similar textbooks

Similar questions

Create a state machine diagram of operating system processes according to the following description: In general, processes are created and are then waiting to be scheduled if they are able to run. They might be blocking on some external condition (IO, semaphores, other synchronization,...) and might be therefore not able to run. If they are scheduled they are running. At any point they can become blocked due to some external condition. Processes can also be swapped out to the page file / swapping space, which can happen when they are waiting for some external condition or when they are waiting to be scheduled. We are assuming that processes can be terminated at any time.
Step 1 The CPU needs to suspend the currently executing process when an interrupt has occurred. It prevents the input-output operation from being delayed. Suppose, a user is asked to enter a key while a process is executing and the input of the key is important for the computation. Then the key entered has to be dealt with then and there. That action cannot be suspended. It is also not known how long the current process may take time to execute. So, the operating system gives preference to the interrupt when it occurs. Step 2 If the interrupts are not serviced as soon as they are received, it makes the DMA inefficient. DMA helps in the interaction of I/O devices with the main memory without interacting with the CPU. Therefore, the interrupts have to be serviced as soon as they occur.
Assume there are two secondary memory processes running; wait for them to complete. In light of phase 1, the highest priority is given to one task and the lowest priority is given to the other. Only one process will be able to run at the same time in the main memory. Explain how the CPU operates on the system. Can you explain the mechanism that exists between all of the CPU components?
Before proceeding with its execution, each process must acquire all the resources it needs. This is described as: A A Hold and wait. B Non pre-emption. C Circular wait. D Starvation.
1. If an operating system does not contain any mechanism for process synchronization, what possible issues are likely to happen? Present an example to support your answer. 2. How does “Race Condition” affect an operating system? 3. There are several algorithmic solutions available for solving deadlocks. If you are asked to implement one of those with Java language (compulsory), how would you do it? You are not required to write any code. But you have to present the idea from Object-oriented programming point of view.
73. Deadlock prevention is a set of methods : a. to ensure that at least one of the necessary conditions cannot hold b. to ensure that all of the necessary conditions do not hold c. to decide if the requested resources for a process have to be given or not d. to recover from a deadlock
44. What is known as a race condition? a. When a deadlock occurs b. When it has a starvation and not a deadlock c. When the result of a computation depends on the speed of the processes involved d. When it cannot have a subroutine call.
Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB each will be processed (See the diagram below). For each of the memory allocation methods listed below, draw a diagram representing how memory is allocated and determine the sizes of the remaining holes after all 14 requests have been satisfied. First fit Next fit C. Best fit d. a. b. Worst fit Hint - For the Next fit, the following allocation starts with the hole following the previous allocation 10 Mb 10 Mb 10 Mb
16. Transient operating system code is a code that a. Stays in the memory always. b. Never enters the memory space. c. Comes and goes as needed. d. Is not easily accessible. 17. The portion of the process scheduler in an operating system that dispatches processes is concerned witl a. Assigning ready processes to waiting queue. b. Assigning running processes to blocked queue. c. Assigning ready processes to CPU. d. All of the mentioned 18. The FCFS algorithm is particularly troublesome for a. Operating systems. b. Multiprocessor systems. c. Time sharing systems. d. Multiprogramming systems ? 19. For an effective operating system, when to check for deadlock? a. Every time a resource request is made at fixed time intervals. b. At fixed time intervals. c. Every time a resource request is made. d. None of the mentioned.
Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory available. Show the result of each request/release via successive figures similar to the one illustrated in the lecture slides. A: Request 25 K B: Request 500 K C: Request 70 K D:Request 100 K E: Request 40 K Release A F: Request 20 K Release B After memory is allocated to process F, how much internal fragmentation exist in the system.
Consider a computer with N processors in a multiprocessor configuration. a. How many processes can be in each of the Ready, Running, and Blocked states at one time? b. What is the minimum number of processes that can be in each of the Ready, Running, and Blocked states at one time?
59. A system is in the safe state if a. the system can allocate resources to each process in some order and still avoid a deadlock b. there exist a safe sequence c. all of the mentioned d. none of the mentioned