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
Answer: C. 2.67 time units. SJF runs bursts 2, 4, then 6; waits are 0, 2, and 6, averaging 8/3 = 2.67.
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
Answer: A. 256 KiB. TLB reach equals entries times page size: 64 Γ 4 KiB = 256 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
Answer: D. 36 bits. A 4 KiB page uses 12 offset bits, leaving 36 virtual page number 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
Answer: D. 4 MiB. The address space has 2^20 pages; at 4 bytes per entry, the table uses 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
Answer: D. More frames can increase faults. FIFO can incur more page faults after the number of frames increases.
Which page-replacement policy has the stack inclusion property?
A FIFO
B Random
C LRU
D Clock
Answer: C. LRU. LRU is a stack algorithm: its resident set with n frames is included in its set with n+1 frames.
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
Answer: A. Clear it and advance. Clock clears the reference bit and advances, giving the page another chance.
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
Answer: D. Shared across mappings. MAP_SHARED makes updates visible through shared mappings and carries them through to the mapped object.
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
Answer: C. The parent keeps its page. The child receives a private copy on write; the parent’s address space retains its original contents.
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
Answer: B. It remains the same. execve replaces the process image, but the calling process retains its PID.
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
Answer: D. Child termination. With options set to zero, waitpid waits for the specified child to terminate.
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
Answer: A. Parent has not reaped it. A zombie has terminated but remains in the process table until its parent collects its status.
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
Answer: C. One open-file description. dup() creates descriptors that refer to the same open-file description, including its file offset.
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
Answer: A. Runs of adjacent blocks. An extent records a contiguous run of file blocks, reducing per-block metadata.
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
Answer: B. Through an index block. Indexed allocation uses an index structure containing pointers to the file’s data blocks.
Which RAID level stripes data without redundancy?
A RAID 1
B RAID 5
C RAID 6
D RAID 0
Answer: D. RAID 0. RAID 0 stripes data across disks but provides no redundant copy or parity.
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
Answer: B. One disk. RAID 5 can recover from one failed disk while the remaining array is available.
RAID 6 uses dual parity to tolerate how many disk failures?
A One disk
B Three disks
C Four disks
D Two disks
Answer: D. Two disks. Dual parity allows recovery from two failed disks, assuming no further disk failure during rebuild.
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
Answer: A. Avoid unused lower-level tables. Hierarchical tables allocate lower-level page-table portions only where virtual-address regions are used.
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
Answer: B. One physical frame. An inverted page table has one entry for each physical frame, identifying its mapped page.
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
Answer: B. Two pages. The region spans more than one 4 KiB page but less than two, so two pages are needed.
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
Answer: C. The operation completes. An asynchronous I/O request can return control before the requested operation finishes.
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
Answer: A. Only its private mapping. Writes remain private to the mapping and are not propagated to the underlying file.
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
Answer: B. About one drive’s capacity. Mirroring stores duplicate data, so two equal drives provide about one drive’s usable 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
Answer: C. Only the calling thread. After fork in a multithreaded process, only the thread that called fork exists in the child.