Scribd
Upload
5 views

Assignment OS With 543

Uploaded by

Nikhil Kannale
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views

Assignment OS With 543

Uploaded by

Nikhil Kannale
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Module – 5

Explain the file system attributes and operations performed on file.


Explain and Analyze the goals of Protection in file system
Explain and analyze the FCFS, SSTF scheduling algorithm with example.
Explain and analyze the SCAN and C-SCAN disk scheduling algorithm with queue=
98,183,37,122,14,124,65,67
Head start =57, draw the graph
Analyze the different types of files with name and extension.
Explain the mass storage structure with a neat sketch.

Module – 3

Solve the following snapshot of the system

Process Allocation Max. Available

A B C D A B C D A B C D

P0 0 0 1 2 0 0 1 2 1 5 2 0

P1 1 0 0 0 1 7 5 0

P2 1 3 5 4 2 3 5 6

P3 0 6 3 2 0 6 5 2

P4 0 0 1 4 0 6 5 6

Answer the following questions using bankers algorithm


1 What is the contents of need matrix
2 Is the system in safe state
3 If the request from the process P1 arrives for ( 0 4 2 0 ) can the request be granted
immediately

Explain the various methods of recovery from deadlock.

Explain the dead lock, Explain and analyze the necessary conditions of an operating system must satisfy for
dead lock to occur?
Sole the following snapshot of the system

Process Allocation Max. Available

A B C A B C A B C

P0 0 1 0 7 5 3 1 5 2

P1 2 0 0 3 2 2

P2 3 0 2 9 0 2

P3 2 1 1 2 2 2

P4 0 0 2 4 3 3

Answer the following questions using bankers algorithm


1 What is the contents of need matrix
2 Is the system in safe state
3 If the request from the process P1 arrives for ( 1 0 2 ) can the request be granted immediately
Moule -4

Solve the given reference string 7,0,1,2,3,0,3,0,4,2,3,0,3,2,1,2,0,7

Assuming the frame size of 4 apply LRU,FIFO and Optimal algorithm to find which algorithm is most efficient
Explain the demand paging and thrashing, How these affects system performance?
Explain the fragmentation? Analyze the two types of memory fragmentation
Given the memory partitions of 100 K, 500 K, 200 K, 300 K and 600 K apply first fit, best fit and worst fit
algorithms to place 212K. 417K, 112K and 426K.
Explain and analyze the structure of page table with respect to hierarchical paging, with diagram

You might also like