STUPIDSID
1(a)
Differentiate between multiprogramming and multiprocessing.
5 M
1(b)
Explain the various functions of operating system with respect to process and memory management.
5 M
1(c)
What are the different ways in which the p thread terminates?
5 M
1(d)
Explain any two facilities provided for implementing interacting process in programming language and operating system.
5 M
2(a)
Differentiate between :
i) User level threads
ii) Process and thread.
i) User level threads
ii) Process and thread.
6 M
2(b)
Following is the snapshot of a cpu
Draw Gantt charts and calculate the waiting and turnaround time using FCFS, SJF and RR with time quantum 10 scheduling algorithms.
| Process | CPU Burst | Arrival time |
| P1 | 10 | 0 |
| P2 | 29 | 1 |
| P3 | 03 | 2 |
| P4 | 07 | 3 |
Draw Gantt charts and calculate the waiting and turnaround time using FCFS, SJF and RR with time quantum 10 scheduling algorithms.
9 M
2(c)
Explain different scheduling criteria that must be kept in mind while choosing different scheduling algorithms.
5 M
3(a)
Explain critical section problem. What are the requirements that critical section problem must satisfy?
5 M
3(b)
Explain Reader's writers problem and provided a semaphore solution using semaphore's for reader's priority problem.
10 M
3(c)
What are monitors? Compare with semaphores with their relative advantages and disadvantages.
5 M
4(a)
Consider a system containing m resources of the same type being shared by n processes.Resources can be requested and released by processes only one at a time. Show that the system is deadlock free if the following two conditions hold :
i) The maximum need of each process is between I and m resources
ii) The sum of all maximum needs is less than m+n.
i) The maximum need of each process is between I and m resources
ii) The sum of all maximum needs is less than m+n.
10 M
4(b)
For the given snapshot :
Using Banker's algorithm :
i) What is the need matrix content?
ii) Is the system in safe state?
iii) If a request form process P2(0,4,2,0) arrivers,can it be granted?
Allocation
| A | B | C | D | |
| P1 | 0 | 0 | 1 | 2 |
| P2 | 1 | 0 | 0 | 0 |
| P3 | 1 | 3 | 5 | 4 |
| P4 | 0 | 6 | 3 | 2 |
| P5 | 0 | 0 | 1 | 4 |
Max
| A | B | C | D |
| 0 | 0 | 1 | 2 |
| 1 | 7 | 5 | 0 |
| 2 | 3 | 5 | 6 |
| 0 | 6 | 5 | 2 |
| 0 | 6 | 5 | 6 |
Available
| A | B | C | D |
| 1 | 5 | 2 | 0 |
Using Banker's algorithm :
i) What is the need matrix content?
ii) Is the system in safe state?
iii) If a request form process P2(0,4,2,0) arrivers,can it be granted?
10 M
5(a)
What is locality of reference? Differentiate between paging and segmentation.
5 M
5(b)
Explain the differences between :
Logical and physical address space
Internal and external fragmentation.
Logical and physical address space
Internal and external fragmentation.
5 M
5(c)
For the following page reference calculate the page faults that occur using FIFO and LRU for 3 and 4 page frames respectively , 5,4,3,2,1,4,3,5,4,3,2,1,5.
10 M
6(a)
What are different techniques with which a file can shared among users?
6 M
6(b)
Given memory partitions of 100 k, 500 k, 200 k, 600 k, (in order), which algorithm form best fit,worst fit and first fit places processes with requirements 212 k, 417 k, 112 k and 426 k in an efficient manner?
6 M
6(c)
Explain the various storage mechanisms available to store files,with neat diagram.
8 M
7(a)
Given the following queue 95, 180, 34, 119, 11, 123, 62, 64 with head initially at track 50 and ending at track 199 calculate the number moves using FCFS, SSTF, Elevator and c look algorithm.
12 M
7(b)
What are access matrices? Explain its implementation.
4 M
7(C)
Differentiate between protection and security.
4 M
8(a)
Explain the different IPS mechanism available in Linux.
8 M
8(b)
Explain how process is managed on Linux platform.
8 M
8(c)
Write a brief note on the design principles of Linux.
4 M
More question papers from Operating Systems