0% found this document useful (0 votes)
7 views3 pages

Operating System Fundamentals - - Unit 15 - Week 12

The document outlines the Week 12 assignment for the Operating System Fundamentals course, detailing various disk scheduling problems and questions related to disk drive operations. It includes specific scenarios for calculating total distances the disk arm moves under different scheduling algorithms, as well as questions about disk space allocation methods and RAID structures. The assignment is due on October 16, 2024, with multiple-choice answers provided for each question.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
7 views3 pages

Operating System Fundamentals - - Unit 15 - Week 12

The document outlines the Week 12 assignment for the Operating System Fundamentals course, detailing various disk scheduling problems and questions related to disk drive operations. It includes specific scenarios for calculating total distances the disk arm moves under different scheduling algorithms, as well as questions about disk space allocation methods and RAID structures. The assignment is due on October 16, 2024, with multiple-choice answers provided for each question.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

10/16/24, 10:33 PM Operating System Fundamentals - - Unit 15 - Week 12

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

[email protected]

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Operating System Fundamentals (course)

Course Week 12 : Assignment 12


outline Your last recorded submission was on 2024-10-13, 02:05 Due date: 2024-10-16, 23:59 IST.
IST
About
1) Suppose that a disk drive has 200 cylinders numbered 0 to 199. Consider a disk 1 point
NPTEL ()
queue with I/O requests on the following cylinders in their arriving order: 54, 95, 73, 130, 25, 48,
110, 30, 45, 180, and 190. The disk head is assumed to be at cylinder 24. Starting from the
How does an
NPTEL current head position, what is the total distance (in cylinders) the disk arm moves to satisfy all
online the pending requests for the FCFS disk-scheduling algorithm?
course
(A) 580 cylinders
work? ()
(B) 589 cylinders
Week 0 () (C) 643 cylinders
(D) 570 cylinders
Week 1 ()
(E) 585 cylinders

Week 2 ()
2) In a demand-paging system, the paging device has an average latency of 6ms, 1 point
seek time of 5ms, and transfer time of 0.1ms. The disk has a queue of waiting processes. The
Week 3 ()
average waiting time is 5ms. If the memory access time is 150ns and the page fault rate is 10%.
The effective memory access time is
Week 4 ()
(A) 1.61ms
Week 5 ()
(B) 1.22ms
(C) 2.712ms
Week 6 ()
(D) 1.50ms
Week 7 () (E) 1.45ms

Week 8 () 3) Suppose that a disk drive has 500 cylinders numbered 0 to 499. The drive currently 1 point
serves a request at cylinder 143; the previous request was at cylinder 125. The queue of
Week 9 () pending requests, in FIFO order, is 86, 170, 213, 474, 148, 109, 222, 450, and 330. Starting from

https://onlinecourses.nptel.ac.in/noc24_cs108/unit?unit=105&assessment=188 1/3
10/16/24, 10:33 PM Operating System Fundamentals - - Unit 15 - Week 12

the current head position, what is the total distance (in cylinders) the disk arm moves to satisfy
Week 10 ()
all the pending requests for the SSTF disk-scheduling algorithm?

Week 11 () (A) 680 cylinders


(B) 580 cylinders
Week 12 ()
(C) 700 cylinders
Lecture 56 : (D) 750 cylinders
Virtual
(E) 719 cylinders
Memory
(Contd.) (unit? 4) Suppose that a disk drive has 140 cylinders numbered 0 to 139. Consider a disk 1 point
unit=105&less queue with requests for I/O to blocks on cylinders 6, 10, 12, 54, 97, 73, 128, 15, 44, 110, 34, and
on=106)
45 in that order. Assume that the head is moving toward decreasing the order of the cylinder
Lecture 57 : numbers. Initially, the disk head is at cylinder 20. Starting from the current head position, what is
File System the total distance (in cylinders) the disk arm moves to satisfy all the pending requests for the
and SCAN disk-scheduling algorithm?
Secondary
Storage (unit? (A) 150 cylinders
unit=105&less
(B) 155 cylinders
on=107)
(C) 158 cylinders
Lecture 58 :
(D) 165 cylinders
File System
and (E) 170 cylinders
Secondary
Storage 5) Suppose that a disk drive has 500 cylinders numbered 0 to 499. Consider a disk 1 point
(Contd.) (unit? queue with requests for I/O to blocks on cylinders 10, 120, 147, 312, 180, 444, 355, 470, 290,
unit=105&less and 170, in that order. Assume that the head is moving toward decreasing the order of the
on=108)
cylinder numbers. Initially, the disk head is at cylinder 100. Starting from the current head
Lecture 59 : position, what is the total distance (in cylinders) the disk arm moves to satisfy all the pending
File System requests for the C-SCAN disk-scheduling algorithm?
and
Secondary (A) 1328 cylinders
Storage (B) 1220 cylinders
(Contd.) (unit?
(C) 1350 cylinders
unit=105&less
on=109) (D) 1380 cylinders
(E) 1280 cylinders
Lecture 60 :
File System
and 6) Suppose that a disk drive has 400 cylinders numbered 0 to 399. Consider a disk 1 point
Secondary queue with I/O requests on the following cylinders in their arriving order: 26, 120, 226, 354, 197,
Storage 373, 228, 315, 244, 110, 34, and 45. The read/write head is positioned at cylinder 123 and
(Contd.) (unit? moving in the direction of decreasing cylinder number. Starting from the current head position
unit=105&less
123, what is the total distance (in cylinders) the disk arm moves to satisfy all the pending
on=110)
requests for the LOOK disk-scheduling algorithm?
Lecture
Material (unit? (A) 345 cylinders
unit=105&less (B) 245 cylinders
on=111)
(C) 444 cylinders
Feedback for (D) 440 cylinders
week 12 (unit?
(E) 340 cylinders
unit=105&less
on=112)

https://onlinecourses.nptel.ac.in/noc24_cs108/unit?unit=105&assessment=188 2/3
10/16/24, 10:33 PM Operating System Fundamentals - - Unit 15 - Week 12

Quiz: Week 7) Suppose that a disk drive has 200 cylinders numbered 0 to 199. Consider a disk 1 point
12 : queue with I/O requests on the following cylinders in their arriving order: 54, 95, 73, 130, 25, 48,
Assignment 110, 30, 45, 180, and 190. The read/write head is positioned at cylinder 43 and moving in the
12 direction of decreasing cylinder number. Starting from the current head position 43, what is the
(assessment? total distance (in cylinders) the disk arm moves to satisfy all the pending requests for the C-
name=188)
LOOK disk-scheduling algorithm?

Download (A) 328 cylinders


Videos ()
(B) 324 cylinders

Text (C) 320 cylinders


Transcripts (D) 316 cylinders
() (E) 312 cylinders

Books () 8) Choose the disk space allocation methods that allow efficient random access to file 1 point
blocks and minimise external fragmentation.
Problem
Solving (A) Contiguous Allocation
Session -
(B) Linked Allocation
July 2024 ()
(C) Indexed Allocation
(D) File Allocation Table (FAT)
(E) Free Space Management

9) When the object files have been linked properly and are ready to run, they are 1 point
known as

(A) archive files


(B) batch files
(C) object files
(D) executable files
(E) library files

10) RAID structure is used to 1 point

(A) improve the performance of the data storage system


(B) improve the reliability of the data storage system
(C) make the data storage system fault-tolerant
(D) improve the data recovery
(E) All of the above

You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers

https://onlinecourses.nptel.ac.in/noc24_cs108/unit?unit=105&assessment=188 3/3

You might also like