STUPIDSID
Solve any one question from Q1 and Q2
1 (a)
What are the OS design consideration for multiprocessor & multicare
Architecture?
5 M
1 (b)
Explain different types of schedulers in an operating systems.
5 M
2 (a)
Explain any classical synchronization problem.
5 M
2 (b)
Explain thread & process management in Android Operating System.
5 M
Solve any one question from Q3 and Q4
3 (a)
What is deadlock? State & explain necessary conditions for deadlock.
5 M
3 (b)
What is busy waiting with respective to process synchronization?
Explain how semaphore reduces the severity of this problem.
5 M
4 (a)
For the table given below draw a Gantt chart illustrating process
execution using priority non-preemptive scheduling algorithm. (A
larger no indicates higher priority)
| Process | A.T. | B.T. | Priority |
| 01 | 0 | 5 | 4 |
| 02 | 2 | 4 | 2 |
| 03 | 2 | 2 | 6 |
| 04 | 4 | 4 | 3 |
5 M
4 (b)
What are different requirements for mutual exclusion.
5 M
Solve any one question from Q5 and Q6
5 (a)
Write a short note on paging.
6 M
5 (b)
For the following page reference string with 3 frames:
A, B, C, D, E, C, D, A, F, G, H, G, H, I, G, H, I, E, D, E, D, B.
Calculate the no. of page faults for the following page replacement algorithm.
i) FIFO
ii) LRU
iii) Optimal
A, B, C, D, E, C, D, A, F, G, H, G, H, I, G, H, I, E, D, E, D, B.
Calculate the no. of page faults for the following page replacement algorithm.
i) FIFO
ii) LRU
iii) Optimal
12 M
6 (a)
Explain memory management in Linux.
10 M
6 (b)
What is page fault? How the OS handles when a page fault occurs and what are the actions taken by OS explain it with neat diagram.
8 M
Solve any one question from Q7 and Q8
7 (a)
Explain different file organization techniques.
8 M
7 (b)
Assume a disk with 200 tracks & the disk request queue has random requests in it as follows : 55, 58, 39, 18, 90, 160, 150, 38, 184.
Find the no. of tracks traversed and average seek length if
i) SSTF
ii) SCAN
iii) C-SCAN
disk scheduling algorithm is used & initially head is at track no. 100.
Find the no. of tracks traversed and average seek length if
i) SSTF
ii) SCAN
iii) C-SCAN
disk scheduling algorithm is used & initially head is at track no. 100.
8 M
8 (a)
Describe 3 methods of record blocking with the help of neat diagram.
8 M
8 (b)
Explain the different file system performance issues.
8 M
Write a short note on the following (any three):
9 (a)
Service Oriented Operating System. SOOS.
5 M
9 (b)
Ubuntu EDGE.
5 M
9 (c)
Android OS.
5 M
9 (d)
Embedded Linux
5 M
10 (a)
Explain procedure of inserting new module in existing kernel with all
necessary steps.
8 M
10 (b)
Explain NACH OS Components in brief.
8 M
More question papers from Operating System