Top 550+ Solved Operating System (OS) MCQ Questions Answer

From 601 to 615 of 659

Q. In priority scheduling algorithm

a. cpu is allocated to the process with highest priority

b. cpu is allocated to the process with lowest priority

c. equal priority processes can not be scheduled

d. none of the mentioned

  • a. cpu is allocated to the process with highest priority

Q. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

a. first-come, first-served scheduling

b. shortest job scheduling

c. priority scheduling

d. none of the mentioned

  • a. first-come, first-served scheduling

Q. Which algorithm is defined in Time quantum?

a. shortest job scheduling algorithm

b. round robin scheduling algorithm

c. priority scheduling algorithm

d. multilevel queue scheduling algorithm

  • b. round robin scheduling algorithm

Q. Process are classified into different groups in                          

a. shortest job scheduling algorithm

b. round robin scheduling algorithm

c. priority scheduling algorithm

d. multilevel queue scheduling algorithm

  • d. multilevel queue scheduling algorithm

Q. Which one of the following can not be scheduled by the kernel?

a. kernel level thread

b. user level thread

c. process

d. none of the mentioned

  • b. user level thread

Q. CPU scheduling is the basis of

a. multiprocessor systems

b. multiprogramming operating systems

c. larger memory sized systems

d. none of the mentioned

  • b. multiprogramming operating systems

Q. With multiprogramming              is used productively.

a. time

b. space

c. money

d. all of the mentioned

  • a. time

Q. What are the two steps of a process execution?

a. i/o & os burst

b. cpu & i/o burst

c. memory & i/o burst

d. os & memory burst

  • b. cpu & i/o burst

Q. An I/O bound program will typically have

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

  • c. many very short cpu bursts

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

a. blocked, short term

b. wait, long term

c. ready, short term

d. ready, long term

  • c. ready, short term

Q. In the following cases non – preemptive scheduling occurs?

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

  • b. when a process goes from the running state to the waiting state

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

a. process switch

b. task switch

c. context switch

d. all of the mentioned

  • d. all of the mentioned

Q. What is Dispatch latency?

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. the time to stop one process and start running another one

Q. Scheduling is done so as to                          

a. increase cpu utilization

b. decrease cpu utilization

c. keep the cpu more idle

d. none of the mentioned

  • a. increase cpu utilization
Subscribe Now

Get All Updates & News