BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT

Avalahalli, Doddaballapur Main Road, Bengaluru - 560064

Information Science & Engineering

OPERATING SYSTEMS (BCS303)

Module-1
1. Draw the abstract view of the components of a computer system and explain user and
system view.

2. Discuss the organization and interaction of components in modern computer system with a
neat diagram.

3. Illustrate with neat diagram, the I/O operation carried out in general purpose computer
system with the help of device controllers.

4. Differentiate between single processor, multi-processor and cluster systems.

5. Differentiate between symmetric and asymmetric multi-process systems.

6. Illustrate time-sharing and interactive computing systems for concurrent execution of

multiple programs.

7. What is the need for transition from user mode to kernel mode operation (Dual mode
operation) in computer systems.

8. What are the five major activities of an operating system in regard to process
management?(July 2019,July 2016,Jan 2015)

9. Discuss the mechanism the operating system adopts to ensure protection and security in
multi-user environment.

10. Describe Real-Time systems, and how it different from general purpose computer systems.

11. Illustrate different computing environments available in the market.

12. Define the essential properties of the following types of operating systems:
a. Batch
b. Interactive
c. Time sharing
d. Real time
e. Network
f. Distributed (July 2016,Jan 2014,Jan 2013,June 2012)

13. What are the three main purposes of an operating system? (July 2019,Jan 2010)

14. List five services provided by an operating system.(Jan 2019,Jan 2018,July 2014,July
2013,Jan 2010,June 2010)

15. What is the main advantage of multi-programming? Differences between Multi-

programming, Multi-tasking, Multi-process systems.(July 2017,Jan 2019,Jan 2017,July
2014,July 2011)
 BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT
Avalahalli, Doddaballapur Main Road, Bengaluru - 560064
16. What is the main advantage of the layered approach to operating system design?(Jan
2019,Jan 2014).

17. Dual Mode operation of OS is responsible for the management of processes and avoiding
any system crashes. Infer the need for transition from user mode to kernel mode operation
(Dual mode operation) in computer systems.

18. Discuss different system calls that are related to process control.

19. Discuss different communication models of inter-process communication.

20. Illustrate categories and benefits of different system programs that are supplied with
operating system.

21. Define SYSGEN, what are its role in operating system generation.

22. What is booting, Discuss the sequence of steps followed in booting a computer system.

23. What are the main differences between operating systems for mainframe computers and
personal computers?

24. What are the differences between a trap and an interrupt? What is the use of each
function?(June 2010).

25. What are the three major activities of an operating system in regard to secondary-storage
management?(Jan 2015).

26. What is the main advantage for an operating-system designer of using a virtual-machine
architecture? What is the main advantage for a user? Also give example.(Jan 2018,July
2019,Jan 2017,July 2016,Jan 2014,July 2013,Jan 2013,July 2011).

27. Interpret in what ways micro kernel approach is similar and differ from the layered
approach with neat diagram.
 BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT
Avalahalli, Doddaballapur Main Road, Bengaluru - 560064

Module-2
1. Describe the differences among short-term, medium-term, and long-term scheduling.(July
2013,Jan 2010).

2. Describe the actions a kernel takes to context switch between processes.

3. Explain the process state transition diagram. (Jan 2019,Jan 2018,July 2019,Jan 2017,Jan
2013,June 2012,July 2011,Jan 2010).

4. Distinguish between fork() and exec() system call. Also discuss different system calls related to
process. (8 M)(Jan 2018).

5. Discuss the threading issues that come with multithreaded program (july 2019).

6. Calculate the average waiting time by drawing Gantt chart using FCFS, SRTF, RR(q=2ms)
algorithms. (July 2019)
Process Arrival Time Burst Time
P1 0 9
P2 1 4
P3 2 9
P4 3 5

7. Explain the Dining-Philosopher’s problem using monitors (July 2019).

8. Explain Multi-threading models and discuss the benefits of multithreaded programming

(jan 2019)(Jul 2018).

9. Consider the following set of process with CPU burst in (ms)

Process Arrival Time Burst Time
P1 0 6
P2 1 3
P3 2 1
P4 3 4
Calculate the waiting time and average turnaround time for the above process using FCFS,
SRT and RR(Q=1ms) scheduling algorithms (Jan 2019).

10. Consider the set of 5 processes whose arrival time and burst time are given below.
Process Id Arrival time Burst time
P1 3 1
P2 1 4
P3 4 2
P4 0 6
P5 2 3

Draw the Gantt chart and apply FCFS and Shortest Remaining Time First (SRTF) CPU scheduling
policy to find the average waiting time and average turn-around time.
 BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT
Avalahalli, Doddaballapur Main Road, Bengaluru - 560064
11. Consider the following set of processes given in table (July 2018)
Process Arrival Time Burst Time Priority
(m sec) (m sec)
P1 0 10 4

P2 3 5 2
P3 3 6 6

P4 5 4 3

Consider larger number as highest priority. Calculate avg waiting time and turnaround time
and draw Gantt chart for preemptive priority scheduling and preemptive SJF scheduling.

12. Consider the set of 5 processes whose arrival time and burst time are given below.

Process Id Burst time Priority

P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2

Draw the Gantt chart and apply Round Robin (Time Quantum =1ms) and non-preemptive
priority CPU scheduling policy to calculate the average waiting time and average turn-around time.

13. Explain Multiprocessor scheduling (Jul 2018).

14. Consider the following set of process with CPU burst in (ms).
Process Arrival Time Burst Time

15. P1 16. 0 17. 6

18. P2 19. 2 20. 3

21. P3 22. 4 23. 3

24. P4 25. 5 26. 5

Calculate the waiting time and average turnaround time for the above process using FCFS,
SRTF and RR(Q=1ms) scheduling algorithms (Jan 2018).

15. Consider the following set of process with CPU burst in (ms)
Proc Burst Priority
ess Time
P1 10 3
P2 1 1
P3 2 3
P4 1 4
P5 5 2
Calculate the waiting time and average turnaround time for the above process using FCFS,
SRTF and RR(Q=1ms) scheduling algorithms (Jul 2017).
 BMS INSTITUTE OF TECHNOLOGY AND MANAGEMENT
Avalahalli, Doddaballapur Main Road, Bengaluru - 560064
16. What are two differences between user-level threads and kernel-level threads?

17. Describe the actions taken by a kernel to context switch between kernel-level threads.

18. What resources are used when a thread is created? How do they differ from those used when a
process is created?

19. Define the difference between pre-emptive and non-pre-emptive scheduling

20. Consider the following set of processes, with the length of the CPU-burst time given in
milliseconds:
Process Burst Time Priority
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 (a smaller priority number implies a higher
priority), and RR (quantum = 1) scheduling.
b. What is the turnaround time of each process for each of the scheduling algorithms
in part a?
c. What is the waiting time of each process for each of the scheduling algorithms in
part a?
d. Which of the schedules in part a results in the minimal average waiting time (over
all processes)?

21. Suppose that the following processes arrive for execution at the times indicated. Each process
will run the listed amount of time. In answering the questions, use non pre-emptive scheduling
and base all decisions on the information you have at the time the decision must be made.
Process Arrival Time Burst Time
P1 0.0 8
P2 0.4 4
P3 1.0 1

a. What is the average turnaround time for these processes with the FCFS scheduling algorithm?
b. What is the average turnaround time for these processes with the SJF scheduling
algorithm?

22. What is race condition? Explain how it is handled.