Question 1

A process is selected from the___________   queue by the___________  scheduler, to be executed.

Accepted Answer

A) blocked, short term 
B) wait, long term 
C) ready, short term 
D) ready, long term 
A) blocked, short term 
B) wait, long term 
C) ready, short term 
D) ready, long term C

Question 2

What is Waiting time?

Accepted Answer

A) the total time in the blocked and waiting queues 
B) the total time spent in the ready queue 
C) the total time spent in the running queue 
D) the total time from the completion till the submission of a process 
A) the total time in the blocked and waiting queues 
B) the total time spent in the ready queue 
C) the total time spent in the running queue 
D) the total time from the completion till the submission of a process B

Question 3

What is Dispatch latency?

Accepted Answer

A) the speed of dispatching a process from running to the ready state 
B) the time of dispatching a process from running to ready state and keeping the cpu idle 
C) the time to stop one process and start running another one 
D) none of the mentioned 
A) the speed of dispatching a process from running to the ready state 
B) the time of dispatching a process from running to ready state and keeping the cpu idle 
C) the time to stop one process and start running another one 
D) none of the mentioned C

Question 4

The switching of the CPU from one process or thread to another is called

Accepted Answer

A) process switch 
B) task switch 
C) context switch 
D) all of the mentioned 
A) process switch 
B) task switch 
C) context switch 
D) all of the mentioned

Question 5

Under multiprogramming, turnaround time for short jobs is usually___________  and that for long jobs is slightly___________

Accepted Answer

A) lengthened; shortened 
B) shortened; lengthened 
C) shortened; shortened 
D) shortened; unchanged 
A) lengthened; shortened 
B) shortened; lengthened 
C) shortened; shortened 
D) shortened; unchanged

Question 6

What is FIFO algorithm?

Accepted Answer

A) first executes the job that came in last in the queue 
B) first executes the job that came in first in the queue 
C) first executes the job that needs minimal processor 
D) first executes the job that has maximum processor needs 
A) first executes the job that came in last in the queue 
B) first executes the job that came in first in the queue 
C) first executes the job that needs minimal processor 
D) first executes the job that has maximum processor needs

Question 7

The strategy of making processes that are logically runnable to be temporarily suspended is called___________

Accepted Answer

A) non preemptive scheduling 
B) preemptive scheduling 
C) shortest job first 
D) first come first served 
A) non preemptive scheduling 
B) preemptive scheduling 
C) shortest job first 
D) first come first served

Question 8

The real difficulty with SJF in short term scheduling is___________

Accepted Answer

A) it is too good an algorithm 
B) knowing the length of the next cpu request 
C) it is too complex to understand 
D) none of the mentioned 
A) it is too good an algorithm 
B) knowing the length of the next cpu request 
C) it is too complex to understand 
D) none of the mentioned

Question 9

What is Response time?

Accepted Answer

A) the total time taken from the submission time till the completion time 
B) the total time taken from the submission time till the first response is produced 
C) the total time taken from submission time till the response is output 
D) none of the mentioned 
A) the total time taken from the submission time till the completion time 
B) the total time taken from the submission time till the first response is produced 
C) the total time taken from submission time till the response is output 
D) none of the mentioned

Question 10

Round robin scheduling falls under the category of___________

Accepted Answer

A) non-preemptive scheduling 
B) preemptive scheduling 
C) all of the mentioned 
D) none of the mentioned 
A) non-preemptive scheduling 
B) preemptive scheduling 
C) all of the mentioned 
D) none of the mentioned

Question 11

Which is the most optimal scheduling algorithm?

Accepted Answer

A) fcfs - first come first served 
B) sjf - shortest job first 
C) rr - round robin 
D) none of the mentioned 
A) fcfs - first come first served 
B) sjf - shortest job first 
C) rr - round robin 
D) none of the mentioned

Question 12

Scheduling is done so as to

Accepted Answer

A) increase the throughput 
B) decrease the throughput 
C) increase the duration of a specific amount of work 
D) none of the mentioned 
A) increase the throughput 
B) decrease the throughput 
C) increase the duration of a specific amount of work 
D) none of the mentioned

Question 13

With round robin scheduling algorithm in a time shared system___________

Accepted Answer

A) using very large time slices converts it into first come first served scheduling algorithm 
B) using very small time slices converts it into first come first served scheduling algorithm 
C) using extremely small time slices increases performance 
D) using very small time slices converts it into shortest job first algorithm 
A) using very large time slices converts it into first come first served scheduling algorithm 
B) using very small time slices converts it into first come first served scheduling algorithm 
C) using extremely small time slices increases performance 
D) using very small time slices converts it into shortest job first algorithm

Question 14

Scheduling is done so as to

Accepted Answer

A) increase the turnaround time 
B) decrease the turnaround time 
C) keep the turnaround time same 
D) there is no relation between scheduling and turnaround time 
A) increase the turnaround time 
B) decrease the turnaround time 
C) keep the turnaround time same 
D) there is no relation between scheduling and turnaround time

Question 15

In the following cases non - preemptive scheduling occurs?

Accepted Answer

A) when a process switches from the running state to the ready state 
B) when a process goes from the running state to the waiting state 
C) when a process switches from the waiting state to the ready state 
D) all of the mentioned 
A) when a process switches from the running state to the ready state 
B) when a process goes from the running state to the waiting state 
C) when a process switches from the waiting state to the ready state 
D) all of the mentioned

Question 16

An I/O bound program will typically have

Accepted Answer

A) a few very short cpu bursts 
B) many very short i/o bursts 
C) many very short cpu bursts 
D) a few very short i/o bursts 
A) a few very short cpu bursts 
B) many very short i/o bursts 
C) many very short cpu bursts 
D) a few very short i/o bursts

Question 17

Scheduling is done so as to

Accepted Answer

A) increase the waiting time 
B) keep the waiting time the same 
C) decrease the waiting time 
D) none of the mentioned 
A) increase the waiting time 
B) keep the waiting time the same 
C) decrease the waiting time 
D) none of the mentioned

Question 18

The portion of the process scheduler in an operating system that dispatches processes is concerned with___________

Accepted Answer

A) assigning ready processes to cpu 
B) assigning ready processes to waiting queue 
C) assigning running processes to blocked queue 
D) all of the mentioned 
A) assigning ready processes to cpu 
B) assigning ready processes to waiting queue 
C) assigning running processes to blocked queue 
D) all of the mentioned

Question 19

What is Scheduling?

Accepted Answer

A) allowing a job to use the processor 
B) making proper use of processor 
C) all of the mentioned 
D) none of the mentioned 
A) allowing a job to use the processor 
B) making proper use of processor 
C) all of the mentioned 
D) none of the mentioned

Question 20

There are 10 different processes running on a workstation. Idle processes are waiting for an input event in the input queue. Busy processes are scheduled with the Round- Robin time sharing method. Which out of the following quantum times is the best value for small response times, if the processes have a short runtime, e.g. less than 10ms?

Accepted Answer

A) tq = 15ms 
B) tq = 40ms 
C) tq = 45ms 
D) tq = 50ms 
A) tq = 15ms 
B) tq = 40ms 
C) tq = 45ms 
D) tq = 50ms

Exam 8: Understanding Process Scheduling in Operating Systems

A process is selected from the___________ queue by the___________ scheduler, to be executed.

What is Waiting time?

What is Dispatch latency?

The switching of the CPU from one process or thread to another is called

Under multiprogramming, turnaround time for short jobs is usually___________ and that for long jobs is slightly___________

What is FIFO algorithm?

The strategy of making processes that are logically runnable to be temporarily suspended is called___________

The real difficulty with SJF in short term scheduling is___________

What is Response time?

Round robin scheduling falls under the category of___________

Which is the most optimal scheduling algorithm?

Scheduling is done so as to

With round robin scheduling algorithm in a time shared system___________

Scheduling is done so as to

In the following cases non - preemptive scheduling occurs?

An I/O bound program will typically have

Scheduling is done so as to

The portion of the process scheduler in an operating system that dispatches processes is concerned with___________

What is Scheduling?

Operating System

Operating System and Software

Operating System and Computer Basics: Formatting, Clipboard, Radio Buttons, Bankers Algorithm, and More

Computer Software and Operating System

Processor and Memory Fundamentals

Computer Architecture and Memory

Computer Science and Information Technology on Raid, Middleware, and CPU Scheduling

Operating System and Process Management

Process Scheduling and Synchronization in Multi-Programming Environment

Process Management and Interprocess Communication in Unix

Semaphores, Spinlocks, and Monitors: Understanding Synchronization in Operating Systems

Concurrency Control and Deadlock Prevention in Operating Systems

Deadlock and Resource Allocation in Computer Systems

Memory Management and Swapping Techniques

Memory Management in Operating Systems

Understanding Paging and Memory Management in Operating Systems

Understanding Virtual Memory and Page Replacement Algorithms

Virtual Memory, Segmentation, and Disk Management

Disk Management and I/O Subsystem

Linux Kernel and System Structures

Thread Management and Synchronization in Operating Systems

Operating System Concepts: System Calls, Threads, and Signals

Operating System and Thread Pool

Operating System and Memory Management

Process Control and Memory Management

Linux Kernel, File Systems, Bootloaders and Distributions

Filters

A process is selected from the_ queue by the_ scheduler, to be executed.

Under multiprogramming, turnaround time for short jobs is usually_ and that for long jobs is slightly_