OPERATING SYSTEMS CHAPTER 4

The transition from ____ is initiated by the Job Scheduler according to some predefined policy. At this point, the availability of enough main memory and any requested devices is checked. a. HOLD to READY b. RUNNING to WAITING c. RUNNING back to READY d. READY to RUNNING

a. HOLD to READY

The ____ is also called a high-level scheduler. a. Job Scheduler b. Program Scheduler c. Thread Scheduler d. Process Schedule

a. Job Scheduler

The transition from ____ can be initiated by the Process Scheduler or the Job Scheduler. a. RUNNING to FINISHED b. RUNNING to WAITING c. HOLD to READY d. WAITING to READY

a. RUNNING to FINISHED

Each thread in a process is represented by a data structure called a ____ that contains basic information such as the thread's unique identification, state, and priority. a. Thread Control Block b. Thread Pointer c. Thread Queue d. Thread State Block

a. Thread Control Block

Some systems use a strategy known as ____ to increase the priority of jobs that have been in the system for an unusually long time in order to expedite their exit. a. aging b. accelerated priority c. lagging d. bumping

a. aging

No movement between queues is a very simple policy that rewards those who have ____ jobs. a. high-priority b. low-priority c. CPU-bound d. I/O-bound

a. high-priority

When the operating system detects a nonrecoverable error, the following step is performed first by the interrupt handler: ____. a. the type of interrupt is described and stored b. the processor resumes operation c. the state of the interrupted process is saved d. the interrupt is processed

a. the type of interrupt is described and stored

Assume that jobs A-D arrive in the READY queue in quick succession and have the CPU cycle requirements listed below. Using the SRT algorithm, the average turnaround time is ____. Arrival time: 0 1 2 3 Job: A B C D CPU cycle: 6 3 1 4 a. 2.5 b. 6.25 c. 7.75 d. 9.0

b. 6.25

Assume that four jobs, A-D, are in the READY queue at Time 0 and require the CPU cycles listed below. Using the SJN algorithm, the ____ job is run first. Job: A B C D CPU cycle: 5 2 6 4 a. A b. B c. C d. D

b. B

____ allows for faster turnaround of CPU-bound jobs. a. Aging b. Variable time quantum per queue c. No movement between queues d. Movement between queues

b. Variable time quantum per queue

A general rule of thumb for selecting a proper time quantum in Round Robin scheduling is that it should be long enough to allow ____ percent of the CPU cycles to run to completion. a. 20 b. 60 c. 80 d. 100

c. 80

Assume that four jobs, A-D, require the CPU cycles listed below. Using the SJN algorithm, the average turnaround time is ____. Job: A B C D CPU cycle: 5 2 6 4 a. 5.5 b. 6.8 c. 9.0 d. 11.1

c. 9.0

____ is a dynamic-priority preemptive scheduling algorithm built to address the critical processing requirements of real-time systems and their pressing deadlines. a. Shortest Job Next b. Round Robin c. Earliest Deadline First d. Variable Time Quantum Per Queue

c. Earliest Deadline First

____ requires that the processor be allocated to each job or to each process for a period of time and deallocated at an appropriate moment. a. Multi-core processing b. Cyclic programming c. Multiprogramming d. Dedicated processing

c. Multiprogramming

The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler. a. NEXT b. PROCESS c. READY d. WAITING

c. READY

The first-come, first-served (FCFS) algorithm is fine for most ____ systems. a. interactive b. multiuser c. batch d. user initiated

c. batch

An I/O request is called a(n) ____ wait in multiprogramming environments. a. forced b. indirect c. natural d. scheduled

c. natural

A(n) ____ is created by a process, and it can be scheduled and executed independently of its parent process. a. program b. instruction set c. thread d. miniprocess

c. thread

When a job is accepted by the system, it's put on ____ and placed in a queue. a. READY b. RUNNING c. WAITING d. HOLD

d. HOLD

The Job Scheduler seeks to ____ when scheduling jobs. a. run all CPU intensive jobs first b. run the quickest jobs first c. run all I/O intensive jobs first d. balance CPU and I/O intensive jobs

d. balance CPU and I/O intensive jobs