STUPIDSID
Solve any one question from Q.1(a,b) &Q.2
1(a)
Discuss batch and real time operating system with respect to process scheduling, memory management.
4 M
1(b)
Explain the concept of virtual machine with its implementation and benefits. Also explain examples of virtual machine.
6 M
2
Consider the following set of processess, with length of CPU burst time given in milliseconds.
Draw the Gant charts illustrating the execution of these processes using FCFS, SJF (Preemptive And non-pre-emptive) and Priority (Preemptive), Smaller number indicates higher priority. Calculate average waiting time and average turn arround time for all the above mentioned scheduling algorithms.
| Process | Arrival Time | Burst time | Priority |
| P1 | 0 | 8 | 3 |
| P2 | 1 | 1 | 1 |
| P3 | 2 | 3 | 2 |
| P4 | 3 | 2 | 3 |
| P5 | 4 | 6 | 4 |
Draw the Gant charts illustrating the execution of these processes using FCFS, SJF (Preemptive And non-pre-emptive) and Priority (Preemptive), Smaller number indicates higher priority. Calculate average waiting time and average turn arround time for all the above mentioned scheduling algorithms.
10 M
Solve any one question from Q.3 &Q.4(a,b)
3
Consider the following snapshot of the system,
Answer the following questions using Banker's Algortihm
a) What are the values of Need Matrix?
b) Is the systems in the safe mode? If yes, what is the safe sequence?
c) If a request from process PI arrives for (1,0,2) can the request be granted immediately?
| Allocation | Max | Available | |
| R1R2R3 | R1R2R3 | R1R2R3 | |
| P1 | 010 | 753 | 332 |
| P2 | 200 | 322 | |
| P3 | 302 | 902 | |
| P4 | 211 | 222 | |
| P5 | 002 | 433 |
Answer the following questions using Banker's Algortihm
a) What are the values of Need Matrix?
b) Is the systems in the safe mode? If yes, what is the safe sequence?
c) If a request from process PI arrives for (1,0,2) can the request be granted immediately?
10 M
4(a)
Explain with definition, concept of general and binary semaphore.
5 M
4(b)
Explain classical problem of synchronization in terns of Dining Philosopher problem.
5 M
Solve any one question from Q.5(a,b) &Q.6(a,b)
5(a)
Given memory partitions of 100k, 500k, 200k, 300k and 600k (in order), how would each of First-Fit, Best-Fit and Worst - Fit algorithms place processes of 212k, 417k, 112k, 426k? Which algorithm makes the most efficeint use of memory?
8 M
5(b)
What are the steps in-handling page fault? Explain with suitable diadgram.
10 M
6(a)
Explain the concept of Demand Paging with neat diagram.
8 M
6(b)
A process references pages in the following order.
5 4 2 4 6 5 3 6 2 3 2 4 5 2 6
Determine the number of page faults of FIFO, optimal and LRU page replacement algorithms for 3 page frames.
5 4 2 4 6 5 3 6 2 3 2 4 5 2 6
Determine the number of page faults of FIFO, optimal and LRU page replacement algorithms for 3 page frames.
10 M
Solve any one question from Q.7(a,b) & Q.8(a,b)
7(a)
For the given sequence of disk head in satisfying the entire request for FCFS,C-SCAN and SSTE algorithms. Initial head position is 120 and total number of cylinder in the disk is 200.
120, 130, 180, 150, 25, 10, 105, 90
120, 130, 180, 150, 25, 10, 105, 90
12 M
7(b)
Write a hshort note on I/O functions.
4 M
8(a)
Explain the concept of File Sharing.
8 M
8(b)
Explain disk free space management techniques.
8 M
Solve any one question from Q.9 & Q.10(a,b)
9
Write short notes on the following:
a) Ubuntu EDGE OS
ii) Embedded Linux
c) NACH OS
d) Android OS
a) Ubuntu EDGE OS
ii) Embedded Linux
c) NACH OS
d) Android OS
16 M
10(a)
Write steps for kernel complication necessary commands.
8 M
10(b)
Write a Pseudo code for simple kernel module and explain procedure for inserting a new module in existing kernel with all necessary steps.
8 M
More question papers from Operating System