OS Input Output Systems

Last Updated :
Discuss
Comments

Question 1

A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is

  • 3 Kbytes

  • 35 Kbytes

  • 280 Bytes

  • Dependent on the size of the disk

Discuss it

Question 2

A system uses FIFO policy for page replacement. It has 4 page frames with no pages loaded to begin with. The system first accesses 50 distinct pages in some order and then accesses the same 50 pages in reverse order. How many page faults will occur?

  • 96

  • 100

  • 97

  • 92

Discuss it

Question 3

Suppose we have variable logical records of lengths of 5 bytes, 10 bytes, and 25 bytes while the physical block size in disk is 15 bytes. What is the maximum and minimum fragmentation seen in bytes?

  • 25 and 5

  • 15 and 5

  • 15 and 0

  • 10 and 5

Discuss it

Question 4

In case of a DVD, the speed of data transfer is mentioned in multiples of?

  • 150 KB/s

  • 1.38 MB/s

  • 300 KB/s

  • 2.40 MB/s

Discuss it

Question 5

Consider a system where each file is associated with a 16 bit number. For each file, each user should have the read and write capability. How much memory is needed to store each user's access data?

  • 16 KB

  • 32 KB

  • 64 KB

  • 128 KB

Discuss it

Question 6

Consider a file currently consisting of 50 blocks. Assume that the file control block and the index block is already in memory. If a block is added at the end (and the block information to be added is stored in memory), then how many disk I/O operations are required for indexed (single-level) allocation strategy?
  • 1
  • 101
  • 27
  • 0
Discuss it

Question 7

There are 200 tracks on a disc platter and the pending requests have come in the order - 36, 69, 167, 76, 42, 51, 126, 12 and 199. Assume the arm is located at the 100 track and moving towards track 199. If sequence of disc access is 126, 167, 199, 12, 36, 42, 51, 69 and 76 then which disc access scheduling policy is used?

  • Elevator

  • Shortest seek-time first

  • C-SCAN

  • First Come First Served

Discuss it

Question 8

Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:

  • 256 Mbyte, 19 bits

  • 256 Mbyte, 21 bits

  • 512 Mbyte, 20 bits

  • 64 GB, 28 bits

Discuss it

Question 9

Match the following w.r.t. Input/Output management 37

  • (1)

  • (2)

  • (3)

  • (4)

Discuss it

Question 10

Consider a disk system with 100 cylinders. The request to access the cylinders occur in the following sequences 4, 37, 10, 7, 19, 73, 2, 15, 6, 20 Assuming the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first algorithm is used.

  • 95 msec

  • 119 msec

  • 233 msec

  • 276 msec

Discuss it

There are 76 questions to complete.

Take a part in the ongoing discussion