STUPIDSID
Solve any question 4 Q1(a,b,c,d,e,)
1(a)
Explain various states of a process with the help of a state transition diagram.
5 M
1(b)
What is Producer Consumer problem? What is solution of example?
5 M
1(c)
Describe and design I-node structure of Unix operating system
5 M
1(d)
Disuss Critical Selection Proble? How to solve it?
5 M
1(e)
What is system call? Explain any four system calls.
5 M
2(a)
Use following Scheduling algorithmto calculate ATAT & AWT for the following process.
i) FCFS
ii) Pre-emptive and non-Pre-emptive priority
i) FCFS
ii) Pre-emptive and non-Pre-emptive priority
| Process | Arrival Time | Brust Time | Available |
| P1 | 0 | 8 | 3 |
| P2 | 1 | 1 | 1 |
| P3 | 2 | 3 | 2 |
| P4 | 3 | 2 | 3 |
| P5 | 4 | 6 | 4 |
10 M
2(b)
What is Thread? Explain User Level Threads and Kernel evel Threads.
10 M
3(a)
Consider the following snapshot of a system.
Using Banker's algorithm answer the following questions
i) How many resources are there of type (A, B,C)?
ii) What are the contents of the Need matrix?
iii) Is the system in a safe state? Why?
| Process | Max | Allocation | Available |
| A B C | A B C | A B C | |
| P0 | 0 0 1 | 0 0 1 | 1 5 2 |
| P1 | 1 7 5 | 1 0 0 | |
| P2 | 2 3 5 | 1 3 5 | |
| P3 | 0 6 5 | 0 6 3 |
i) How many resources are there of type (A, B,C)?
ii) What are the contents of the Need matrix?
iii) Is the system in a safe state? Why?
10 M
3(b)
State the necessary conditions for feedback . Explain deadlock prevention and avoidance Techniques.
10 M
4(a)
Claculate page faults and Hits using FIFO, Uru and Optimal Page replacement algorith for the following page sequence (2,
3,
5,
4,
2,
5,
7,
3,
8,
7). Assume Page frame size is 3.
3,
5,
4,
2,
5,
7,
3,
8,
7). Assume Page frame size is 3.
10 M
4(b)
What is Kernel? Explain its types.
10 M
5(a)
Given memory partitions of 100KB,
200KB, and 600 KB (in order),how would each off the first-fit,
best-fit and worst-fit algorithms place processes of 212KB,
417KB,
112KB, and 426KB in order)? Which algorithm makes the most efficient use of memory?
200KB, and 600 KB (in order),how would each off the first-fit,
best-fit and worst-fit algorithms place processes of 212KB,
417KB,
112KB, and 426KB in order)? Which algorithm makes the most efficient use of memory?
10 M
5(b)
Explain how logical address converted into physical address in paging & what is segmntation?
10 M
6(i)
Semaphone
5 M
6(ii)
Compare preemptive & non Preemptive scheduling
5 M
6(iii)
Anroid OS
5 M
6(iv)
Inter process communications
5 M
More question papers from Operating Systems