Scribd
Upload
11 views

OS Assignment 3

This document outlines the assignment questions for the Operating Systems course in the Department of Computer Science and Engineering. It includes questions related to page replacement algorithms, disk scheduling algorithms, and detailed explanations of the Linux file system and Android architecture. Each question is mapped to specific course outcomes and program specific outcomes.

Uploaded by

vishnupriyapacet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
11 views

OS Assignment 3

This document outlines the assignment questions for the Operating Systems course in the Department of Computer Science and Engineering. It includes questions related to page replacement algorithms, disk scheduling algorithms, and detailed explanations of the Linux file system and Android architecture. Each question is mapped to specific course outcomes and program specific outcomes.

Uploaded by

vishnupriyapacet
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

22CAPC402 OPERATING SYSTEMS


ASSIGNMENT-III QUESTIONS
CLASS-II CSE A
S.NO Questions Mapping Mapping with PO
with CO and PSO
1 Consider the following page reference string CO3 PO-1,2,3,4,5,9,10,
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,4,5,3. How many page 11,12 ;PSO-1,2,3
faults would occur for the following replacement algorithms ?
Assume four frames and all frames are initially empty.
i) LRU replacement
ii) FIFO replacement
iii) Optimal replacement.
2 On a disk with 200 cylinders numbered 0 to 199 compute the CO4 PO-1,2,3,4,5,9,10,11,
number of tracks the disk arm must move to satisfy the entire 12,
PSO-1,2,3
request in the disk queue. Assume the last request received
was at track 100. The queue in FIFO order contains requests
for the following tracks. 55,58,39,18,90,160,150,38,184.
Perform the computation to find the seek time for the
following disk scheduling
algorithms.
i) FCFS
ii) SSTF
iii) SCAN
iv) C-SCAN
v) LOOK
3 Explain in detail the file system in LINUX system. CO5 PO-1,2,3,4,5,9,10,11,
12;PSO-1,2,3
4 Explain about Android Architecture in detail CO5 PO-1,2,3,4,5,9,10,11,
12;PSO-1,2,3

Faculty In-Charge HOD

You might also like