What are the four essential managers of an operating system?

What is the relationship between turnaround time, CPU cycle time, and waiting time?

Given that main memory is composed of THREE page frame for public use and that a program requests pages in the following order: 1 2 3 4 1 2 5 1 2 3 4 5.

i) Using the FIFO page removal algorithm, calculate FAILURE RATIO and a page trace analysis indicating page faults with asterisks (*).

ii) Using the LRU page removal algorithm, calculate FAILURE RATIO and analyze a page trace analysis indicating page faults with asterisks (*).

iii) Given that main memory is composed of FOUR page frame for public use and that a program requests pages in the following order: 1 2 3 4 1 2 5 1 2 3 4 5. Let's define most-recently-used (MRU) as a page removal algorithm that removes from memory the most recently used page. Using FIFO and MRU, do the page trace analysis using the same page requests as above and compute the failure ratios.

What is a job scheduler? What is a process scheduler?

As a process executes, it changes state. Complete to draw the state diagram of a process from its creation to termination, including all transitions, and briefly explain functions of each state.

What is deadlock? Describe about necessary conditions for deadlock characterization.

Use the best-fit algorithm to allocate the memory blocks to the three arriving jobs. Show internal fragmentation (if any) and waiting jobs (if any).

Use the first-fit algorithm to allocate the memory blocks to the three arriving jobs. Show internal fragmentation (if any) and waiting jobs (if any).

Use the next-fit algorithm to allocate the memory blocks to the three arriving jobs. Show internal fragmentation (if any) and waiting jobs (if any).

Worst-fit is an allocation algorithm that allocates the largest free block to a new job. This is the opposite of the best-fit algorithm. Use the worst-fit algorithm to allocate the memory blocks to the three arriving jobs. Show internal fragmentation (if any) and waiting jobs (if any).

From the comparison of the allocation results, WHICH algorithm is the most efficient and WHY?

What is deadlock? Describe about necessary conditions for deadlock characterization.

Briefly describe Banker's algorithm.

Draw and describe address translation architecture.

Briefly describe Banker's algorithm.

Draw storage device hierarchy.

What is page fault? Draw the steps in handling a page fault.

Explain multistep processing of a user program.
                                        

Identify all of the deadlocked processes.

Can the deadlock be resolved without selecting a victim?

Which requests by the three processes for resources from R2 would you satisfy to minimize the number of processes involved in the deadlock?

Conversely, which requests by the three processes for resources from R2 would you satisfy to maximize the number of processes involved in deadlock?

Suppose that a disk drive has 5000 cylinders, numbered 0 to 4999. The drive is currently serving a request at cylinder 143. The queue of pending request in FIFO order is 86, 1470, 913, 1774, 948, 1509 ,1022 ,1750,130. Starting from the current head position, illustrate and calculate the total distance (in cylinders) that the disk arm moves to satisfy all the pending requests for each of the following disk-scheduling algorithms.

i. FCFS

ii. SSTF

iii. SCAN (assuming arm movement towards the beginning of disk)

iv. LOOK

V. C-SCAN (assuming arm movement towards the end of disk)

vi. C-LOOK

Draw Gantt Charts for illustrating five scheduling algorithms which are First-Come-First-Served, Non-Preemptive Shortest-Job First, Priority and Round-Robin (time quantum = 1).

Calculate the turnaround time for each process based on the five scheduling algorithms.

Calculate the waiting time for each process based on the four scheduling algorithms.

Calculate the average turnaround time and the average waiting time for each process based on the four scheduling algorithms.