Operating System MCQs

A. High speed devices(disks and communications network)
B. Low speed devices
C. Utilizing cpu cycles
D. All of the mentioned

A. The cpu uses polling to watch the control bit constantly, looping to see if a device is ready
B. The cpu writes one data byte to the data register and sets a bit in control register to show that a byte is available
C. The cpu receives an interrupt when the device is ready for the next byte
D. The cpu runs a user written code and does accordingly

A. The cpu uses polling to watch the control bit constantly, looping to see if a device is ready
B. The cpu writes one data byte to the data register and sets a bit in control register to show that a byte is available
C. The cpu receives an interrupt when the device is ready for the next byte
D. The cpu runs a user written code and does accordingly

A. The cpu uses polling to watch the control bit constantly, looping to see if a device is ready
B. The cpu writes one data byte to the data register and sets a bit in control register to show that a byte is available
C. The cpu receives an interrupt when the device is ready for the next byte
D. The cpu runs a user written code and does accordingly

A. Bottom layer(0) is the user interface
B. Highest layer(n) is the user interface
C. Bottom layer(n) is the hardware
D. Highest layer(n) is the hardware

A. Sending signals to cpu through a system bus
B. Executing a special program called interrupt program
C. Executing a special program called system program
D. Executing a special operation called system call

A. Saving the current state of the system
B. Loading the interrupt handling code and executing it
C. Once done handling, bringing back the system to the original state it was before the interrupt occurred
D. All of the mentioned

A. Non-preemptive scheduling
B. Preemptive scheduling
C. All of the mentioned
D. None of the mentioned

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. Are very appropriate for very large computers
B. Use minimal resources
C. Use many resources
D. All of the mentioned