WorksheetsOperating systems II
Total questions: 10
Worksheet time: 5mins
In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of ____________
all process
currently running process
parent process
init process
Process is _______________
program in High level language kept on disk
contents of main memory
a program in execution
a job in secondary memory
the strategy of allowing processes that are logically runnable to be temporarily suspended is called
preemptive scheduling
non preemptive scheduling
shortest job first
first come first served
Fragmentation of the file system
occurs only if the file system is used improperly
can always be prevented
can be temporarily removed by compaction
is a characteristic of all file systems
The memory allocation scheme subject to "external" fragmentation is
segmentation
swapping
pure demand paging
multiple contiguous fixed partitions
When the process issues an I/O request __________
It is placed in an I/O queue
It is placed in a waiting queue
It is placed in the ready queue
It is placed in the Job queue
Which of the following condition is required for a deadlock to be possible?
mutual exclusion
a process may hold allocated resources while awaiting assignment of other resources
no resource can be forcibly removed from a process holding it
All mentioned
Which one of the following is the deadlock avoidance algorithm?
banker’s algorithm
round-robin algorithm
elevator algorithm
karn’s algorithm
Real time systems must have ____________
preemptive kernels
non preemptive kernels
preemptive kernels or non preemptive kernels
neither preemptive nor non preemptive kernels
Real time systems need to __________ the interrupt latency.
minimize
maximize
context switch
suspend
