What is Page fault in Paging? Consider the following page reference string:

3,6.

How many page faults would occur for the following replacement algorithms, assuming one, two, three, four, five, six or seven frames Remember all frames are initially empty, so your first unique pages will all cost one fault each.

LRU

FIFO

Optimal Replacement

Write short notes on the following:

Log Structured File System

Real Time System

Dynamic Loading and Linking

Deadlock Prevention

Suppose that a disk drive has 5000 cylinders, numbered from 0 to 4999. The drive is currently serving a request at cylinder 143, and the previous request was at cylinder 125.

The queue of pending requests, in FIFO order, is

86,1470,913,1774,948,1509,1022,1750, 130.

Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk scheduling algorithms:

FCFS

SSTF

SCAN

LOOK

What is mutual exclusion Write an algorithm to provide mutual exclusion using binary semaphore.

What are the programming? benefits of multithreaded

Explain the use of fork and exec system calls.

What are the various scheduling criteria for CPU scheduling Also, differentiate between preemptive and non-preemptive scheduling? Give an example of each.

Write a shell script that prints a list of every unique word contained in the file in alphabetical order.

Why are "diff" and its variants more suitable for comparing text files than "cmp" command?

Explain the different disk allocation methods. Also, write one advantage and one disadvantage of each.

Describe the phases of a 2-phase assembler, with the help of a suitable diagram. Also, explain the steps and procedures used in these phases.

How can the index blocks be implemented in the indexed allocation scheme? Explain.

Write a note on TSL and SWAP instructions.

Define the term 'Race condition' with an example.