Operating System Quiz



Operating System Quiz at csepedia.org

1. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as

A. Process Blocking
B. Context Switch
C. Time Sharing
D. None of the above


2. PCB of all running process reside in which of the following?

A. RAM
B. Hard Disk
C. Cache
D. None of these


3. Starvation can be avoided by which of the following statements.

1. By using shortest job first resource allocation policy.
2. By using first-come,first-serve resource allocation policy.

A. 1 only
B. 2 only
C. 1 and 2 only
D. None of these


4. Mutual exclusion problem occurs between

A. Two disjoint processes that do not interact
B. Processes that share resources
C. Processes that don not use the same resources
D. None of these


5. ______is a technique of temporarily removing inactive programs from the memory of computer system.

A. Swapping
B. Spooling
C. Semaphore
D. Scheduler


6. _______ is a technique of improving the priority of process waiting in Queue for CPU allocation

A. Starvation
B. Aging
C. Revocation
D. Relocation


7. A Scheduler which selects processes from secondary storage device is called

A. Short term scheduler
B. Long term scheduler
C. Medium term scheduler
D. Process scheduler


8. Banker's algorithm for resource allocation deals with

A. Deadlock Prevention
B. Deadlock Avoidance
C. Deadlock Recovery
D. Mutual Exclusion


9. ______is the time required by a sector to reach below read/write head.

A. Seek Time
B. Access time
C. Latency Time
D. None


10. A page fault means that we referenced a page

A. Outside the memory boundaries
B. With an incorrect I/O request
C. That was not in secondary storage
D. That was not in main memory


11. Round robin scheduling is essentially the preemptive version of

A. FIFO
B. Shortest Job First
C. Shortest Remaining
D. Longest Time First


12. The Simplest way to break a Deadlock is to

A. Preempt a resource
B. Rollback
C. Kill one of the processes
D. Lock one of the processes


13. Situations where two or more processes are reading or writing some shared datas and the final result depends on who runs precisely when are called

A. Race conditions
B. Critical sections
C. Mutual exclusions
D. Message passing


14. In the Blocked State

A. The process which is running is found
B. The processes waiting for I/O are found
C. The processes waiting for the processor are found
D. None of the above


15. The size of the virtual memory depends on the size of the

A. Data Bus
B. Address Bus
C. Main Memory
D. None of the above


16. A Bootstrap is

A. A Memory device
B. A device to support the computer
C. A small initialisation program to start up a computer
D. An error correction technique


17. The mechanism that bring a page into memory only when it is needed is called

A. Segmentation
B. Fragmentation
C. Demand Paging
D. Page Replacement


18. In order to allow only one process to enter its critical section, binary semaphore are initialized to

A. 0
B. 1
C. 2
D. 3


19. Which of the following is the solution of priority inversion problem?

A. Kill the higher priority process
B. Kill the lower priority process
C. Priority inheritance protocol
D. Semaphore


20. A Thread

A. Is a lightweight process where the context switching is low
B. Is a lightweight process where the context switching is high
C. Is used to speed up paging
D. None of the above




CSE Quiz

Algorithms




Database Management




C++ Quiz 1

C++ Quiz 2




Digital Electronics





Data Structures




Computer Architecture




Computer Network




HTML





Automata Theory




Operating System