SOMAIYA
VIDYAVIHAR
K J Somaiya Institute of Technology
An Autonomous Institute Permanently Affiliated to the University of Mumbai
DEPARTMENT OF INFORMATION TECHNOLOGY
Academic Year (2024-2025) Even SEM
Subject: Operating System (OS) Class: SY_ IT
SEM: IV
Sample Questions for Term Test I
Chapter 1
Fundamentals of Operating System
1. Describe characteristics of Modern Operating System.
2. Explain objectives and functions of Operating System.
3. What are the major functions carried out by an Operating System?
4. What is System Call? Explain any four System Calls.
5. Differentiate between Multiprogramming and Multiprocessing system?
6. Discuss the Difference between Monolithic and Micro kernel.
7. What are System Programs? Explain in brief various categories in which it is divided.
8. The services and functions provided by an operating system can be divided into two main
categories. Briefly describe the two categories and discuss how they differ?
9. What are major activities of an Operating System with regard to File Management and Memory
Management?
10. Briefly explain the different kernel architectures.
11. What is Context-Switch? Describe the actions taken by a kernel to context switch between
processes?
12. What is kernel? Discuss briefly the approaches of designing kernel?
Chapter 2
Process Management
13. Explain various states of process with the help of State Transition diagram.
14. Use following Scheduling algorithm to calculate ATAT &AWT for the following process:
a) FCFS
b) Pre-emptive and Non-Pre-emptive SJF
c) Round Robin
d) Pre-emptive Priority
Process Arrival Time Burst Time Priority
P1 0 8 3
P2 2 1 1
P3 2 3 2
P4 3 2 3
P5 4 6 4
15. What is thread? Explain User level threads and Kernel level threads?
16. Explain the Multithreading Models in detail.
17. Write a short note on Inter Process Communication (IPC).
18. Compare Pre-emptive and Non-Pre-emptive Scheduling?
19. What is Scheduling? Give different scheduling Policies and their comparison?
20. Explain with an example, which of the following algorithms could result in starvation.
a) FCFS
b) SJF
c) Round Robin
d) Priority
21. Consider the following set of processes, with the length of CPU burst given in milliseconds.
The processes are assumed to arrive in order P1, P2, P3, P4, and P5 all at time 0.
Process Burst Time Priority
P1 10 3
P2 1 1
Draw four Gantt charts P3 2 3 illustrating the execution of these
processes using FCFS, P4 1 4 SJF, a
P5 5 2
non-pre-emptive priority (a smaller priority number
implies a higher priority), and RR (quantum=1) scheduling. Calculate the average turnaround time
and average waiting time for each process?
22. Describe the actions taken by a kernel to context-switch between processes.
23. Which characteristics are used for comparison between different scheduling algorithms?
24. Explain the differences in how much the following scheduling algorithms discriminate in favor of
short processes:
a) FCFS
b) RR
c) Multilevel Feedback Queues
25. What resources are used when a thread is created? How do they differ from those when a process
is created?
26. Consider the following snapshot of the process to be executed. Draw the Gantt chart and
determine the average waiting time and average turnaround time for FCFS, SJF (pre-emptive), SJF
(non-Pre-emptive) and Round-Robin (quantum=2) scheduling algorithm?
Process Arrival Time Burst time
P1 0 7
P2 1 4
P3 3 3
P4 5 1
P5 7 5
27. Define Process scheduling along with type of schedulers in detail.
28. What is meant by Inter Process Communication (IPC)? Explain various models of it.
29. Describe the Process Control Block (PCB) in process management.
30. Summarize the steps in Context Switch Mechanism in operating system.
31. Distinguish between:
a) Program and Process.
b) Process and Thread.
c) User Level Thread and Kernel Level Thread.
d) Long Term, Short Term and Medium-Term Scheduler.
Chapter 3
Process Coordination
32. What is producer-consumer problem? How to solve with an example?
33. Describe how does Critical Section problem avoid race condition. What are the properties that
data item should possess to avoid critical section?
34. Show that Peterson’s algorithm satisfies the requirement of mechanisms to control access to a
critical section?
35. What do you mean by Critical Section? Using Semaphores, write a solution to reader-writer
problem that gives priority to readers?
36. Define the Critical Section. What are the requirements to solve the critical Section Problem?
37. Explain in brief the Race Condition in process synchronization.
38. Write a short note on “Semaphores”.
39. Describe in brief the Classical Problems of Synchronization. Explain any one type with the help
of one example.
40. Discuss the idea of message passing in process coordination.
Subject Incharge
Ms. Priyanka Deshmukh
