Multiple choice questions on operating system set 3. This OS quiz contains 25 mcq on operating system. In this set, You will get mostly CPU scheduling mcqs. Process scheduling MCQs like FCFS, SJF, SRTF, RR, and priority scheduling algorithm mcq also included.
MCQ on Operating System Set 3
1. An optimal job scheduling scheme is _____?A). FCFS
B). RR
C). SJF
D). Priority Answer
View Answer
2. The FIFO algorithm _____?
A). Executes first the job that last entered the queue
B). Executes first the job that first entered the queue
C). Execute first the job that has been in the queue the longest
D). Executes first the job with the least processor needs
View Answer
3. Among CPU scheduling policies, First Come First Serve (FCFS) is attractive because _____?
A). It is simple to implement
B). It minimizes the total waiting time in the system
C). It is fair to all processes
D). It minimizes the average waiting time in the system
View Answer
4. _____ is the number of processes that are completed per unit time.
A). Response time
B). CPU utilization
C). Throughput
D). Turnaround time
View Answer
5. What type of scheduling is round-robin scheduling?
A). Non-linear data scheduling
B). Preemptive scheduling
C). Non-preemptive scheduling
D). Linear data scheduling
View Answer
6. A circular queue is the most appropriate data structure for _____ scheduling.
A). Round Robin
B). First Come First Serve
C). Shortest Job First
D). Multilevel Queue
View Answer
7. Turnaround time refers to the amount of time _____?
A). Needed to execute particular process
B). That CPU utilization is minimized
C). A process has been waiting in the ready queue
D). None of these
View Answer
8. _____ is the amount of time it takes from when a request was submitted until the first response is produced.
A). CPU utilization
B). Response time
C). Turnaround time
D). Throughput
View Answer
9. The threading model supported by Linux operating system is _____?
A). Many-to-many
B). One-to-many
C). Many-to-one
D). One-to-one
View Answer
10. Which of the following scheduling algorithms is preemptive scheduling?
A). Network Scheduling
B). FCFS Scheduling
C). SRTF Scheduling
D). SJF Scheduling
View Answer
11. Which of the following types of resources can create a deadlock?
A). Consumable
B). Reusable
C). Shared
D). All of the above
View Answer
12. In a system, necessary conditions to arise a deadlock situation if _____?
A). Any one of mutual exclusion, progress and bounded waiting occurs
B). Hold simultaneously mutual exclusion, hold-and-wait, non-preemption and circular wait
C). Resource-allocation graph has cycles
D). None of these
View Answer
13. One necessary condition for deadlock is _____ that states that at least one resource must be held in a non-sharable mode.
A). Mutual exclusion
B). Hold and wait
C). Circular wait
D). No preemption
View Answer
14. Which of the following is most often used by operating systems to handle deadlocks?
A). Use protocols to prevent or avoid deadlocks
B). Detect and recover from deadlocks
C). Pretend that deadlocks never occurred
D). None of these
View Answer
15. Which of the following "semaphore" can take the non-negative integer values?
A). Counting Semaphore
B). Binary Semaphore
C). Real Semaphore
D). All of the these
View Answer
16. Which of the following statement is true?
A). A safe state may lead to a deadlocked state
B). A safe state is a deadlocked state
C). An unsafe state may lead to a deadlocked state
D). None of these
View Answer
17. A deadlocked state occurs when two or more processes are waiting indefinitely for an event that can be _____?
A). Happened by one of the ready processes
B). Caused only by one of the waiting processes
C). Occurred only by an I/O event
D). Caused only by a circular wait
View Answer
18. A process must be holding at least one resource and waiting to acquire additional resources that are currently being held by other processes is called _____?
A). Circular wait
B). Starvation
C). Deadlock state
D). Hold and wait
View Answer
19. Which of the following statement is true for Banker's algorithm?
A). Can allocate multiple instances of each resource type
B). A deadlock prevention scheme
C). More efficient than the resource-allocation-graph scheme
D). Both A and C
View Answer
20. Which of the following scheduling algorithm is non-preemptive scheduling?
A). SRTF scheduling
B). Round-Robin scheduling
C). SJF scheduling
D). None of the above
View Answer
21. The Banker's Algorithm is an example of a technique for _____?
A). Deadlock avoidance
B). Deadlock prevention
C). Deadlock detection
D). Deadlock recovery
View Answer
22. If preemption is required to deal with deadlocks, then which statement must be addressed?
A). Preempt one process at a time until the deadlock cycle is eliminated
B). Preempt all deadlocked processes regardless of their cost and benefits
C). Select a victim process to be preempted with minimum cost, must roll back the process to safe state and restart, ensure starvation will not occur
D). Both A and B
View Answer
23. A cycle in the resource allocation graph _____ leads to a deadlock.
A). May not
B). Always
C). Must
D). None of the above
View Answer
24. Inter-process communication _____?
A). Is never necessary
B). Is required for all processes
C). Is usually done via disk drives
D). Allows processes to synchronize activity
View Answer
25. Consider the following three processes in the FCFS, What is the average waiting time?
| Process ID | Burst time | Arrival time |
|---|---|---|
| P1 | 3 | 3 |
| P2 | 6 | 6 |
| P3 | 9 | 9 |
A). 2
B). 3
C). 4
D). 5
View Answer
Read also>->>Operating System MCQs Set 1
Read also>->>Operating System MCQs Set 2
