WorksheetsOperating Systems (CSE) Test-1
Total questions: 20
Worksheet time: 20mins
one of the true problems with priority scheduling is
Aging
Starvation
Decreases in throughput
Context Switch overhead
_algorithm executes the shortest job first that has entered the queue of jobs.
FIFO
SJF
Round Robin
LIFO
What is a long-term Schedular?
it selects which process has to be brought into the ready queue
it selects which process has to be executed next and allocates cpu
it selects which process to remove from memory by swapping
it selects which process has to be brought into the blocked process
The schedular which determines when processes are to be suspended and removed
short-term schedular
long-term schedular
medium-term schedular
job schedular
which of the following technique is used for increasing the priority of a waiting process
Revocation
Aging
Relocation
Swapping
context switching never takes place in
Round Robin scheduling
preemptive scheduling
FCFS scheduling
premptive shortest job first scheduling
which one of the following cpu scheduling algorithm leads to starvation problem.
FIFO
Round Robin
SJF
preemptive
the process that are residing in main memory and are ready and waiting to execute are kept on a list called
job Queue
Ready queue
Execution queue
process queue
In unix traditional scheduling_
a cpu-bound process is given higher priority than an I/O bound process
an I/O bound process is given higher priority than a cpu -bound process
both cpu-bound & I/O-bound process are given equal priority
it depends on the current load on the system
process are executed on the sequence they arrive if_rule sequence the jobs
Earliest due data
First come First served
Slack time remaining
Critical Ratio
The number of process completed per unit time is known as_
Output
Efficiency
Throughput
capacity
_schedular determine which programs are admitted to the system for processing
Daisy chaining
long-term
DMA
Input/Output
The time taken by the dispatcher to stop one process and start another running is known as_
Dispatch latency
Turn around Time
Waiting time
Response time
The degree of multiprogramming controlled by _ schedular?
Long term
Short term
Medium term
Very short term
The list of process waiting for a particular I/O devices is called a_
Device queue
Ready
Job
I/O
The shortest job first scheduling algorithm is probably_
Optimal
Easy
Average
Difficult
Which of the following schedular is invoked only once when a job is to be executed?
Short term schedular
long term schedular
short term schedular ,long term schedular and medium term schedular
medium term schedular
First-in-First-out (FIFO)Scheduling is
Non preemptive scheduling
preemptive scheduling
fair share scheduling
Deadline scheduling
The interval form the time of submission of a process to the time of completion is termed as_
Waiting time
Response time
Turn around time
Throughput
An SJF algorithm is simply a priority algorithm where the priority is_
the predicted next cpu burst
the inverse of the predicted next cpu burst
the current cpu burst
anything the user wants
