BSCS Bachelor of Science in Computer Science: Operating Systems Concepts 2

Question 1

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

Accepted Answer

FIFO (First-In, First-Out)

Answer

FIFO is the classic algorithm known to exhibit Belady's anomaly, where increasing the number of frames can paradoxically increase page faults.

Question 2

In a system using the banker's algorithm, a process is granted a resource only if the resulting state is:

Accepted Answer

Safe

Answer

The banker's algorithm grants resources only when the resulting system state is safe, meaning there exists at least one sequence in which all processes can finish.

Question 3

What is the primary purpose of a Translation Lookaside Buffer (TLB) in virtual memory systems?

Accepted Answer

To cache recent virtual-to-physical address mappings

Answer

The TLB is a hardware cache that stores recent virtual-to-physical page number translations to speed up memory access.

Question 4

Which of the following is a characteristic of a monolithic kernel?

Accepted Answer

All OS services run in kernel space and share the same address space

Answer

A monolithic kernel runs all OS services—file systems, device drivers, scheduling—together in a single kernel address space.

Question 5

In the context of disk scheduling, what does LOOK differ from SCAN?

Accepted Answer

LOOK reverses direction at the last request rather than at the disk end

Answer

Unlike SCAN (which goes to the physical end of the disk), LOOK reverses direction at the last pending request in each sweep.

BSCS - Bachelor of Science in Computer Science Practice Test

BSCS - Bachelor of Science in Computer Science Practice Test

BSCS Bachelor of Science in Computer Science: Operating Systems Concepts 2