Scribd
Upload
7 views

Os

The document contains questions about operating system concepts including the basic services provided by operating systems and different types of operating systems. It also contains questions about process scheduling algorithms, critical sections, mutual exclusion, race conditions, semaphores, and the dining philosophers problem.

Uploaded by

Rafiuzzaman Rupu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
7 views

Os

The document contains questions about operating system concepts including the basic services provided by operating systems and different types of operating systems. It also contains questions about process scheduling algorithms, critical sections, mutual exclusion, race conditions, semaphores, and the dining philosophers problem.

Uploaded by

Rafiuzzaman Rupu
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

1. Define operating system and list the basic services provided by operating system.

2. Differentiate among the following types of OS by defining their essential properties.


a) Time sharing system b) Parallel system c) Distributed system d) Real time system

Process Management:

1. Explain the following process scheduling algorithm a) Priority scheduling


b) Shortest job first scheduling

2. ) Consider following processes with length of CPU burst time in milliseconds


Process Burst time
P1 5
P2 10
P3 2
P4 1
All process arrived in order p1, p2, p3, p4 all time zero
a) Draw Gantt charts illustrating execution of these processes for SJF and round robin
(quantum=1)
b) Calculate waiting time for each process for each scheduling algorithm
c) Calculate average waiting time for each scheduling algorithm

2. What are critical sections? Why mutual exclusion required? Explain any 2 methods of
achieving mutual exclusion in detail.
3. Explain the following term related to IPC: a) Race condition b) critical region
4. Explain the terms related to IPC –a) Race condition b) critical section c)Mutual exclusion
d)Semaphores
5. Explain Peterson’s solution for achieving mutual exclusion
6. Explain semaphore in detail
7. What is semaphore? Discuss product-consumer problem with semaphore.
8. Write short note on: a) Dining philosopher problem b) System calls c) Monitors
9. Readers & writers problem.
10. Explain dinning philosopher problem & its solution.
11. What is dinning philosopher problem? Explain its solution with monitor.
12. 55. What is dinning philosopher problem? Explain its solution with semaphore. 56. Explain
readers & writers problem? Give its solution with semaphore. 57. Write short notes on: a)
Process states b) Critical section c) Race condition d) Starvation e) PCB f) Two level scheduling g)
Round robin scheduling

Deadlock:

1. Consider the following resource allocation graph and examine whether it


shows the deadlock or not? If Deadlock then describe the reason if not
then discover the finishing sequence of the processes and explain it.
b. Assume that there are 6 processes; P1, P2, P3, P4, P5, P6 and the system has 10 instances of
resources A, 12 instances of resources B, 12 instances of resources C and 10 instances of resource D. You
decide to execute these processes in such a way that deadlock will not occur. Now see the following
snapshot and solve the following questions

Max
Allo
catio
n
B C D A B C D
A
P1 2 3 0 0 3 5 4 1
P2 0 2 2 1 4 2 3 3
P3 2 0 2 0 2 5 5 4
P4 1 3 0 2 3 3 3 3
P5 3 0 3 4 3 4 6 4
P6 0 1 1 2 4 2 1 5

I. Identify the content of the Need of each process.

II. Identify the available resources at the initial state.

III. Identify the safe sequence of the above scenario.


IV. Suppose one request from process P2 for (1, 0, 1 and 5) resources arrives. Can the request be
granted immediately ensuring the system is safe? Explain your answer.

You might also like