What is sleep and wakeup? Demonstrate problem with suitable code snippet and illustration.

When page fault occurs and how it is handled? Demonstrate second chance and LRU page replacement algorithm for memory with three frames and following reference string: 1,3,7,4,5,2,3,6,4,5,7,8,5,1,4

What is I-node? Why it is superior to other file allocation approaches? Consider 20-GB disk with 8-KB block size. How much memory space will be occupied if contiguous, and File allocation table is used for file allocation? Assume that each FAT entry takes 4 byte.

Define the terms shell and system call. How it is handled? Illustrate with suitable example.

What are main goals of interactive system scheduling? Discuss priority scheduling along with its pros and cons.

How starvation differs from deadlock? Consider the following situation of processes and resources:

a. What will happen if process P3 requests 1 resource?

b. What will happen if process P4 requests 1 resource?

Define the term race condition. Justify that race condition leads data loss or incorrect data.

Explain directory implementation techniques employed in operating systems briefly.

Consider the segment table:

What are the physical address for the following logical addresses?

a. 0,430

b. 1,10

c. 1,11

d. 2,500

What is the main purpose of disk scheduling algorithms? Which disk scheduling technique is best but impractical? Explain the algorithm with example.

How threads differ from processes? Explain thread usages.

Write short notes on:

a) Linux Scheduling

b) Fragmentation