Explain any four scheduling criteria.

Define virtual memory

Describe any four file attributes.

Explain deadlock? What are necessary conditions for deadlock?

Explain partitioning and its types

Describe sequential and direct access method.

State and describe types of scheduler.

Explain Round Robin algorithm with suitable example.

Explain LRU page replacement algorithm for following reference string. 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0

1 7 0 1 Calculate the page fault.

The jobs are scheduled for execution as follows

Process Arrival Time Burst Time

P1 0 7
P2 1 4
P3 2 10
P4 3 6
P5 4 8

Solve the problem using: (i) SJF (ii) FCFS Also find average waiting time using Gantt chart.

List free space management techniques? Describe any one in detail.

Enlist different file allocation methods? Explain contiguous allocation method in detail.

State difference between preemptive scheduling and non-preemptive scheduling.

Define the term fragmentation in terms of memory

List any four operations performed on a file.

Describe prevention of deadlock occurrence with respect to hold and wait necessary condition

With suitable diagram, describe the concept of variable partitioning of memory.

Describe linked file allocation method with suitable example. Also list its one advantage.

Describe various activities performed by following operating system components.

i) Main memory management

ii) ii) File management

With suitable diagram, describe use of scheduling queues in process scheduling.

Write steps required for Banker’s algorithm to avoid deadlock.

With suitable example, describe any one free space management technique.
Calculate average waiting time for following data using First Come First Served (FCFS) and Shortest
Job First (SJF) algorithms.

Process Arrival Time Burst Time

P0 08 0
P1 04 1
P2 05 2
P3 03 3

Describe with example, use of following tools:

i) Device Management
ii) ii) Performance monitor
iii) iii) Task scheduler
Describe the concept of virtual memory with respect to paging. Also draw paging hardware diagram
and describe its working with example.
Consider the following page reference string arrival with three page frames:- 5, 6, 7, 8, 9, 7, 8, 5, 9, 7,
8, 7, 9, 6, 5, 6 Calculate number of page faults with optimal and FIFO (First In First Out) page
replacement algorithms.

Describe following directory structures in short with neat sketches: i) Single level ii) Two level iii)
Tree structured

Differentiate between paging and segmentation.

Describe conditions for deadlock prevention.

Explain fixed size memory partitioning.

Explain fixed size memory partitioning.

Solve given problem by using SJF and FCFS scheduling algorithm using Gantt chart. Calculate the
average waiting time for each algorithm.

Process Burst time

P1 9
P2 7
P3 3
P4 3

Given a page reference string with three (03) page frames. Calculate the page faults with ‘Optimal’
and ‘LRU’ page replacement algorithm respectively. ‘7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1

Solve given problem by using (i) Pre-emptive SJF (ii) Round Robin (Time Slice = 3 ms) Calculate
average waiting time using Gantt Chart

Process Arrival Time Burst Time

P11 0 8
P12 1 4
P13 2 9
P14 3 5
Consider the following memory map and assume a new process P4 comes with memory
requirements of 6 KB. Locate (Draw) this process in memory using.

i. First Bet
ii. Best Fit
iii. Worst Fit
O.S
P1
<FREE> 12 KB
P2
<FREE> 19 KB
P3
<FREE> 7 KB

Construct and explain directory structure of a file system in terms of two level and tree structure.

Define following terms :

i) Virtual Memory
ii) ii) Paging

Define Deadlock.

Define fragmentation. Explain Internal and External Fragmentation

Explain different types of schedulers.

Explain two level directory structure with suitable diagram.

Explain fixed and variable memory management.

With neat diagram explain multilevel queue scheduling.

List file allocation method and explain any one in details.

For the page reference string 7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1 Calculate the page

faults applying.

i) Optimal
ii) ii) LRU
iii) iii) FiFo page

Consider the four processes P1, P2, P3 and P4 with length of CPO Burst time. Find out Avg waiting
time and Avg turn around time for the following Algorithms. i) FCFS ii) RR (Slice-4ms) iii) SJF

Process Arrival Time Burst Time

P1 0 8
P2 1 4
P3 2 9
P4 3 5

Explain following terms with respect to scheduling

  CPU utilization
 Throughput
 Turnaround time
 Waiting time

Write down the responsibilities of the following components of OS.

i) Memory management
ii) ii) File management

Describe concept of free space management technique using bit map method.

Draw the diagram of linked file allocation method and explain it.

Solve given problem by using FCFS scheduling algorithm. Draw correct Gantt chart and calculate
average waiting time and average turnaround time –

Process Arrival Time Burst Time

P0 0 10
P1 1 29
P2 2 3
P3 3 7
P4 4 12

Which hole is taken for next segment request for 8 KB in a swapping system for First fit, Best fit and
Worst fit.

OS
4 KB
9 KB
20 KB
16 KB
8 KB
2 KB
6 KB

Find out the total number of page faults using –

i) Least recently used page replacement

ii) Optimal page replacement

Page replacement algorithms of memory management, if the page are coming in the order

70120304230321201701

Draw and explain directory structure of a file system in terms of single level, two level and tree
structure.