Top 150+ Solved Advanced Operating System MCQ Questions Answer
Q. The interval from the time of submission of a process to the time of completion is termed as
a. waiting time
b. turnaround time
c. response time
d. throughput
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
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
Q. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a. all process
b. currently running process
c. parent process
d. init process
Q. Time quantum is defined in
a. shortest job scheduling algorithm
b. round robin scheduling algorithm
c. priority scheduling algorithm
d. multilevel queue 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
Q. In multilevel feedback scheduling algorithm
a. a process can move to a different classified ready queue
b. classification of ready queue is permanent
c. processes are not classified into groups
d. none of the mentioned
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
Q. What is the reusable resource?
a. that can be used by one process at a time and is not depleted by that use
b. that can be used by more than one process at a time
c. that can be shared between various threads
d. none of the mentioned
Q. Which of the following condition is required for deadlock to be possible?
a. mutual exclusion
b. a process may hold allocated resources while awaiting assignment of other resources
c. no resource can be forcibly removed from a process holding it
d. all of the mentioned
Q. A system is in the safe state if
a. the system can allocate resources to each process in some order and still avoid a deadlock
b. there exist a safe sequence
c. both (a) and (b)
d. none of the mentioned
Q. The circular wait condition can be prevented by
a. defining a linear ordering of resource types
b. using thread
c. using pipes
d. all of the mentioned
Q. Which one of the following is the deadlock avoidance algorithm?
a. banker’s algorithm
b. round-robin algorithm
c. elevator algorithm
d. karn’s algorithm
Q. What is the drawback of banker’s algorithm?
a. in advance processes rarely know that how much resource they will need
b. the number of processes changes as time progresses
c. resource once available can disappear
d. all of the mentioned
Q. For effective operating system, when to check for deadlock?
a. every time a resource request is made
b. at fixed time intervals
c. both (a) and (b)
d. none of the mentioned