Scribd
Upload
77 views

Operating System Kcs-401. Question Bank Unit-V: I/O Management & Disk Scheduling 2018-19

This document contains past year questions from the question bank for the operating systems course KCS-401. The questions cover various topics related to I/O management and disk scheduling such as seek time, latency time, SCAN and C-SCAN scheduling algorithms, file organization, access methods, buffering, spooling, error handling, disk scheduling algorithms like FCFS, SCAN, C-SCAN and their examples. Other topics include directory implementation, file allocation schemes like linked, contiguous, indexed and multilevel indexing allocation, logical structure of directories, access matrix, boot block, free space management techniques and file system implementation.

Uploaded by

Nishant Mishra
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
77 views

Operating System Kcs-401. Question Bank Unit-V: I/O Management & Disk Scheduling 2018-19

This document contains past year questions from the question bank for the operating systems course KCS-401. The questions cover various topics related to I/O management and disk scheduling such as seek time, latency time, SCAN and C-SCAN scheduling algorithms, file organization, access methods, buffering, spooling, error handling, disk scheduling algorithms like FCFS, SCAN, C-SCAN and their examples. Other topics include directory implementation, file allocation schemes like linked, contiguous, indexed and multilevel indexing allocation, logical structure of directories, access matrix, boot block, free space management techniques and file system implementation.

Uploaded by

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

OPERATING SYSTEM KCS-401.

QUESTION BANK à UNIT-V : I/O MANAGEMENT & DISK SCHEDULING

2018-19
1. Define seek time and latency time.
2. Define SCAN and C-SCAN scheduling algorithm
3. A hard disk having 2000 cylinders, numbered from 0 to 1999. the drive is currently
serving the request at cylinder 143,and the previous request was at cylinder 125.The
status of the queue is as follows 86, 1470, 913, 1774,948,1509,1022,1750,130
What is the total distance (in cylinders) that the disk arm moves to satisfy the entire
pending request for each of the following disk-scheduling algorithms?
(i) SSTF (ii) FCFS
4. What are files and explain the access methods for files.
5. Write short notes on : i) File system protection and security and
ii) Linked File allocation methods

2017-18
1. Discuss the Linked, Contiguous and Index and multilevel Indexing file allocation
schemes. Which allocation scheme will minimize the amount of space required in
directory structure and why?
2. Write short notes on :
i) I/O Buffering
ii) Disk storage and scheduling

2016-17
1. Difference between Directory and File.
2. Explain File organization and Access mechanism.
3. What do you mean by cashing, spooling and error handling, explain in detail.
4. Explain FCFS, SCAN & CSCAN scheduling with eg.

2015-16

1. What is SPOOLING?
2. Explain the following methods : (a) Bit Vector. (b) Linked List. (c) Grouping
(d) Counting
3. Suppose the moving head disk with 200 tracks is currently serving a request for track
143 and has just finished a request for track 125. If the queue of request is kept in FIFO
order 86, 147, 91, 177, 94, 150. What is the total head movement for the following
scheduling : (i) FCFS. (ii) SSTF. (iii) C-SCAN
4. Write short notes on : (i) I/O Buffering. (ii) Sequential File (iii) Indexed File

2014-15
1. Discuss the following terms : Access Matrix, Boot Block
2. Describe schemes for defining logical structure of directory.
3. Discuss Disk Scheduling Algorithms with examples.

2013-14

Dr. Ragini Karwayun KCS-401 Question Bank


1. Suppose the moving head disk with 200 tracks is currently serving a request for track
143 and has just finished a request for track 125. If the queue of request is kept in FIFO
order 86, 147, 91, 177, 94, 150. What is the total head movement for the following
scheduling : (i) FCFS. (ii) SSTF. (iii) C-SCAN
2. Write short notes on : (i) I/O Buffering. (ii) Sequential File (iii) Indexed File
3. What is a directory? Define any two ways to implement the directory.

2012-13
1. What is access matrix and how it is used for protection?
2. What are the various file access methods? Explain sequential access method. How can
it be simulated on direct access file?
3. Explain File organization and Access mechanism.
4. Describe File System Implementation and Directory System Implementation in detail.

Some more important questions (From previous years (earlier than 2012-13) Q.Papers)

1. Explain the need of system protection with the help of examples.


2. Discuss various file allocation strategies for disk space management. What criteria
should be used in deciding which strategy is best suited for a particular file?
3. Differentiate between linked list and bit map for free space management.
4. If a partition has 16 1K blocks and its free space bit map is 1100 0011 1111 1000
i. How many blocks are free
ii. Can we allocate five contiguous blocks.
iii. If a file that occupies 7th and 8th block is deleted, what will be the
contents of new bit map.

Dr. Ragini Karwayun KCS-401 Question Bank

You might also like