Basic Operating System MCQ
Basic Operating System MCQ
21. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
- Time-sharing
- SPOOLing
- Preemptive scheduling
- Multiprogramming
22. A critical region
- is a piece of code which only one process executes at a time
- is a region prone to deadlock
- is a piece of code which only a finite number of processes execute
- is found only in Windows NT operation system
23. The mechanism that bring a page into memory only when it is needed is called _____________
- Segmentation
- Fragmentation
- Demand Paging
- Page Replacement
24. PCB =
- Program Control Block
- Process Control Block
- Process Communication Block
- None of the above
25. FIFO scheduling is ________.
- Preemptive Scheduling
- Non Preemptive Scheduling
- Deadline Scheduling
- Fair share scheduling
26. Switching the CPU to another Process requires to save state of the old process and loading new process state is called as __________.
- Process Blocking
- Context Switch
- Time Sharing
- None of the above
27. Which directory implementation is used in most Operating System?
- Single level directory structure
- Two level directory structure
- Tree directory structure
- Acyclic directory structure
28. The Banker¿s algorithm is used
- to prevent deadlock in operating systems
- to detect deadlock in operating systems
- to rectify a deadlocked state
- none of the above
29. A thread
- is a lightweight process where the context switching is low
- is a lightweight process where the context swithching is high
- is used to speed up paging
- none of the above
30. ______ is a high level abstraction over Semaphore
- Shared memory
- Message passing
- Monitor
- Mutual exclusion