1) An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of process is ...
A. FCFS scheduling
B. Round robin scheduling algorithm
C. Shortest job first scheduling algorithm
D. Priority scheduling algorithm
2) The hardware mechanism that enables a device to notify the CPU is called .......
A. polling
B. interrupt
C. system call
D. none of the above
3) In the running state ........
A. only the process which has control of the processor is found
B. all the process waiting for I/O to be completed are found
C. all the processes waiting for the processor are found
D. none of the above
4) Which technique was introduced because a single job could keep both the CPU and the I/O devices busy?
A. Time sharing
B. Spooling
C. Preemptive scheduling
D. Multiprogramming
5) RMA works on static priorities while EDF algorithm works on ........
A. starvation
B. dynamic priorities
C. RR scheduling
D. FIFO scheduling
6) In the ........... method of data transfer, the participation of the processor is eliminated during data transfer.
A. buffering
B. caching
C. direct memory access
D. indirect memory access
7) Inter process communication can be done through ....
A. mails
B. messages
C. system calls
D. traps
8) RR scheduling is most suitable for ........
A. time shared OS
B. distributed OS
C. real time OS
D. an Ordinary OS
9) The aim of ......... transparency is to ensure that the movement of the object is handled automatically by the system in a user transparent manner.
A. location
B. name
B. migration
D. scaling
10) ........... is a memory management scheme that permits the physical address space of a process to be noncontiguous.
A. Paging
B. Segmentation
C. Virtual memory
D. main memory
11) Context switching is ........
A. part of spooling
B. part of polling
C. part of interrupt handling
D. part of paging
12) The normal functioning of an RPC may get disrupted due to ..........
A. call message gets lost
B. response message gets lost
C. callee node and caller node crashes and is restarted
D. All of the above
13) Mutual exclusion is referred as .......
A. if one process is in a critical region others are excluded
B. prevents deadlock
C. requires semaphore to implement
D. is found only in the windows NT operating system
14) IFO scheduling is ..........
A. preemptive
B. non-preemptive
C. deadline scheduling
D. RR scheduling
15) .......... deals with the process of deciding which process should be assigned to which processor.
A. Process migration
B. Processor allocation
C. threads
D. none of the above
16) Which scheduler controls the degree of multiprogramming?
A. Short term scheduler
B. Long term scheduler
C. Middle term scheduler
D. Pre term scheduler
17) Safe state is .......
A. deadlock state
B. non-deadlocked state
C. polling state
D. spooling state
18) ........ time is defined as the time period for which the execution of the process is stopped for transferring its information to the destination node.
A. turn around
B. latency
C. freezing
D. execution
19) The principle of locality of reference justifies the use of
A. virtual memory
B. interrupts
C. main memory
D. cache memory
20) For a multiple instances of resource type which algorithm is used .......
A. divide and conquer algorithm
B. banker's algorithm
C. partition algorithm
D. sorting algorithm
2) B. interrupt
3) A. only the process which has control of the processor is found
4) D. Multiprogramming
5) C. RR scheduling
6) C. direct memory access
7) B. messages
8) A. time shared OS
9) B. migration
10) A. Paging
11) C. part of interrupt handling
12) D. All of the above
13) A. if one process is in a critical region others are excluded
14) B. non-preemptive
15) B. Processor allocation
16) B. Long term scheduler
17) B. non-deadlocked state
18) C. freezing
19) D. cache memory
20) B. banker's algorithm
A. FCFS scheduling
B. Round robin scheduling algorithm
C. Shortest job first scheduling algorithm
D. Priority scheduling algorithm
2) The hardware mechanism that enables a device to notify the CPU is called .......
A. polling
B. interrupt
C. system call
D. none of the above
3) In the running state ........
A. only the process which has control of the processor is found
B. all the process waiting for I/O to be completed are found
C. all the processes waiting for the processor are found
D. none of the above
4) Which technique was introduced because a single job could keep both the CPU and the I/O devices busy?
A. Time sharing
B. Spooling
C. Preemptive scheduling
D. Multiprogramming
5) RMA works on static priorities while EDF algorithm works on ........
A. starvation
B. dynamic priorities
C. RR scheduling
D. FIFO scheduling
6) In the ........... method of data transfer, the participation of the processor is eliminated during data transfer.
A. buffering
B. caching
C. direct memory access
D. indirect memory access
7) Inter process communication can be done through ....
A. mails
B. messages
C. system calls
D. traps
8) RR scheduling is most suitable for ........
A. time shared OS
B. distributed OS
C. real time OS
D. an Ordinary OS
9) The aim of ......... transparency is to ensure that the movement of the object is handled automatically by the system in a user transparent manner.
A. location
B. name
B. migration
D. scaling
10) ........... is a memory management scheme that permits the physical address space of a process to be noncontiguous.
A. Paging
B. Segmentation
C. Virtual memory
D. main memory
11) Context switching is ........
A. part of spooling
B. part of polling
C. part of interrupt handling
D. part of paging
12) The normal functioning of an RPC may get disrupted due to ..........
A. call message gets lost
B. response message gets lost
C. callee node and caller node crashes and is restarted
D. All of the above
13) Mutual exclusion is referred as .......
A. if one process is in a critical region others are excluded
B. prevents deadlock
C. requires semaphore to implement
D. is found only in the windows NT operating system
14) IFO scheduling is ..........
A. preemptive
B. non-preemptive
C. deadline scheduling
D. RR scheduling
15) .......... deals with the process of deciding which process should be assigned to which processor.
A. Process migration
B. Processor allocation
C. threads
D. none of the above
16) Which scheduler controls the degree of multiprogramming?
A. Short term scheduler
B. Long term scheduler
C. Middle term scheduler
D. Pre term scheduler
17) Safe state is .......
A. deadlock state
B. non-deadlocked state
C. polling state
D. spooling state
18) ........ time is defined as the time period for which the execution of the process is stopped for transferring its information to the destination node.
A. turn around
B. latency
C. freezing
D. execution
19) The principle of locality of reference justifies the use of
A. virtual memory
B. interrupts
C. main memory
D. cache memory
20) For a multiple instances of resource type which algorithm is used .......
A. divide and conquer algorithm
B. banker's algorithm
C. partition algorithm
D. sorting algorithm
Answers:
1) C. Shortest job first scheduling algorithm2) B. interrupt
3) A. only the process which has control of the processor is found
4) D. Multiprogramming
5) C. RR scheduling
6) C. direct memory access
7) B. messages
8) A. time shared OS
9) B. migration
10) A. Paging
11) C. part of interrupt handling
12) D. All of the above
13) A. if one process is in a critical region others are excluded
14) B. non-preemptive
15) B. Processor allocation
16) B. Long term scheduler
17) B. non-deadlocked state
18) C. freezing
19) D. cache memory
20) B. banker's algorithm
Related Posts:
Solved MCQ of Operating System Principles set-2
Solved MCQ of Operating System Theory set-3
MCQ of Operating System with answer set-4
Solved MCQ of Operating System Set-5
Solved MCQ of Operating System Set-6
Solved MCQ Questions on Operating System set-7
Solved Objective Questions on Operating System set-8
Solved MCQ on Operating System Basis set-9
MCQ on Operating System Fundamental set-10
Interview Questions on Operating System Basis set-11
Post a Comment