Operating Systems MCQs (Set-3)

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

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

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

How is turnaround time calculated?

A Arrival minus completion
B First run minus arrival
C Completion minus arrival
D Burst minus response

Response time measures the interval from arrival until what?

A Final completion
B Last I/O request
C Process creation
D First 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

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

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

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

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

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

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

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

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

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

Heavy repeated page faults with little useful progress indicate what?

A Deadlock
B Starvation
C Fragmentation
D Thrashing

Which page set approximates a process’s recent memory locality?

A Working set
B Ready set
C Free list
D Run queue

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

Directory entries typically associate each filename with what?

A A CPU register
B A page offset
C An inode number
D A process state

Following a crash, what is journaling intended to support?

A CPU scheduling
B Page translation
C Thread creation
D Filesystem recovery

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

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

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

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

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