is a natural consequences of virtual memory system
can always be avoided by swapping
always occurs on large computers
can be caused by poor paging algorithms
For I/O bound jobs, in a uniprogramming process CPU can be in idle state for
10-20% of time
30-40% of time
60-70% of time
80-90% of time
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (the lowest priority). The scheduler re-evaluates the process priorities every T time units and decides the next process to schedule. Which one of the following is TRUE if the processes have no I/O operations and all arrive at time zero?
This algorithm is equivalent to the first-come-first-serve algorithm
This algorithm is equivalent to the round-robin algorithm
This algorithm is equivalent to the shortest-job-first algorithm
This algorithm is equivalent to the shortest-remaining-time-first algorithm
Process in which a program is written to respond to the button clicks, menu selections, and other actions of user in whatever order is termed as
The kernel of the operating system remains in the primary memory because .....
It is mostly called (used)
It manages all interrupt calls
It controls all operations in process
It is low level
There are 5 questions to complete.