Home 
About
Blog
How multitasking is different from multiprocessing? Explain microkernel in detail.
What is critical section problem? How Peterson's solution can be used to achieve mutual exclusion?
What is TLB? How can it be used in paging? Explain.
What are advantages of distributed system over centralized system? Explain functional steps in remote procedure call with suitable diagram.
What is DMA? How can it be used to transfer data? Explain.
Explain different attributes of a file. What is hierarchical directory system?
What are authentication and authorization? Explain different authentication systems.
Attempt any TWO questions
[2x10=20]What are internal and external fragmentations? Explain how external fragmentation occurs in segmentation. Given six memory partitions of 300 KB, 600 KB, 350 KB, 200 KB, 750 KB, and 125 KB (in order), how would the first-fit, best-fit, and worst-fit algorithms place processes of size 115 KB, 500 KB, 358 KB, 200 KB, and 375 KB (in order)?
Consider the following set of processes, with the length of the CPU burst given in milliseconds:
| Process | Arrival Time | Burst Time | Priority |
| P1 | 0 | 6 | 2 |
| P2 | 1 | 2 | 1 |
| P3 | 3 | 3 | 2 |
| P4 | 6 | 2 | 3 |
a) Draw Gantt charts showing the execution of these processes using the following scheduling algorithms: FCFS, SJF, non-preemptive priority (a larger priority number implies a higher priority), and RR (quantum = 2ms).
b) Compute average waiting time and average turnaround time for each of these scheduling algorithms mentioned above.
c) What will happen if the quantum size is too large or too small in RR scheduling algorithm?
What are the four necessary conditions for deadlock to occur? Given three process A, B, and C and three resources X, Y, and Z are following events happen in the sequence as given:
a) A request X
b) B request Y
c) C request Z
d) A request Y
e) B request Z
f) C request X
g) C request Y
Assume that requested resource should be always be allocated to request process if it is available. Draw the resource allocation graph for the sequence and also mention whether it is deadlock? If it is how to recover the deadlock?