B CompE Bachelor of Computer Engineering Bachelor of Computer Engineering Operating System 2

Question 1

Which page replacement algorithm suffers from Belady's anomaly, where adding more frames can increase page faults?

Accepted Answer

FIFO

Answer

FIFO is the classic algorithm known to exhibit Belady's anomaly, where increasing physical frames can paradoxically raise the page fault count.

Question 2

In a Unix-like OS, which system call creates a new process that is an exact copy of the calling process?

Accepted Answer

fork()

Answer

fork() duplicates the calling process, giving the child an identical copy of the parent's address space, file descriptors, and registers.

Question 3

What is the term for the condition where a process holds one resource and waits for another held by a second process, which in turn waits for the first?

Accepted Answer

Deadlock

Answer

Deadlock occurs when two or more processes are each waiting for a resource held by another, forming a circular wait with no progress possible.

Question 4

Which scheduling metric measures the ratio of burst time to turnaround time, used in the HRRN algorithm?

Accepted Answer

Response ratio

Answer

HRRN selects the process with the highest response ratio = (waiting time + burst time) / burst time to prevent starvation.

Question 5

In virtual memory systems, what structure maps virtual page numbers to physical frame numbers?

Accepted Answer

Page table

Answer

The page table maintained per-process translates virtual page numbers into the corresponding physical frame numbers for address translation.

B CompE Bachelor of Computer Engineering Practice Test

B CompE Bachelor of Computer Engineering Practice Test

B CompE Bachelor of Computer Engineering Bachelor of Computer Engineering Operating System 2