Solve Question 20, 21, 22 showing detailly all the steps with including all explanationsAnswer Should be typewritten using a computer keyboard! 20. The Shortest Job First is a process schedulingstrategy which isA Pre-emptiveB Non pre-emptiveC Free memory space have to bereallocatedD Suitable in batch processing.21. If a new device, such as a printer or scanner, isattached to a computer, which of the followingsoftware need to be installed before the devicecan be used?A PatchB Compilere DriverD Disk Manager22. Starvation can be avoided by which of thefollowing strategies?1. By using shortest job first resource allocationpolicy.2. By using first-come, first-serve resourceallocation policy.3.By using convoy effectA 1 onlyB 1 and 2€ 2 onlyD 3 only

Refer to step 2 for the answer.

Answered: 20. The Shortest Job First is a process…

20. The Shortest Job First is a process scheduling strategy which is A Pre-emptive B Non pre-emptive C Free memory space have to be reallocated D Suitable in batch processing.

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

Suppose we have a system with 50 active processes, P0, P1, ..., P49, some user processes, and some kernel processes. For simplicity, we are not concerned with threads in this question. Ready processes are scheduled to Run by some scheduler. The scheduling algorithm does not matter here. Suppose process P13 makes a disk_read() operating system call. Assume that the completion of disk transfer is signalled by an interrupt from the disk controller. Trace as accurately as you can what happens in the CPU (not the disk) until process P13 has received its requested information from the disk. Hints: The question is about interrupt handling I am looking for a trace of what processes run, why, and what they do. I am not looking for instruction-level explanations. I am not looking for a discussion of disk access, operation, or transfer.
2. Create a LINUX C program to implement Priority CPU Scheduling with same arrival times. Processes will be scheduled based on their priority. Process Burst Time Priority P1 9. 4 P2 P3 3 P4 8. 4 P5 1 Note: - Please keep in mind that the lower the priority number, the higher the priority. If the priority of two processes is the same, sort according to process number.
Computer Science I'm working on project about building an operating system simulator and in the description of the project under the section about I/O management, the requirement is two typed of I/O event must be handled. One come from a process and the other one come from external (e.g hardware peripherals) which may happen at moment and caused by process being executed by CPU. So I dont really know what to do here? is it asking to implement some kind of disk scheduling algorithms? im doing the project in python btw
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. ’Process Synchronization’ is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called ’Deadlock'.
Suppose the OS on your computer uses the Buddy system for memory management. Initially the system has a 1 megabyte (1024K) block of memory managment Show the result of each request. 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 inthe system. (Subject:operating system )
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. 'Pro- vess Synchronization' is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called 'Deadlock'. ,In concurrent programming, a "critical section" is a part of a multi-process program that (a) may not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do { flag(i] - TRUE; while (flag[j]); %wait CRITICAL SECTION flag[i] - FALSE; REMAINDER SECTION } while (TRUE); Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) (i) { simple 'yes-no' answer is NOT enough. What is the mutual exclusion requirement? Why is (not?)…
To improve performance when reading files, "block read ahead" can be performed. What is this? A. The operating system determines, when reading block K, if the file is being read sequentially. If it is, the file system will retrieve block K, and initiate the request for block K+1 in the file. B. The operating system determines, when writing block K, if the file is being written sequentially. If it is, the file system will retrieve block K, and initiate the request for block K+1 in the file. C. The operating system determines when reading block K if that block was accessed via a seek. If it is, the file system will retrieve block K, and initiate the request for the next block in the file that is needed by the process. D. All of the above
Modern Operating Systems must tackle the challenges of Synchronization and Deadlock. 'Process Synchronization' is the task of coordinating the execution of processes in a way that no two processes can have access to the same shared data or resource. A process requesting a resource may have to wait, if the resource is not available at that time. Sometimes, a waiting process is never able to change state, because the resources it has requested are held by other waiting processes; this situation is called 'Deadlock'. In concurrent programming, a "critical section" is a part of a multi-process program thatmay not be concurrently executed by more than one of the program's thread. Let us consider a 2 processes solution: do {flag[i] = TRUE;while(flag[j]); %waitCRITICAL SECTIONflag[i] = FALSE;REMAINDER SECTION} while (TRUE);Pseudo-code of $P_i$ (the one of $P_j$ is symmetric) a) Does the given solution satisfy the mutual exclusion requirement? Explain (asimple 'yes-no' answer is NOT enough.…
Facts: Facts about Deadlock Deadlock is a situation that occurs in OS when any process enters a waiting state because another waiting process is holding the demanded resource. Deadlock is a common problem in multi-processing where several processes share a specific type of mutually exclusive resource known as a soft lock or software. Deadlock is a situation where a process or a set of processes is blocked, waiting for some other resource that is held by some other waiting process. It is an undesirable state of the system. The following are the four conditions that must hold simultaneously (Links to an external site.) for a deadlock to occur. Mutual Exclusion –A resource can be used by only one process at a time. If another process requests for that resource then the requesting process must be delayed until the resource has been released. Hold and wait –Some processes must be holding some resources in nonshareable mode and at the same time must be waiting to acquire some more…
What describes how the principle of least privlege applies to the use of computers? A, It guarantees that no information inifially held in an object can be used outside its execution environment B, A process is allowed access only to the resources il needs to complete Its task and limit damage from a faulty process C, It is a process that can access an object in a domain only if that domain has a key that malches one of the locks of the object D It is the use of access controls to monitor and limit access to applications, programs, and websites during specific times of use.
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.
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.