QUESTION 25 A(n) refers to where a process is accessing/updating shared data. OA) critical section OB) entry section OC) mutex OD) test-and-set QUESTION 26 Which of the following is true of cooperative scheduling? OA) It requires a timer. OB) A process keeps the CPU until it releases the CPU, either by terminating, or by switching to the waiting state. OC) It incurs a cost associated with access to shared data. OD) A process switches from the running state to the ready state when an interrupt occurs.

QUESTION 25 A(n) refers to where a process is accessing/updating shared data. OA) critical section OB) entry section OC) mutex OD) test-and-set QUESTION 26 Which of the following is true of cooperative scheduling? OA) It requires a timer. OB) A process keeps the CPU until it releases the CPU, either by terminating, or by switching to the waiting state. OC) It incurs a cost associated with access to shared data. OD) A process switches from the running state to the ready state when an interrupt occurs.

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter11: Operating Systems

Section: Chapter Questions

Problem 21VE

See similar textbooks

Similar questions

78. To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it : a. then the process waits for the resources be allocated to it b. the process keeps sending requests until the resource is allocated to it c. the process resumes execution without the resource being allocated to it d. then all resources currently being held are preempted
76. To ensure that the hold and wait condition never occurs in the system, it must be ensured that : a. whenever a resource is requested by a process, it is not holding any other resources b. each process must request and be allocated all its resources before it begins its execution c. a process can request resources only when it has none d. all of the mentioned
47. Before proceeding with its execution, each process must acquire all the resources it needs is called a. hold and wait b. No pre-emption c. circular wait d. starvation
Problem Statement: (The following problem is based on problem statements in a number of operating systems texts) For this lab, you'll be setting up 2 queues of PCBs. A process control block (PCB) is an internal structure that is used to hold information associated with a process. A process is an instance of a program that is brought into random-access memory (RAM) for execution. To simplify matters, you'll be setting up 2 queues: a ready queue and a wait queue and, PCBs each PCB will have 2 fields: a process ID or PID (a positive integer) a link field to point to the next PCB on a queue The ready queue will have the PCBs for the processes that will be run in a first-come, first-served fashion. The wait queue will have the PCBs for the processes that will be waiting for a resource in a first-come, first-served fashion. If the PCB at the head of the ready queue needs some resource (for example, I/O) then it will be removed from the ready queue and moved to the rear of…
Determine what is the type of decision mode (non-preemptive or preemptive) to be exercised on a process during uniprocessor scheduling under the following circumstances: a. A process is aborted. Interrupt take place based on a certain clock interval. A process is requesting for I/O. A new process arrival. A process is requesting for operating system services.
SHORTEST JOB FIRST SCHEDULINGAIM:To write a program to implement cpu scheduling algorithm for shortest job firstscheduling.ALGORITHM:1. Start the program. Get the number of processes and their burst time.2. Initialize the waiting time for process 1 as 0.3. The processes are stored according to their burst time.4. The waiting time for the processes are calculated a follows:for(i=2;i<=n;i++).wt.p[i]=p[i=1]+bt.p[i-1].5. The waiting time of all the processes summed and then the average time is calculate6. The waiting time of each processes and average time are displayed.7. Stop the program.
TASK: DESCRIPTION One of the simplest methods for memory allocation is to divide memory into several fixed-sized partitions. Each partition may contain exactly one process. In this multiple-partition method, when a partition is free, a process is selected from the input queue and is loaded into the free partition. When the process terminates, the partition becomes available for another process. The operating system keeps a table indicating which parts of memory are available and which are occupied. Finally, when a process arrives and needs memory, a memory section large enough for this process is provided. When it is time to load or swap a process into main memory, and if there is more than one free block of memory of sufficient size, then the operating system must decide which free block to allocate. Best-fit strategy chooses the block that is closest in size to the request. First-fit chooses the first available block that is large enough. Worst-fit chooses the largest available…
Operating system is a resource allocator so a. It provides system call to abstract the access to the different resources b. It prevents an unprivileged process from accessing a memory location related to another process c. it provides a command line interface that helps to access the system resources d. It controls the CPU time sharing among the processes in the ready queue
Preemptive vs. non-preemptive scheduling: Which technique requires the most CPU time and effort?
Between Preemptive and Non-Preemptive scheduling, which requires more time and action from the CPU? Why?
Preemptive vs. non-preemptive scheduling: Which uses more CPU time and effort?
In priority scheduling algorithm ____________ a) CPU is allocated to the process with highest priority b) CPU is allocated to the process with lowest priority c) Equal priority processes can not be scheduled d) None of the mentioned