Operating System Concepts Quiz

The solution to the reader-writer problem could produce a situation called "First reader-writer" that leads to:

• The reader process never read.

• The reader process never writes.

• The writer process never read.

• The writer process never writes.

If process Pi is executing in its critical section, then no other processes can be executing in their critical sections.

• Race condition

• Bounded Waiting

• Mutual Exclusion

• Progress

In paging, address generated by CPU divided into _.

• Logical and physical addresses.

• Frame numbers.

• Page number and page offset.

• Page table.

If there are n processes in the ready queue and the time quantum is q, then each process gets _ of the CPU time in chunks of at most q time units at once.

• 1-n

• 1+n

• 1 / n

• 1*n

can result in race conditions when data are shared among several processes.

• SJF scheduling

• Preemptive scheduling

• None Preemptive scheduling

• FCFS scheduling

The first reader in reader-writer problem will first:

• Use the writing semaphore to ensure no write will modify the shared data.

• Read the data.

• Allow other processes to read.

• Allow other processes to write.

-In 1/0 operations, the role of the 1/0 controller is to transfer data from the device to the _.

• Registers

• I/O Driver

• CPU

• Local Buffer

Suppose a computer system has 3 resource types (X, Y, and Z) and 5 processes (P1, P2, P3, P4, and P5). The current state of available resources and the maximum claim of each process are as follows:

Available Resources:

X Y Z

3 1 2

Maximum Claim of Processes:

X Y Z

P 1 : 4 2 1

P 2 : 1 3 2

P 3 : 2 1 4

P 4 : 3 2 2

P 5 : 5 1 3

If a request from Process P4 arrives with a request vector (1, 1, 1), can the Banker's algorithm grant the request and still avoid a deadlock?

• No, granting the request would lead to a deadlock.

• Insufficient information to determine.

• Yes, the request can be granted without leading to a deadlock.

• There is a possibility of a deadlock.

- What state does a newly created process enter before it begins executing?

• Terminated

• Waiting

• Ready

• Running

When the allocated memory slightly larger than requested memory and it is not being used, this called:

• Paging.

• Memory protection.

• External Fragmentation.

• Internal Fragmentation.