Operating System Basics Questions and Answers

Practice Mode
Showing 10 of 563 questions
Q411
In disk scheduling, the seek time is
  • A The time taken to position the head at the track
  • B The time taken to reach the beginning of sector once the track is selected.
  • C A and B both
  • D None of these
Answer: Option A
Q412
The access time in disk scheduling is
  • A The time taken to position the head at the track
  • B The time taken to reach the beginning of the sector of the track.
  • C The sum of seek time and rotational delay.
  • D None of these.
Answer: Option C
Q413
The transfer time in disk scheduling is
  • A Proportional to rotation speed.
  • B Inversely proportional to rotation speed.
  • C Equal to rotation speed.
  • D None of these.
Answer: Option A
Q414
In last- in -first- out, disk scheduling policy.
  • A Recently received request is entertained at the last.
  • B Recently received request is entertained first.
  • C Requests are selected at random
  • D None of these
Answer: Option B
Q415
In last- in -first- out, disk scheduling policy.
  • A Recently received request is entertained at the last.
  • B Recently received request is entertained first.
  • C Requests are selected at random
  • D None of these
Answer: Option B
Q416
In disk scheduling, SCAN algorithm states
  • A The arm is required to move in one direction only
  • B The arm can be moved in any direction.
  • C The arm is fixed.
  • D None of these
Answer: Option A
Q417
RAID (Redundant Array of independent Disks) Scheme consists of
  • A Five levels from one to six.
  • B Six levels , from zero to five
  • C Seven Levels, rom zero to six.
  • D None of these
Answer: Option C
Q418
In RAID scheme, which of the RAIL level does not use parity calculation in redundancy achievement
  • A RAIL 4
  • B RAIL 3
  • C RAIL 2
  • D RAIL 1
Answer: Option D
Q419
In system buffer cache, used in UNIX, following not true.
  • A it is a disk cache
  • B It is not a disk cache
  • C Data transfer between buffer cache and user process space always occurs using DMA.
  • D I/O operations with disk are handled through buffer code.
Answer: Option B
Q420
In disk scheduling, the shortest service time first policy selects the disk request that
  • A In cure the maximum seek time
  • B In cure the minimum seek time
  • C Is received first
  • D Is received at last
Answer: Option B

📚 More from Technical

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Technical
Back to Technical
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test