OS Important Questions
OS Important Questions
OS Important Questions
UNIT-I
1. Explain in detail about the role of operating system as a resource manager.
3. List out the types of operating systems? Explain about Batch OS & Time-sharing OS?
8. Explain OS structure.
4. What is a kernel?
UNIT-II
1. Discuss about various process operation?
2. Discuss the following: process, process state, process control block, and process scheduling?
4. Describe process scheduling? Explain the various levels of scheduling & scheduling criteria.
6. Discuss the following? a. CPU-I/O burst cycle b. CPU schedule c. Pre-emptive and non-preemptive
scheduling d. Dispatcher
7. Explain the issues that may rise in multi-threading programming. Discuss about each in detail?
8. Discuss the following CPU scheduling algorithms a. Round-Robin b. Multilevel- queue scheduling c.
Multi-level feedback queue scheduling
9. A scheduling mechanism should consider various scheduling criteria to realize the scheduling
objectives? List out all the criteria.
10. Suppose the following jobs arrive for processing at the times indicated, each job will run
1 0 8
2 2 4
3 1 1
Give Gantt chart illustrating the execution of these jobs using the non pre-emptive FCFS and SJF
scheduling algorithms. Compute the average turnaround time and average waiting time of each job for
above algorithms.
11 Consider the following set of processes with the length of the CPU burst time given in milliseconds
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
The processes are assumed to have arrived in the order p1, p2, p3, p4, p5 all at time 0. a. Draw four
Gantt charts illustrating the execution of these processes using FCFS, SJF, a non pre-emptive priority
b. What is the turnaround time of each process for each of the scheduling algorithms in part?
c. What is the waiting time of each process for each of the scheduling algorithms in part? Which of the
schedules in part a results in the minimal average waiting time?
12 Explain Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
13 Given the following information about jobs: Process CPU Burst Time Arrival time Priority
1 8 0 3
2 4 0 2
3 6 0 1
4 1 0 4
All jobs arrive at time 0(but in the order 1, 2, 3&4).Draw charts and calculate the average time to
complete (turn-around time) using the following scheduling algorithms: FCFS, SJF, Priority scheduling.
15. Explain about multilevel queue and multi level feedback queue scheduling.
17. Explain about message passing and shared memory in inter process communication.
19. What is Deadlock? Explain the necessary conditions for Deadlock (or) Deadlock characterization.
22. Describe resource-allocation graph? Explain how resource graph can be used for detecting
deadlocks?
4 Explain the use of job queues, ready queues and device queues?
13 State the real difficulty with the implementation of the SJF CPU scheduling algorithm?
14 State the factors on which the performance of the Round Robin CPU scheduling algorithm depends?
15 Name the algorithms used for foreground and background queue scheduling in a multilevel queue-
scheduling algorithm?