How to use the Operating System MCQ Quiz
- 1. Pick the lengthChoose 10 Operating System questions or all 21, with shuffle on or off.
- 2. Answer each questionTap an option to see at once if it is right, plus a short Operating System explanation.
- 3. See your scoreFinish to get your Operating System score and a review of all your answers.
What this quiz covers
Operating systems is one of the three CS subjects (with DBMS and networks) that placement tests rely on. This quiz covers:
- Processes and threads: the kernel, PCB, context switches, fork(), and zombie processes.
- CPU scheduling: FCFS and the convoy effect, Round Robin, and aging to stop starvation.
- Synchronisation: semaphores and the critical section requirements.
- Deadlock: the four necessary conditions and the Banker's algorithm.
- Memory: paging, page faults, thrashing, virtual memory, fragmentation, and FIFO, LRU and optimal page replacement with Belady's anomaly.
Worked example and how to use it
Example: Which is not a necessary condition for deadlock? The answer is preemption. The four conditions are mutual exclusion, hold and wait, no preemption, and circular wait. All four must hold at once for a deadlock to happen, so breaking any one of them prevents it. Allowing the OS to take resources away (preemption) breaks the third condition.
Scheduling questions often need numbers too. Practise them in the CPU scheduling calculator, which works out waiting and turnaround times and draws the Gantt chart for FCFS, SJF, SRTF, Priority and Round Robin.
- Remember: threads share their process's memory; processes do not share memory by default.
- Belady's anomaly only happens with FIFO, where more frames can mean more page faults.
- Optimal page replacement cannot be built in practice because it needs to know the future, so it is used as a benchmark.
Frequently asked questions
Does it include numerical scheduling questions?
The quiz is conceptual. Use the CPU scheduling calculator for numerical practice.
Is it based on Linux or Windows?
The concepts apply to all operating systems. fork() and zombies are Unix and Linux examples.
How should I revise OS?
Learn processes and scheduling first, then synchronisation and deadlock, then memory. Each builds on the one before.
Is it free?
Yes, it is free. When you finish, we ask for your name and WhatsApp number once to show your score, and after that every Uncodemy tool opens freely.