Operating system Quiz-1

1. Which of the following process scheduling algorithm may lead to starvation

• A. FIFO

• B. Round Robin

• C. Shortest Job Next

• D. None

Which of the following statements are true?

I. Shortest remaining time first scheduling may cause starvation

II. Preemptive scheduling may cause starvation

III. Round robin is better than FCFS in terms of response time

• (A) I only

• (B) I and III only

• (C) II and III only

• (D) I, II and III

3. 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

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

• a) Fork

• b) Exec

• c) Wait

• d) Dispatch

Virtual memory is

• (a) Large secondary memory

• (b) Large main memory

• (c) Illusion of large main memory

• (d) None of the above

6. 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

 What is a deadlock in operating systems?

• A) A situation where two or more processes are waiting indefinitely for resources held by each other.

• B) A situation where a process terminates unexpectedly due to an error.

• C) A situation where a process consumes too much memory and crashes.

• D) A situation where a process is stuck in an infinite loop.

What is the purpose of the Banker's algorithm?

• A) To allocate resources to processes in a way that prevents deadlock.

• B) To maximize CPU utilization in the system.

• C) To minimize the response time of processes

• D) To allocate resources randomly to processes.

What is the role of resource allocation graphs in deadlock detection?

• A) To represent the current state of resource allocation and requests.

• B) To allocate resources to processes.

• C) To prevent deadlocks from occurring.

• D) To terminate processes stuck in deadlock.