Scribd
Upload
304 views8 pages

Viva Questions Operating System

This document contains questions related to operating system concepts like CPU scheduling algorithms, memory management techniques, synchronization methods, and deadlock handling. Some key topics covered are FCFS and SJF scheduling, page replacement algorithms, semaphores, monitors, critical section problem, resource allocation graph, Banker's algorithm, and deadlock avoidance/recovery strategies.

Uploaded by

Divyansh Juneja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
304 views8 pages

Viva Questions Operating System

This document contains questions related to operating system concepts like CPU scheduling algorithms, memory management techniques, synchronization methods, and deadlock handling. Some key topics covered are FCFS and SJF scheduling, page replacement algorithms, semaphores, monitors, critical section problem, resource allocation graph, Banker's algorithm, and deadlock avoidance/recovery strategies.

Uploaded by

Divyansh Juneja
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Viva - Questions:

1. What is CPU utilization?

2. What are the different job scheduling in operating systems?

3. Which scheduling algorithm allocates the CPU first to the process that requests the
CPU first?

4. The FCFS algorithm is particularly troublesome for ____________

5. 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
Viva - Questions:
1. What is real difficulty with SJF in short term scheduling?

2. Preemptive Shortest Job First scheduling is sometimes called ___________

3. Which scheduling algorithms give minimum average waiting time?

4. State true or false: Scheduling is allowing a job to use the processor?

5. What do you mean by Average turnaround time and average waiting time.
Viva - Questions:
1. In priority scheduling algorithm, when a process arrives at the ready queue, its
priority is compared with the priority of which process.

2. What is starvation?

3. What is aging?

4. What are the factors for assigning priority to the process?

5. If two processes come on same time, on what criteria will process be chosen for
processing?
Viva - Questions:
1. What do you mean by Time Slice?

2. Time quantum is defined in which scheduling algorithm?

3. What is the limitation of Round Robin Scheduling Algorithm?

4. What are the factors that affect Round Robin Scheduling Algorithm?

5. Round robin scheduling falls under the category of which scheduling Non preemptive
scheduling or Preemptive scheduling.
Viva - Questions:
1. Define Demand Paging, Page fault interrupt, and Thrashing?

2. Under what circumstances do page faults occur? Describe the actions taken by the
operating system when a page fault occurs?

3. What is the cause of thrashing? How does the system detect thrashing? Once it detects
thrashing, what can the system do to eliminate this problem?

4. What is a page and what is a frame. How are the two related?

5. What do you mean by Belady’s anomaly

6. Compare LRU, FIFO and Optimal page replacement algorithm.


Viva - Questions:
1. Difference between Logical and Physical Address Space?

2. Describe first-fit, best-fit strategies and worst fit strategies for disk space allocation,
with their merits and demerits.

3. What is the impact of fixed partitioning on fragmentation?

4. In fixed sized partition, the degree of multi programming is bounded by __________

5. The first fit, best fit and worst fit are strategies to select a _____________
Viva - Questions:
1. Define the critical section problem and explain the necessary characteristics of a correct
solution.

2. What do understand by Race Condition?

3. Define semaphore and its limitations.

4. Define monitor.

5. What are classical problems of process synchronization?


Viva - Questions:
1. What necessary conditions can lead to a deadlock situation in a system?

2. What factors determine whether a detection-algorithm must be utilized in a


deadlock avoidance system?

3. What is a Safe State and its’ use in deadlock avoidance?

4. What are the Methods for Handling Deadlocks?

5. What is resource allocation graph?

6. What are the deadlock avoidance algorithms?

7. Recovery from Deadlock?

8. When does deadlock happen? How does Banker’s algorithm avoid the deadlock
condition?

You might also like