Operating Systems MCQs (Set-4)

Three jobs arrive together with CPU bursts of 6, 2, and 4 units. Under nonpreemptive SJF, what is average waiting time?

A 2.00 time units
B 3.00 time units
C 2.67 time units
D 4.00 time units

With 64 TLB entries and 4 KiB pages, what is the TLB reach?

A 256 KiB
B 64 KiB
C 128 KiB
D 512 KiB

Given 48-bit virtual addresses and 4 KiB pages, how many VPN bits are used?

A 12 bits
B 24 bits
C 32 bits
D 36 bits

Consider a 32-bit virtual address, 4 KiB pages, and 4-byte PTEs. What is a single-level page-table size?

A 1 MiB
B 8 MiB
C 16 MiB
D 4 MiB

What describes Belady’s anomaly in FIFO page replacement?

A More frames always reduce faults
B A page stays forever
C A hit becomes a fault
D More frames can increase faults

Which page-replacement policy has the stack inclusion property?

A FIFO
B Random
C LRU
D Clock

In the Clock algorithm, what happens when the inspected page has reference bit 1?

A Clear it and advance
B Replace it immediately
C Write it to disk
D Raise a page fault

For a writable MAP_SHARED mapping, updates are generally what?

A Hidden from peer mappings
B Discarded at process exit
C Private to one thread
D Shared across mappings

After fork uses copy-on-write, what happens if the child changes a private page?

A The parent sees the change
B Both share the modified page
C The parent keeps its page
D The child process exits

Once execve succeeds, what happens to the caller’s process ID?

A It becomes the parent’s ID
B It remains the same
C It is replaced by zero
D It becomes the program name

Suppose waitpid(child_pid, …, 0) waits for a child. What normally releases the wait?

A A TLB hit
B A page write
C A timer quantum
D Child termination

Why is a terminated child called a zombie before reaping?

A Parent has not reaped it
B Waiting for CPU time
C Still executing code
D Memory is being paged

Duplicated file descriptors from dup() share what?

A Separate file offsets
B Different open-file states
C One open-file description
D A common process ID

Extent-based allocation represents file data as what?

A Runs of adjacent blocks
B One block per filename
C A single index page
D A linked process queue

Under indexed allocation, how are a file’s data blocks located?

A By scanning all directories
B Through an index block
C By a TLB entry
D By process identifiers

Which RAID level stripes data without redundancy?

A RAID 1
B RAID 5
C RAID 6
D RAID 0

With a standard single-parity array, RAID 5 can tolerate how many disk failures?

A Two disks
B One disk
C No disks
D Three disks

RAID 6 uses dual parity to tolerate how many disk failures?

A One disk
B Three disks
C Four disks
D Two disks

Sparse address spaces benefit from hierarchical page tables because they can do what?

A Avoid unused lower-level tables
B Remove all page faults
C Eliminate virtual addresses
D Store files in registers

Each entry in an inverted page table usually represents what?

A A virtual page per process
B One physical frame
C A directory filename
D One disk request

For a 5.1 KiB region with 4 KiB pages, how many pages are required?

A One page
B Two pages
C Three pages
D Four pages

Unlike synchronous I/O, asynchronous I/O can return before what?

A The request is submitted
B The process is scheduled
C The operation completes
D The device is selected

What does a process’s writable MAP_PRIVATE change affect?

A Only its private mapping
B All processes’ mappings
C The original file directly
D Every physical frame

In a two-disk mirror using equal-size drives, what is usable capacity?

A About both drives combined
B About one drive’s capacity
C About half of one drive
D No data capacity

Following fork in a multithreaded program, which thread exists in the child?

A Every parent thread
B Only the first-created thread
C Only the calling thread
D No child threads