Top 250+ Solved Operating System Advanced MCQ Questions Answer
Q. The portion of the process scheduler in an operating system that dispatches processes is concerned with
a. activating suspended I/O-bound processes
b. temporarily suspending processes when CPU load is too great
c. assigning ready processes to the CPU
d. all of the above
Q. Following is the correct definition of a valid process transition within an operating system
a. wake up : ready – running
b. dispatch: ready – running
c. block: ready – blocked
d. timer run out : ready – blocked
Q. I/O redirection
a. implies changing the name of a file
b. can be employed to use an exiting file as input file for a program
c. implies connection to programs through a pipe
d. none of the above
Q. When an interrupt occurs, an operating system
a. ignores the interrupt
b. always changes state of interrupted process after processing the interrupt
c. always resumes execution of interrupted process after processing the interrupt
d. may change state of interrupted process to blocked and schedule another process
Q. Thrashing
a. reduces page I/O
b. decreases the degree of multi- programming
c. implies excessive page I/O
d. improve the system performance
Q. Dirty bit for a page in a page table
a. helps avoid unnecessary writes on a paging device
b. helps maintain LRU information
c. allows only read on a page
d. none of the above
Q. A set of resources allocations such that the system can allocate resources to each process is some order, and still avoid a dead lock is called
a. unsafe state
b. safe state
c. Starvation
d. Greedy allocation
Q. A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a
a. first come first served
b. shortest seek time first
c. scan
d. None of these
Q. An attached processor
a. is used one only a few computers
b. causes all processor to function equally
c. is more difficult to implement than a co- processor
d. is used only for limited, specific functions
Q. Situations where two or more processes are reading or writing some shared data and the final result depends on who runs precisely which are called
a. race condition
b. critical sections
c. mutual exclusions
d. message passing
Q. Producer consumer problem can be solved using
a. Semaphores
b. Event counters
c. Monitors
d. All of the above
Q. The strategy of allowing process that are logically run able to be temporarily suspended is called
a. preemptive scheduling
b. non preemptive scheduling
c. shortest job first
d. first come first served
Q. Banker’s algorithm for resource allocation deals with
a. deadlock prevention
b. deadlock avoidance
c. deadlock recovery
d. mutual exclusion
Q. The dispatcher
a. actually schedules the tasks into the processor
b. is always very small and simple
c. puts tasks in wait
d. None of these