Chapter 5 - Input Output
Chapter 5 - Input Output
Chapter 5 - Input Output
6. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on their arrival time?
a) First-Come, First-Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) SCAN
d) C-LOOK
Answer: a) First-Come, First-Serve (FCFS)
7. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on the shortest seek time?
a) First-Come, First-Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) SCAN
d) C-LOOK
Answer: b) Shortest Seek Time First (SSTF)
8. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on their location on the disk?
a) First-Come, First-Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) SCAN
d) C-LOOK
Answer: c) SCAN
9. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on their location on the disk and their direction of movement?
a) First-Come, First-Serve (FCFS)
b) Shortest Seek Time First (SSTF)
c) SCAN
d) C-LOOK
Answer: d) C-LOOK
11. Which of the following I/O buffering techniques stores data in a first-in,
first-out (FIFO) queue?
a) Block buffering
b) Character buffering
c) Line buffering
d) None of the above
Answer: b) Character buffering
12. Which of the following I/O buffering techniques stores data in fixed-size
blocks?
a) Block buffering
b) Character buffering
c) Line buffering
d) None of the above
Answer: a) Block buffering
---
13. What is Input/Output (I/O) in an operating system?
a) The process of executing instructions in a CPU
b) The process of transferring data between memory and the CPU
c) The process of transferring data between peripheral devices and the CPU
d) The process of managing files and directories in a file system
Answer: c) The process of transferring data between peripheral devices and the CPU
16. Which of the following is not a function of the I/O manager in an operating
system?
a) Providing a standard interface for device drivers
b) Managing I/O requests from user applications
c) Allocating memory to device drivers
d) Performing I/O operations on behalf of user applications
Answer: c) Allocating memory to device drivers
17. Which of the following is not a component of the I/O subsystem in an operating
system?
a) Device drivers
b) I/O manager
c) Interrupt handler
d) Virtual memory manager
Answer: d) Virtual memory manager
19. Which of the following I/O operations reads data from a device into memory?
a) Open
b) Close
c) Read
d) Write
Answer: c) Read
20. Which of the following I/O operations writes data from memory to a device?
a) Open
b) Close
c) Read
d) Write
Answer: d) Write
22. Which of the following I/O request types requires the CPU to wait for the I/O
operation to complete?
a) Synchronous
b) Asynchronous
c) Interrupt-driven
d) None of the above
Answer: a) Synchronous
23. Which of the following I/O request types allows the CPU to continue executing
while the I/O operation is in progress?
a) Synchronous
b) Asynchronous
c) Interrupt-driven
d) None of the above
Answer: b) Asynchronous
29. Which of the following is not a method for performing I/O operations?
a) Programmed I/O
b) Interrupt-driven I/O
c) Direct memory access (DMA)
d) Multi-threaded I/O
Answer: d) Multi-threaded I/O
31. Which of the following I/O operations requires the least amount of overhead?
a) Programmed I/O
b) Interrupt-driven I/O
c) DMA
d) All I/O operations have the same amount of overhead
Answer: c) DMA
40. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on their arrival time?
a) FCFS (First Come First Serve)
b) SSTF (Shortest Seek Time First)
c) SCAN
d) C-SCAN
Answer: a) FCFS (First Come First Serve)
41. Which of the following I/O scheduling algorithms prioritizes I/O requests based
on the shortest seek time?
a) FCFS (First Come First Serve)
b) SSTF (Shortest Seek Time First)
c) SCAN
d) C-SCAN
Answer: b) SSTF (Shortest Seek Time First)
42. Which of the following is a disadvantage of the FCFS (First Come First Serve)
scheduling algorithm?
a) It can lead to long waiting times for I/O requests with large seek times
b) It can prioritize I/O requests based on their arrival time, which may not be the
most efficient
c) It can cause starvation for low-priority I/O requests
d) It can be complex and difficult to implement
Answer: a) It can lead to long waiting times for I/O requests with large seek times
43. Which of the following I/O scheduling algorithms scans the disk from one end to
the other, servicing all requests in between?
a) FCFS (First Come First Serve)
b) SSTF (Shortest Seek Time First)
c) SCAN
d) C-SCAN
Answer: c) SCAN
44. Which of the following I/O scheduling algorithms scans the disk from one end to
the other, but only services requests in one direction, then jumps back to the
beginning and repeats the process?
a) FCFS (First Come First Serve)
b) SSTF (Shortest Seek Time First)
c) SCAN
d) C-SCAN
Answer: d) C-SCAN
45. Which of the following I/O techniques is used to increase the efficiency of
disk accesses by temporarily storing frequently accessed data in memory?
a) Caching
b) Buffering
c) Spooling
d) Paging
Answer: a) Caching
46. Which of the following I/O techniques is used to temporarily store data that is
being transferred between devices to reduce the overhead of frequent device
accesses?
a) Caching
b) Buffering
c) Spooling
d) Paging
Answer: b) Buffering
47. Which of the following I/O techniques is used to temporarily store data that is
waiting to be printed, so that the process that requested the print can continue
executing?
a) Caching
b) Buffering
c) Spooling
d) Paging
Answer: c) Spooling
54. Which of the following I/O techniques is most suitable for transferring a large
amount of data?
a) Programmed I/O
b) Interrupt-driven I/O
c) Direct Memory Access (DMA)
d) Bus mastering
Answer: c) Direct Memory Access (DMA)
55. Which of the following is not a benefit of using DMA for I/O operations?
a) Reduced CPU utilization
b) Increased system performance
c) Simpler device drivers
d) Reduced I/O latency
Answer: c) Simpler device drivers
57. Which of the following I/O scheduling algorithms provides equal access to all
processes in the system?
a) First-Come, First-Served (FCFS)
b) Shortest Job First (SJF)
c) Round Robin (RR)
d) Priority scheduling
Answer: c) Round Robin (RR)
58. Which of the following I/O scheduling algorithms favors processes with high I/O
requirements?
a) First-Come, First-Served (FCFS)
b) Shortest Job First (SJF)
c) Round Robin (RR)
d) Priority scheduling
Answer: d) Priority scheduling
59. Which of the following is not a factor that affects I/O performance?
a) Data transfer rate
b) Device characteristics
c) User interaction
d) CPU speed
Answer: d) CPU speed