OS 2nd quiz (Dr Arunima Jaiswal Ma'am)

Which scheduling criterion aims to maximize CPU utilization?

• A. CPU Efficiency

• B. Throughput

• C. Turnaround Time

• D. Response Time

What is the purpose of process scheduling in an operating system?

• a) To manage memory

• b) To manage I/O devices

• c) To manage processor utilization

• d) To manage network connections

Which operation involves changing the state of a process from running to ready?

• a) Fork

• b) Exec

• c) Wait

• d) Dispatch

An operating system uses Shortest Remaining Time first (SRT) process scheduling algorithm. Consider the arrival times and execution times for the following processes:

Process  Execution time  Arrival time

P1             20            0

P2             25            15

P3             10            30

P4             15            45

What is the total waiting time for process P2?

• (A) 5

• (B) 15

• (C) 40

• (D) 55

Thrashing occurs when

• (a)When a page fault occurs

• (b) Processes on system frequently access pages not memory

• (c) Processes on system are in running state

• (d) Processes on system are in waiting state

Which condition must be present for a deadlock to occur?

• A. Mutual Exclusion

• B. Hold and Wait

• C. Circular Wait

• D. Preemption

Which of the following conditions must hold true for a deadlock to occur?

• A) Mutual exclusion, hold and wait, no preemption, and circular wait.

• B) Mutual exclusion, hold and wait, preemption, and circular wait.

• C) Mutual inclusion, hold and wait, no preemption, and circular wait.

• D) Mutual exclusion, wait and hold, no preemption, and circular weight.

Which algorithm is used to prevent deadlocks in operating systems?

• A) Banker's algorithm

• B) Round-robin scheduling

• C) First Come First Serve (FCFS)

• D) Shortest Job First (SJF)

What is circular wait in the context of deadlock?

• A) A process waiting for a resource held by another process, which in turn is waiting for a resource held by the first process.

• B) A process holding a resource while waiting for another resource held by another process.

• C) A process waiting indefinitely for a resource to become available.

• D) A process releasing resources in a circular order.

Which page replacement algorithm suffers from Belady's anomaly?

• a) FIFO (First-In-First-Out)

• b) LRU (Least Recently Used)

• c) Optimal

• d) Clock