HamiIT
Sign inGet started
Home
ADD CONTENT

Sign in Required

Please sign in to add content

Sign In
ProgramsBsc CSITSemester 4Operating SystemUnit 6: Device Management (6 Hrs.)
Chapter Study

Bsc CSIT Semester 4 – Operating System – Unit 6: Device Management (6 Hrs.)

Comprehensive questions and detailed answers for Unit 6: Device Management (6 Hrs.). Perfect for exam preparation and concept clarity.

17
Questions
115
Marks
Back to All Chapters
1
  1. Suppose that the disk drive has 50 cylinders, numbered from 0 to 49.
    The drive is currently serving the request at cylinder 20 and the previous request was at cylinder 25.
    The queue of pending requests is: 10, 22, 20, 2, 40, 6, 38 (in this order).
    A seek takes 6 msec per cylinder moved. How much seek time is needed for the following disk-scheduling algorithms?
    • a) First-Come, First-Served (FCFS)
    • b) Shortest Seek Time First (SSTF)
    • c) SCAN
    • d) LOOK
HardNumerical10 marks2070(TU Final)
2

What is “device independence”? Define.

MediumTHEORY5 marks2070(TU Final)
3

Suppose the head of a moving- head disk with 200 tracks, numbered 0 to 199 is currently serving request at tracks 143 and has finished a request at track 125. The queue it requests is kept in the FIFO order 86, 147, 91, 177, 94, 150, 102, 175, 130. What is the total head movement needed to satisfy these request for the following disk- scheduling algorithms?
i. FCFS ii. SSTF iii. SCAN iv. LOOK

MediumNumerical10 marks2071(TU Final)
4

What is DMA? Explain how it works.

MediumTHEORY5 marks2071(TU Final)
5

How does DMA increase system concurrency? How does it complicate hardware design?

MediumTHEORY5 marks2072(TU Final)
6

Write short notes on:
(a) Disk formatting
(b) Memory Mapped I/O

MediumTHEORY5 marks2072(TU Final)
7

What is the main objective of disk scheduling algorithms? why SSTF is not practically feasible? Assume that we have disk with 100 tracks and currently head is at track number 35. What will be the seek time for the algorithms SCAN and LOOK for processing IO requests queue: 52, 67, 27, 11, 43, 85, 18, 75, 92, 8?

HardNumerical10 marks2076(TU Final)
8

When programmed IO is suitable than other IO handling techniques? Explain the process of IO handling using DMA.

MediumTHEORY5 marks2076(TU Final)
9

Why the concept of disk interleaving is important? Explain with suitable example.

MediumTHEORY5 marks2078(TU Final)
10

How DMA operation is performed? Consider a disk with 200 tracks and the queue has random requests from different processes in the order :45,48,29,17,80,150,28 45, 48, 29, 17, 80, 150, 2845,48,29,17,80,150,28 and 188188188. Find the seek time using FIFO,SSTFFIFO, SSTFFIFO,SSTF and SCANSCANSCAN. Assume the initial position of head as 100.

HardNumerical10 marks2080(TU Final)
11

Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing

the following request queue:

35,70,45,15,65,20,80,90,75,130.35, 70, 45, 15, 65, 20, 80, 90, 75, 130.35,70,45,15,65,20,80,90,75,130.

Suppose the disk has tracks numbered from 0 to 150 and assume the disk arm to be at 30 and moving outward.

HardTHEORY10 marks2081(TU Final)
12

Explain memory-mapped I/O.

MediumTHEORY5 marks2081(TU Final)
13

Define shell and system call. suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 95, and there is a queue of disk access requests for cylinders 82,170,43,140,24,16 and 190. Calculate the seek time for the disk scheduling algorithm FCFS,SSTF,SCAN and C-SCAN.

HardNumerical10 marks2079(TU Final)
14

Describe the working mechanism of DMA.

MediumTHEORY5 marks2079(TU Final)
15

What is the task of disk controller ? List some drawback of segmentation.

MediumTHEORY5 marks2079(TU Final)
16

Suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 10, and there is a queue of disk access requests for cylinders 30,85,90,100,105,110,135,30, 85, 90, 100, 105, 110, 135,30,85,90,100,105,110,135, and 145145145. Find the total seek time for the disk scheduling algorithm FCFS and SSTF. Assume the head is moving inward.

MediumNumerical5 marks2080(TU Final)
17

What are the advantages of using interrupt? Describe.

MediumTHEORY5 marks2080(TU Final)
Showing 17 questions

Exam Years

Past question papers

2081
TU Final•2 questions
2080
TU Final•1 questions
2080
TU Final•2 questions
2079
TU Final•3 questions
2078
TU Final•1 questions
2076
TU Final•2 questions
2072
TU Final•2 questions
2071
TU Final•2 questions
2070
TU Final•2 questions

Questions in Unit 6: Device Management (6 Hrs.)

3) Suppose that the disk drive has 50 cylinders, numbered from 0 to 49. The drive is currently serving the request at cylinder 20 and the previous request was at cylinder 25. The queue of pe

Marks: 10

Year: 2070 Final TU

Disk Scheduling Algorithms and Seek Time Calculation Given: - Cylinders: 0–49 - Current head: 20 - Previous request: 25 → direction = toward lower cylinders - Request queue: 10, 22, 20, 2, 40,

What is “device independence”? Define.

Marks: 5

Year: 2070 Final TU

Device Independence in Operating Systems Definition Device Independence is the property of an operating system that allows programs to access and use I/O devices without needing to know the details o

Suppose the head of a moving- head disk with 200 tracks, numbered 0 to 199 is currently serving request at tracks 143 and has finished a request at track 125. The queue it requests is kept in the FIFO

Marks: 10

Year: 2071 Final TU

Disk Scheduling Algorithms and Total Head Movement Given: - Disk tracks: 0 – 199 - Current head: 143 - Previous head: 125 → direction = toward higher tracks - Request queue (FIFO): 86, 147, 91,

What is DMA? Explain how it works.

Marks: 5

Year: 2071 Final TU

Direct Memory Access (DMA) 1. Definition - DMA (Direct Memory Access) is a method by which I/O devices can transfer data directly to or from main memory without involving the CPU for each byte/word t

How does DMA increase system concurrency? How does it complicate hardware design?

Marks: 5

Year: 2072 Final TU

Direct Memory Access (DMA) and System Concurrency 1. Definition of DMA: - Direct Memory Access (DMA) is a technique that allows peripheral devices to transfer data directly to/from main memory without

Write short notes on:\ (a) Disk formatting\ (b) Memory Mapped I/O

Marks: 5

Year: 2072 Final TU

Short Notes (a) Disk Formatting - Definition: Disk formatting is the process of preparing a storage device (hard disk, SSD, or floppy) to store data. - Purpose: 1. Creates a file system (e.g.,

What is the main objective of disk scheduling algorithms? why SSTF is not practically feasible? Assume that we have disk with 100 tracks and currently head is at track number 35. What will be the seek

Marks: 10

Year: 2076 Final TU

(a) Main objective of disk scheduling algorithms The main objective is to minimize disk head movement (seek time) so as to: - Reduce average seek time and latency, - Improve throughput (I/O requests s

When programmed IO is suitable than other IO handling techniques? Explain the process of IO handling using DMA.

Marks: 5

Year: 2076 Final TU

When Programmed I/O is More Suitable Programmed I/O (PIO) is suitable in situations where: - Low-speed I/O devices are used (e.g., keyboard, mouse, simple sensors). - Data transfer is small and infreq

Why the concept of disk interleaving is important? Explain with suitable example.

Marks: 5

Year: 2078 Final TU

Disk Interleaving 1. Definition: - Disk interleaving is the technique of rearranging sectors on a disk so that consecutive sectors of a file are spaced apart physically to match the speed of the CPU o

How DMA operation is performed? Consider a disk with 200 tracks and the queue has random requests from different processes in the order :\( 45, 48, 29, 17, 80, 150, 28\) and \(188\). Find the seek tim

Marks: 10

Year: 2080 Final TU

1. Direct Memory Access (DMA) Definition: - DMA is a method that allows I/O devices to transfer data directly to/from memory without CPU intervention. - CPU is only involved at the start and end o

Find the seek time using SCAN, C-SCAN, Look and C-Look disk scheduling algorithms for processing the following request queue: \(35, 70, 45, 15, 65, 20, 80, 90, 75, 130.\) Suppose the disk has tracks n

Marks: 10

Year: 2081 Final TU

Disk Scheduling — SCAN, C-SCAN, LOOK and C-LOOK Given: - Disk tracks: 0 .. 150 - Initial head position = 30 - Head direction = outward (toward higher track numbers) - Request queue: 35, 70, 45,

Explain memory-mapped I/O.

Marks: 5

Year: 2081 Final TU

Memory-Mapped I/O Definition: Memory-Mapped I/O (MMIO) is a technique where I/O devices are treated as if they are memory locations. The CPU can read from or write to these device registers using st

Define shell and system call. suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 95, and there is a queue of disk access requests for cylinders 82,170,4

Marks: 10

Year: 2079 Final TU

1. Definitions Shell - A shell is an interface between the user and the operating system. - It allows users to execute commands, run programs, and interact with the kernel. - Example: Bash, Zsh,

Describe the working mechanism of DMA.

Marks: 5

Year: 2079 Final TU

Direct Memory Access (DMA) Definition: DMA is a method by which an I/O device can transfer data directly to/from memory without continuous CPU intervention. It improves system efficiency by allowing

What is the task of disk controller ? List some drawback of segmentation.

Marks: 5

Year: 2079 Final TU

1. Task of Disk Controller A disk controller is a hardware component that manages the communication between the CPU and disk drives. Its main tasks are: 1. Data Transfer Management: - Controls re

Suppose a disk has 201 cylinders, numbered from 0 to 200. At same time the disk arm is at cylinder 10, and there is a queue of disk access requests for cylinders \(30, 85, 90, 100, 105, 110, 135,\) an

Marks: 5

Year: 2080 Final TU

Disk Scheduling Example Given: - Disk cylinders = 0 to 200 - Current head position = 10 - Request queue: 30, 85, 90, 100, 105, 110, 135, 145 - Head moving inward (toward lower cylinder numbers)

What are the advantages of using interrupt? Describe.

Marks: 5

Year: 2080 Final TU

Advantages of Using Interrupts Definition: - An interrupt is a signal sent to the CPU by hardware or software indicating an event that needs immediate attention. - It temporarily halts the CPU’s c

About Unit 6: Device Management (6 Hrs.) Questions

This page contains comprehensive questions from the Unit 6: Device Management (6 Hrs.) chapter of Operating System, part of the Bsc CSIT Semester 4 curriculum. All questions include detailed model answers from past TU exam papers.

Study Tips

  • Review concepts before attempting questions
  • Practice writing complete answers
  • Compare your answers with model solutions
  • Focus on questions from recent years
  • Use direct links (#question-ID) to bookmark and share specific questions

Related Resources

← Back to Operating System Chapters

Unit 6: Device Management (6 Hrs.) chapter questions with answers for Operating System (Bsc CSIT Semester 4). Prepare for TU exams with our comprehensive question bank and model answers.

H
Hami IT

Empowering IT students with quality education resources and comprehensive exam preparation materials.

Programs

  • Flutter
  • Java
  • DevOps

Company

  • About Us
  • Contact

Contact

  • 📧hamiit.dev@gmail.com
  • 📞+977 9813706443
  • 📍Kathmandu, Nepal

© 2026 Hami IT. All rights reserved.