17268855
Description
Flashcards by Tyler Rock, updated more than 1 year ago
|
Created by Tyler Rock
over 5 years ago
|
|
| Question | Answer |
| A(n) ____ is created by a process, and it can be scheduled and executed independently of its parent process. a. thread b. program c. miniprocess d. instruction set | a. thread |
| ____ 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. Cyclic programming b. Dedicated processing c. Multiprogramming d. Multi-core processing | c. Multiprogramming |
| The ____ is also called a high-level scheduler. a. Process Scheduler b. Job Scheduler c. Program Scheduler d. Thread Scheduler | b. Job Scheduler |
| The Job Scheduler seeks to ____ when scheduling jobs. a. run all CPU intensive jobs first b. run all I/O intensive jobs first c. balance CPU and I/O intensive jobs d. run the quickest jobs first | c. balance CPU and I/O intensive jobs |
| The Process Scheduler assigns the CPU to execute the processes for those jobs placed on the ____ queue by the Job Scheduler. a. WAITING b. NEXT c. PROCESS d. READY | d. READY |
| When a job is accepted by the system, it’s put on ____ and placed in a queue. a. HOLD b. RUNNING c. WAITING d. READY | a. HOLD |
| 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. READY to RUNNING b. RUNNING to WAITING c. RUNNING back to READY d. HOLD to READY | d. HOLD to READY |
| The transition from ____ can be initiated by the Process Scheduler or the Job Scheduler. a. WAITING to READY b. RUNNING to WAITING c. RUNNING to FINISHED d. HOLD to READY | c. 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 State Block c. Thread Pointer d. Thread Queue | a. Thread Control Block |
| An I/O request is called a(n) ____ wait in multiprogramming environments. a. forced b. natural c. scheduled d. indirect | b. natural |
| The first-come, first-served (FCFS) algorithm is fine for most ____ systems. a. multiuser b. user initiated c. interactive d. batch | d. batch |
| 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 |
| 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 |
| 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. lagging b. aging c. bumping d. accelerated priority | b. aging |
| 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 |
| 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 |
| 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 |
| ____ allows for faster turnaround of CPU-bound jobs. a. No movement between queues b. Movement between queues c. Variable time quantum per queue d. Aging | c. Variable time quantum per queue |
| ____ is a dynamic-priority preemptive scheduling algorithm built to address the critical processing requirements of real-time systems and their pressing deadlines. a. Variable Time Quantum Per Queue b. Round Robin c. Shortest Job Next d. Earliest Deadline First | d. Earliest Deadline First |
| When the operating system detects a nonrecoverable error, the following step is performed first by the interrupt handler: ____. a. the state of the interrupted process is saved b. the type of interrupt is described and stored c. the interrupt is processed d. the processor resumes operation | b. the type of interrupt is described and stored |
Want to create your own Flashcards for free with GoConqr? Learn more.