VARDHAMAN COLLEGE OF ENGINEERING

(AUTONOMOUS)
Affiliated to JNTUH, Approved by AICTE, Accredited by NAAC with A++ Grade, ISO 9001:2015 Certified
Kacharam, Shamshabad, Hyderabad – 501218, Telangana, India
A8510– OPERATING SYSTEMS
AAT: Assignment-II Common to CSE, IT, CSM, AIML and AIDS
Date of Assignment: 22-12-2023 II B.Tech I Sem Date of Submission: 20-01-2024
**Answer all the questions

S.No Question CO# BL# Marks

1 Given five memory partitions of 100 KB, 500 KB, 200 KB, 300 KB, and 600 CO3 L4 3M
KB (in order), how would each of the first-fit, best-fit, and worst-fit
algorithms place processes of 212KB, 417 KB, 112 KB, and 426 KB (in
order)? Which algorithm makes the most efficient use of memory?

2 Consider the page reference string 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3, 7, 6, 3, 2, CO3 L4 3M

1,2,3,6. Compare the page faults using FIFO, LRU and Optimal Page
Replacement algorithms using number of frames in memory are 4.
Does the FCFS page replacement suffers from Belady’s Anomaly or not?
(Verify using 3 and 4 frames).
3 Consider the following segment table: CO3 L3 3M

What are the physical addresses for the following logical addresses?
i. 0,430
ii. 1,10
iii. 2,50
iv. 3,400
v. 4,11
4 Suppose that a disk drive has 2000 cylinders, numbered 0 to 1999. The CO4 L3 3M
drive is currently serving a request at cylinder 140, and the previous
request was at cylinder 152. The queue of pending requests, in FIFO order
is:86, 1470, 913, 1774, 948, 1509, 1022, 1750, 130. Starting from the
current head position, what is the total distance 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 iv. LOOK
5 CO5 L3 3M