MCQs / Computer Science / NSCT: Operating Systems
NSCT: Operating Systems MCQs — Computer Science 111 multiple-choice questions on NSCT: Operating Systems from Computer Science, each with the correct answer and, where available, a teacher's explanation. Read through them to revise the chapter, then practise the same questions one by one to test yourself.
1. With 4 frames (initially empty), how many page faults occur for the reference string 1, 2, 3, 4, 1, 2, 5, 1, 2, 3, 4, 5 using FIFO replacement? 6 10 12 8 Answer: B) 10
Explanation: Simulating FIFO gives 10 faults (FIFO 10, LRU 8, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
2. The Unix permission 754 gives the group: Read, write and execute Read and execute Read only Write only Answer: B) Read and execute
Explanation: 7 = rwx (owner), 5 = r-x (group), 4 = r-- (others). Lesson 9.4 · Operating Systems
Discuss this question
3. Processes arrive at time 0 with burst times P1 = 6, P2 = 3, P3 = 1 ms. What is the average waiting time under non-pre-emptive SJF? 1 ms 3.67 ms 1.67 ms 5 ms Answer: C) 1.67 ms
Explanation: Order by burst; waiting times [4, 1, 0] → average 1.67 ms. Lesson 9.2 · Operating Systems
Discuss this question
4. With 3 frames (initially empty), how many page faults occur for the reference string 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 using LRU replacement? 12 7 6 9 Answer: B) 7
Explanation: Simulating LRU gives 7 faults (FIFO 9, LRU 7, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
5. Processes arrive at time 0 in order with burst times P1 = 8, P2 = 4, P3 = 9, P4 = 5 ms. What is the average turnaround time under FCFS? 14 ms 16.75 ms 26 ms 10.25 ms Answer: B) 16.75 ms
Explanation: Turnaround = waiting + burst for each process; average them. Lesson 9.2 · Operating Systems
Discuss this question
6. A system has 16-bit logical addresses and 1 KB pages. How many entries are in a single-level page table? 32 128 64 65,536 Answer: C) 64
Explanation: 2^16 ÷ 1024 = 64 pages. Lesson 9.4 · Operating Systems
Discuss this question
7. With a page size of 1024 bytes, what are the page number and offset of logical address 5000? Page 5, offset 904 Page 4, offset 120 Page 4, offset 904 Page 904, offset 4 Answer: C) Page 4, offset 904
Explanation: 5000 ÷ 1024 = 4 remainder 904. Lesson 9.4 · Operating Systems
Discuss this question
8. The core part of an operating system that manages hardware resources is the: Compiler BIOS only Kernel Shell Answer: C) Kernel
Explanation: The kernel runs in privileged mode. Lesson 9.1 · Operating Systems
Discuss this question
9. DMA allows: Database encryption Devices to transfer data to memory without the CPU copying each byte Faster CPU clock Direct internet access Answer: B) Devices to transfer data to memory without the CPU copying each byte
Explanation: Direct Memory Access frees the CPU. Lesson 9.4 · Operating Systems
Discuss this question
10. Processes arrive at time 0 in order with burst times P1 = 6, P2 = 3, P3 = 1 ms. What is the average turnaround time under FCFS? 7 ms 10 ms 8.33 ms 5 ms Answer: C) 8.33 ms
Explanation: Turnaround = waiting + burst for each process; average them. Lesson 9.2 · Operating Systems
Discuss this question
11. Processes arrive at time 0 in order with burst times P1 = 5, P2 = 3, P3 = 8 ms. Using Round Robin with a quantum of 2 ms, what is the average waiting time? 4.33 ms 9 ms 7 ms 3.67 ms Answer: C) 7 ms
Explanation: Waiting times [7, 6, 8] → average 7 ms. Lesson 9.2 · Operating Systems
Discuss this question
12. With 3 frames (initially empty), how many page faults occur for the reference string 2, 3, 2, 1, 5, 2, 4, 5, 3, 2, 5, 2 using FIFO replacement? 9 6 12 7 Answer: A) 9
Explanation: Simulating FIFO gives 9 faults (FIFO 9, LRU 7, Optimal 6). Lesson 9.4 · Operating Systems
Discuss this question
13. Which scheduling algorithm serves processes strictly in arrival order? SJF FCFS Round Robin Priority Answer: B) FCFS
Explanation: First come, first served. Lesson 9.2 · Operating Systems
Discuss this question
14. In Unix, file metadata (owner, size, permissions, block pointers) is stored in an: PCB FAT entry only Inode TLB Answer: C) Inode
Explanation: Each file has an inode. Lesson 9.4 · Operating Systems
Discuss this question
15. A program requests a service from the OS kernel (e.g. reading a file) through a: Compiler directive Subroutine in user space only System call Interrupt vector only Answer: C) System call
Explanation: e.g. read(), write(), fork(). Lesson 9.1 · Operating Systems
Discuss this question
16. Processes arrive at time 0 with burst times P1 = 4, P2 = 7, P3 = 3, P4 = 2 ms. What is the average waiting time under non-pre-emptive SJF? 7.25 ms 4 ms 8 ms 6 ms Answer: B) 4 ms
Explanation: Order by burst; waiting times [5, 9, 2, 0] → average 4 ms. Lesson 9.2 · Operating Systems
Discuss this question
17. TLB lookup takes 20 ns, memory access 100 ns, and the TLB hit ratio is 98%. What is the effective memory access time? 120 ns 102 ns 220 ns 122 ns Answer: D) 122 ns
Explanation: EAT = 0.98×(20+100) + 0.02×(20+2×100) = 122 ns. Lesson 9.4 · Operating Systems
Discuss this question
18. In priority scheduling, low-priority processes may wait forever. This is: Deadlock Context switching Aging Starvation Answer: D) Starvation
Explanation: Aging gradually raises their priority. Lesson 9.2 · Operating Systems
Discuss this question
19. Turnaround time is: Time of first response Burst time − waiting time Quantum × number of processes Completion time − arrival time Answer: D) Completion time − arrival time
Explanation: It includes waiting and execution. Lesson 9.2 · Operating Systems
Discuss this question
20. Which symbolic permission string is equivalent to chmod 755? rwxrwxr-x rwxr-xr-x r-xr-xrwx rwxrwxrwx Answer: B) rwxr-xr-x
Explanation: Each digit maps to rwx bits: 755 → rwxr-xr-x. Lesson 9.4 · Operating Systems
Discuss this question
21. The data structure that stores a process's state, registers and PID is the: TLB Inode Page table Process Control Block (PCB) Answer: D) Process Control Block (PCB)
Explanation: The OS keeps one PCB per process. Lesson 9.1 · Operating Systems
Discuss this question
22. A process waiting for disk I/O to complete is in the: Ready state Terminated state Running state Waiting (blocked) state Answer: D) Waiting (blocked) state
Explanation: It returns to Ready when the I/O finishes. Lesson 9.1 · Operating Systems
Discuss this question
23. With a page size of 4096 bytes, what are the page number and offset of logical address 12345? Page 4, offset 57 Page 3, offset 4039 Page 3, offset 57 Page 57, offset 3 Answer: C) Page 3, offset 57
Explanation: 12345 ÷ 4096 = 3 remainder 57. Lesson 9.4 · Operating Systems
Discuss this question
24. A semaphore's wait (P) operation: Decrements the value and blocks if it becomes negative Always increments the value Kills the process Releases memory Answer: A) Decrements the value and blocks if it becomes negative
Explanation: signal (V) increments and may wake a waiting process. Lesson 9.3 · Operating Systems
Discuss this question
25. The hardware unit that translates logical addresses to physical addresses is the: ALU MMU NIC DMA controller Answer: B) MMU
Explanation: Memory Management Unit. Lesson 9.4 · Operating Systems
Discuss this question
Page 1 of 5 Next
Practise NSCT: Operating Systems MCQs
More Computer Science chapters