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(a)
What is mutual exclusion? Explain its Significance.
5 M
Solve any question 4 Q1(a,b,c,d,e)
1(a)
What is Kernel? Describe briefly the approaches of designing Kernel.
5 M
1(b)
What is Producer Consumer problem? What is solution of example?
5 M
1(b)
Discuss various scheduling Criteria.
5 M
1(b)
Explain the difference between paging and Segmentation.
5 M
1(c)
Describe and design I-node structure of Unix operating system
5 M
1(c)
Explain services provided by operating system.
5 M
1(c)
Explain the effect of page size on performance of Operating System.
5 M
1(d)
Disuss Critical Selection Proble? How to solve it?
5 M
1(d)
Write short note on system calls.
5 M
1(d)
Explain various I/O buffering techniques.
5 M
1(e)
What is system call? Explain any four system calls.
5 M
1(e)
What do you mean by Busy Waiting? What is wrong with it?
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(a)
What is deadlock? Explain the necessary and sufficient conditions for the deadlock. Suggest techniques to avoid deadlock.
10 M
2(a)
a Calculate hit and miss for the following string using page replacement policies - FIFO,
LRU and Optimal. Compare it for the frame size 3 &4.
1
2
3
2
1
5
2
1
6
2
5
6
3
1
3
6
1
2
4
3
LRU and Optimal. Compare it for the frame size 3 &4.
1
2
3
2
1
5
2
1
6
2
5
6
3
1
3
6
1
2
4
3
10 M
2(b)
What is Thread? Explain User Level Threads and Kernel evel Threads.
10 M
2(b)
Differentiate the following:
i) Process vs Thread
ii) Preemptive vs Non-preemptive Scheduling
i) Process vs Thread
ii) Preemptive vs Non-preemptive Scheduling
10 M
2(b)
b. What is a deadlock? Explain the necessary and sufficient conditions for the deadlock Also suggest techniques to avoid deadlocks.
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(a)
Exlain the following in brief:
i) Process Synchronisation
ii) Inter-Process Communication (IPC)
i) Process Synchronisation
ii) Inter-Process Communication (IPC)
10 M
3(a)
Explain an algorithm for producer-consumer problem
10 M
3(b)
State the necessary conditions for feedback . Explain deadlock prevention and avoidance Techniques.
10 M
3(b)
Discuss partition selection algorithm in brief. Given memory partition of 150k,
500k,
200k,
300k &550k(in order), how would each pf the first fit , best fit and worst fit algorithm place the processes of 220k,
430k,
110k &425k (in order). Which algorithm makes the most efficient use of memory?
500k,
200k,
300k &550k(in order), how would each pf the first fit , best fit and worst fit algorithm place the processes of 220k,
430k,
110k &425k (in order). Which algorithm makes the most efficient use of memory?
10 M
3(b)
Explain the banker's algorithm in detail.
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(a)
Find AWT,
ATAT,
ART and AWTAT for the following set of processes with CPU burst time in ms. Assume that all process arrive at time 0.(P1-19),
(P2-7),
(P3-3)
i) FCFS with order P2,
P3,
P1
ii) Round Robin (Quantum=2ms)
ATAT,
ART and AWTAT for the following set of processes with CPU burst time in ms. Assume that all process arrive at time 0.(P1-19),
(P2-7),
(P3-3)
i) FCFS with order P2,
P3,
P1
ii) Round Robin (Quantum=2ms)
10 M
4(a)
Explain the hardware support for paging.
10 M
4(b)
What is Kernel? Explain its types.
10 M
4(b)
Explain paging hardware with TLB along - with protection bits in page table.
10 M
4(b)
Assume the following process arrive for execution at the time indicated and the length of cpu burst time given in msec.
For the above process parameters, find average waiting times and average turnaround times for the following scheduling algorthms. First Come First Serve, Shortest Job First, non preemptive priority and Round Robin (assume quantum=2 units)
| Job | Burst time | Priority | Arrival time |
| P1 | 8 | 3 | 3 |
| P2 | 1 | 1 | 1 |
| P3 | 3 | 2 | 2 |
| P4 | 2 | 3 | 3 |
| P5 | 6 | 4 | 4 |
10 M
5(a)
Explain LINUX operating system with Kernel, Memory management & scheduling .
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(a)
Exlain various allocation methods with reference to file system?
10 M
5(b)
Compare the following Disk scheduling algorithms using appropriate example- SSFF,
FCFS,
SCAN,
C-SCAN,
LOOK
FCFS,
SCAN,
C-SCAN,
LOOK
10 M
5(b)
Explain how logical address converted into physical address in paging & what is segmntation?
10 M
5(b)
Calculate hit ad miss percentage for the following string using page replacement policies FIFO,
LRU and Optimal. Compare it for he frame size 3 and 4.
2,
0,
3,
0,
4,
2,
3,
0,
3,
2,
7,
2,
0,
7,
5,
0,
7,
5,
7,
0
LRU and Optimal. Compare it for he frame size 3 and 4.
2,
0,
3,
0,
4,
2,
3,
0,
3,
2,
7,
2,
0,
7,
5,
0,
7,
5,
7,
0
10 M
Write note on the following:
6(a)
Resouce Allocation Graph
5 M
Write short note on any Two Q6(a, b,c,d)
6(a)
File management in Linux
5 M
6(b)
Process Control Block
5 M
6(b)
Belady's anomaly
5 M
6(c)
Demand Paging
5 M
6(c)
Case study of windows operating system
5 M
6(d)
Scheduling in Linux system
5 M
6(d)
Virtual memory
5 M
6(i)
Semaphone
5 M
6(ii)
Compare preemptive & Preemptive scheduling
5 M
6(iii)
Anroid OS
5 M
6(iv)
Inter process communications
5 M
More question papers from Operating Systems