BITM Operating System

What might be the behavior of Round Robin algorithm, if its quantum is too large?

What are the two ways to terminate a process?

Define time sharing.

Why do we need virtual memory?

When a system is said to be deadlocked?

What is the problem of preemptive scheduling?

Differentiate between page and frame.

List the different attributes of file protection.

Differentiate between security policy and mechanism.

Define device driver.

Describe about fixed partition and variable partition memory strategies.

Draw a process state diagram. Describe how process state transition occurs.

Suppose a disk has 100 cylinders from 0 to 99 where the current head position is 46. If the disk access request is 75, 73, 2, 77, 37, 12, 11, 53 and 19 in order. Starting from the current head position calculate the total disk access time to serve all these request using:

a. FCFS algorithm

b. Shortest seek time first algorithm

The seek time from one cylinder to adjacent cylinder is 0.5 millisecond.

Explain various authentication mechanism used in security system.

What are the disadvantages of FCFS, Shortest Job Next and Priority scheduling algorithm?

Define critical section. How semaphore can be used to achieve mutual exclusion? Explain.

Which of the I/O strategy (polling, interrupt or DMA) is suitable for the following types of system? Give reason.

a. A system dedicated to controlling a single I/O devices.

b. A personal computer running a single-tasking OS.

c. A work station running as heavily used web server.