With a very large Round Robin quantum, which policy does scheduling resemble?
A Shortest Job First
B Priority Scheduling
C Shortest Remaining Time
D First Come, First Served
Answer: D. First Come, First Served. A very large quantum rarely preempts a running job, so Round Robin approaches FCFS.
In nonpreemptive scheduling, SJF selects the ready process with the shortest next CPU burst.
A Longest remaining burst
B Shortest next CPU burst
C Highest process ID
D Earliest completion estimate
Answer: B. Shortest next CPU burst. Shortest Job First chooses the ready job with the smallest next CPU burst.
When a new job has less remaining time, SRTF may do what?
A Preempt the running job
B Increase its time quantum
C Move it to disk
D Ignore the new job
Answer: A. Preempt the running job. Shortest Remaining Time First can preempt when a shorter remaining burst becomes available.
How is turnaround time calculated?
A Arrival minus completion
B First run minus arrival
C Completion minus arrival
D Burst minus response
Answer: C. Completion minus arrival. Turnaround time is the interval from arrival until completion.
Response time measures the interval from arrival until what?
A Final completion
B Last I/O request
C Process creation
D First CPU service
Answer: D. First CPU service. Response time ends when the process first receives CPU service.
During a process’s I/O wait, what can the CPU do?
A Run another ready process
B Wait for that process
C Clear its page table
D Restart the scheduler
Answer: A. Run another ready process. The scheduler can run another ready process while the first waits for I/O.
Which dispatcher action gives the CPU to a selected process?
A Change its file name
B Restore state and transfer control
C Allocate its disk blocks
D Compile its next instruction
Answer: B. Restore state and transfer control. The dispatcher restores execution state and transfers control to the chosen process.
Once the ready queue is empty, what may the CPU run?
A A blocked user process
B The last completed task
C An idle task
D A disk request
Answer: C. An idle task. An operating system can run an idle task when no process is ready.
For what purpose does a TLB keep recent entries?
A Cache address translations
B Store file contents
C Queue device requests
D Track process priorities
Answer: A. Cache address translations. A translation lookaside buffer caches recent virtual-to-physical address translations.
If a TLB lookup misses, what typically follows?
A An automatic process exit
B A page-table lookup
C A disk write
D A context switch
Answer: B. A page-table lookup. A TLB miss requires finding the translation elsewhere, commonly through a page-table walk.
For a 4 KiB page, how many low-order address bits form the offset?
A 10 bits
B 11 bits
C 12 bits
D 13 bits
Answer: C. 12 bits. A 4 KiB page contains 2^12 bytes, so the offset uses 12 bits.
Under demand paging, when can a page fault occur?
A A process changes priority
B A cache line is replaced
C A ready task is preempted
D A referenced page is absent
Answer: D. A referenced page is absent. A page fault occurs when a reference requires a page that is not currently resident.
On systems with a present bit, what does it indicate?
A Page residency in memory
B Process scheduling priority
C File access permission
D CPU burst length
Answer: A. Page residency in memory. The present bit indicates whether a page mapping is currently resident in physical memory.
After a page is written, what can its dirty bit record?
A Whether it was shared
B Whether it was modified
C Whether it was executable
D Whether it was swapped
Answer: B. Whether it was modified. A dirty bit records that a page has been modified and may need writing back.
Copy-on-write lets processes share pages until what happens?
A A timer interrupt occurs
B A file is renamed
C A process writes to one
D A thread enters a queue
Answer: C. A process writes to one. Copy-on-write delays copying a shared page until a process attempts to modify it.
Heavy repeated page faults with little useful progress indicate what?
A Deadlock
B Starvation
C Fragmentation
D Thrashing
Answer: D. Thrashing. Thrashing occurs when page-fault activity consumes excessive time and useful execution falls.
Which page set approximates a process’s recent memory locality?
A Working set
B Ready set
C Free list
D Run queue
Answer: A. Working set. The working set models pages recently used by a process.
Within a Unix-like file system, what does an inode commonly store?
A Filename and directory text
B Metadata and block pointers
C Only file contents
D Network route entries
Answer: B. Metadata and block pointers. An inode stores file metadata and references to data blocks, while names are held in directories.
Directory entries typically associate each filename with what?
A A CPU register
B A page offset
C An inode number
D A process state
Answer: C. An inode number. A directory maps names to filesystem objects, commonly using inode numbers.
Following a crash, what is journaling intended to support?
A CPU scheduling
B Page translation
C Thread creation
D Filesystem recovery
Answer: D. Filesystem recovery. A filesystem journal records updates so the filesystem can recover more consistently after a crash.
Unlike a hard link, what does a symbolic link contain?
A A target pathname
B A data block list
C A process identifier
D A permission mask
Answer: A. A target pathname. A symbolic link stores a pathname that identifies its target.
Under SCAN disk scheduling, the disk head does what?
A Serves newest requests first
B Sweeps then reverses
C Chooses random cylinders
D Stays at one cylinder
Answer: B. Sweeps then reverses. SCAN moves the head in one direction servicing requests, then reverses direction.
Compared with FCFS, SSTF selects the pending request with what?
A Oldest arrival time
B Smallest file size
C Shortest seek distance
D Highest cylinder number
Answer: C. Shortest seek distance. Shortest Seek Time First chooses the request nearest the current disk-head position.
While interrupt-driven I/O is underway, what may the CPU do?
A Poll every device continuously
B Wait until transfer ends
C Copy every byte itself
D Perform other work
Answer: D. Perform other work. Interrupt-driven I/O lets the CPU perform other work until the device signals completion.
During DMA, how is bulk data transferred?
A Without per-byte CPU handling
B Only through user registers
C By repeated process forks
D Through the page table
Answer: A. Without per-byte CPU handling. Direct Memory Access transfers data between a device and memory without per-byte CPU handling.