Unit-1

1 Define Operating system and explain services of OS.

2 Define operating system and explain different components of operating system.
3 Explain any two types of operating system
4 Explain multiprogramming operating system.
5 Explain any two components of operating system.
6 Explain time sharing operating system.
7 Explain real time operating system with its types.
8 Explain layered structure of operating system.
9 Explain microkernel based operating system.
10 Explain virtual machine os.
11 Explain system call with example.
12 List different types of system call
13 Explain user view and system view of operating system.
UNIT-2
14 Define Process. Explain process state transition diagram.
2 Define PCB and explain role of PCB.
3 Define thread and its types.
4 Explain operations on process.
5 Define threads and advantages of thread.
6 Explain different types of schedulers.
7 Explain queuing diagram.
8 Define following: Ready queue, Job queue, Device queue.

JOIN @PuneEngineers | Telegram

 9 Compare preemptive scheduling and non-preemptive scheduling.
10 Explain different scheduling criteria.
11 Define Throughput, CPU utilization, Response Time, Waiting Time, Turnaround Time.
12 Explain multilevel queue scheduling.
13 Explain multilevel feedback queue scheduling.
14 Describe inter process communication in brief.
15 Consider following set of processes executing on a uniprocessor system.
Process AT BT
P1 0 12
P2 1 11
P3 3 10
P4 5 7

P5 5 6
P6 7 3
P7 10 2
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram

16 Consider following set of processes executing on a uniprocessor system.
Process BT
P1 6
P2 5
P3 4
P4 2
P5 1
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.FCFS
2.SJF-Non Preemptive
3.Round Robin(Time Slice=2)

17 Consider following set of processes executing on a uniprocessor system.

Process AT BT
P1 0 5
P2 3 2
P3 1 3
P4 4 1
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram

18 Consider following set of processes executing on a uniprocessor system.
Process AT BT
P1 0 16
P2 0 10
P3 6 4
P4 7 6
P5 8 10
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.FCFS 2.Round Robin(Time Quantum=5)
19 Consider following set of processes executing on a uniprocessor system.
Process AT BT
P1 0 3
P2 2 6
P3 4 4
P4 7 2
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram

20 Consider following set of processes executing on a uniprocessor system.
Process BT
P1 6
P2 5
P3 4
P4 2
P5 1
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.FCFS
2.SJF-Non Preemptive
3.Round Robin(Time Slice=2)
21 Consider following jobs to be executed on a uniprocessor system.
Job AT BT
P1 0 15
P2 2 11
P3 3 10
P4 6 6
P5 10 1
Draw a Gantt chart and calculate average turnaround time and average waiting time for following
CPU scheduling algorithm.
1.SJF-Non Preemptive
2.SJF-Preemptive

JOIN @PuneEngineers | Telegram

 22 Consider the following set of process with length of the CPU burst given in ms:
Process Burst Priority
Time
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 Gantt charts that illustrates the execution of these processes using the following scheduling
algorithms: FCFS, SJF, Non preemptive priority.
b. What is turnaround time of each process for each of the scheduling algorithm?
c. What is waiting time of each process for each of the scheduling algorithm?

UNIT-3
1 Explain following terms: Race Condition, Critical Section, and Mutual Exclusion.
2 Why there is need of synchronization? What is critical section problem?
3 Which conditions must three requirements for critical section problem.
4 Explain Peterson’s solution for two process.
5 Short note on Locks and Test and Set, swap instruction.
6 Define Semaphore and its use.
7 Define deadlock, explain necessary conditions to occur deadlock.
JOIN @PuneEngineers | Telegram
 8 Solution using semaphore for producer consumer problem.
9 Discuss reader writer problem and solution using semaphore.
10 Discuss dinning philosopher’s problem and solution using semaphore.
11 Explain monitor concept in process synchronization.
12 Define deadlock, explain necessary conditions to occur deadlock.
13 Using an example, show how resource allocation graph can be used to detect in a system having only
one instance of each resource type.
14 Explain resource allocation graph. How is it used in detection of deadlock?
15 Explain deadlock prevention in brief.
16 Explain deadlock recovery methods.
17 Consider the following snapshot of a system
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 1 0 0 1 1 1 4 2 1
P1 1 0 0 1 1 6 5 0
P2 1 2 5 3 2 3 4 6
P3 0 5 3 1 0 5 4 1
P4 0 1 0 2 0 6 4 6
a) Calculate need matrix.
b) Is system in safe state?
c) Can a request from p1 arises for 0 3 1 0, can the request will immediately granted?

JOIN @PuneEngineers | Telegram

18 Consider a system with five processes and four resource types maximum instances of resource are
R=(6,4,4,2), for the current allocation state as shown in table, Is the system in safe state?

Process Allocation Max

R1 R2 R3 R4 R1 R2 R3 R4
P0 2 0 1 0 3 2 1 1
P1 1 1 0 0 1 2 0 2
P2 1 1 0 0 1 1 2 0
P3 1 0 1 0 3 2 1 0
P4 0 1 0 1 2 1 0 1
19 The operating system contains three resources. The number of instances of each resource type 7,7,10
from the following data:
Process Allocation Max
R1 R2 R3 R1 R2 R3
P1 2 2 3 3 6 8
P2 2 0 3 4 3 3
P3 1 2 4 3 4 4
a)Calculate the content of need matrix
b) Is current allocation in safe or unsafe? Why?
c) Can request made by process P1 (1,1,0) be granted?

JOIN @PuneEngineers | Telegram

20 Consider the following snapshot of a system
Process Allocation Max Available
A B C D A B C D A B C D
P0 0 0 1 1 0 0 1 1 1 5 3 0
P1 1 0 0 0 1 6 5 0
P2 1 2 5 4 2 2 5 6
P3 0 5 3 1 0 5 3 2
P4 0 0 1 3 0 5 1 5
a) Calculate need matrix.
b) Is system in safe state? write possible sequence for it if it is in safe state

21 The operating system contains three resources. The number of instances of each resource type
A=10,B=5,C=7 from the following data:
Process Allocation Max
A B C A B C
P0 0 1 0 7 5 3
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3
a)Calculate the content of need matrix.
b) Is current allocation in safe or unsafe? Why?

JOIN @PuneEngineers | Telegram

Unit 4
1 Explain the function of memory management in brief.
2 Explain first fit,best fit and worst fit with example.
What is dynamic storage allocation problem? Give its solution?
3 Give types of fragmentation and solution to it.
4 How do you differentiate paging with segmentation by giving explanation
on page and segment table?
5 Draw and explain address translation architecture of paging.
6 Define paging. Explain significance of valid and invalid bit in page table.
7 Define virtual memory. How it is implemented.
8 Explain demand paging.
9 Define page fault. Explain steps to handle page fault.
10 Why page replacement is required.
11 Explain trashing. Causes of thrashing.
12 Consider the following page reference string 2,3,2,1,5,2,4,5,3,2,5,2 for a memory with three frames.
How many page fault would occur for following page replacement algorithm? a)LRU b)Optimal

13 Consider the following page reference string 7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1 for a memory with
three frames. How many page fault would occur for following page replacement algorithm? a)FIFO
b)Optimal
14 Consider the following page reference string 4,7,6,1,7,6,1,2,7,2 for a memory with three frames. How
many page fault would occur for following page replacement algorithm?a)FIFO b) LRU c)Optimal

JOIN @PuneEngineers | Telegram

 15 Consider the following page reference string 0,1,2,3,0,1,2,3,0,1,2,3,4,5,6,7 for a memory with three
frames. How many page fault would occur for following page replacement algorithm? a)FIFO b) LRU
c)Optimal
16 What is dirty bit/dirty page.
17 What is TLB.
Unit 5
1 What is file? Explain the file attributes and operations on file.
2 What is directory. explain different operations on directory
3 Explain tree structure directory in detail.
4 Explain contiguous allocation of disk space in brief.
5 Describe disk formatting in detail.
6 Explain SSTF and SCAN disk scheduling algorithm.
7 Explain C-SCAN and C-LOOK disk scheduling algorithm.
8 Explain FIFO/FCFS disk scheduling algorithm.
9 Explain swap space management.
10 Explain free space management.
11 Explain different secondary storage allocation methods.
12 Explain different types of File.
13 Explain linked storage allocation.
14 Explain contiguous allocation and indexed allocation.

JOIN @PuneEngineers | Telegram