Operating System Basics Questions and Answers
Operating System Basics questions with answers are among the most commonly asked in technical interviews and exams. This section covers core OS concepts like process management, memory allocation, file systems, and scheduling algorithms. Practicing programming questions and answers on operating systems helps strengthen your conceptual clarity and practical understanding of computer architecture. Frequently featured in GATE, TCS, Infosys, and Wipro placements, these MCQs provide a balanced mix of theoretical and applied knowledge. Clear explanations make this section an ideal resource for anyone preparing for system-related roles or competitive exams.
Operating System Basics
Showing 10 of
563 questions
411. In disk scheduling, the seek time is
- The time taken to position the head at the track
- The time taken to reach the beginning of sector once the track is selected.
- A and B both
- None of these
412. The access time in disk scheduling is
- The time taken to position the head at the track
- The time taken to reach the beginning of the sector of the track.
- The sum of seek time and rotational delay.
- None of these.
413. The transfer time in disk scheduling is
- Proportional to rotation speed.
- Inversely proportional to rotation speed.
- Equal to rotation speed.
- None of these.
414. In last- in -first- out, disk scheduling policy.
- Recently received request is entertained at the last.
- Recently received request is entertained first.
- Requests are selected at random
- None of these
415. In last- in -first- out, disk scheduling policy.
- Recently received request is entertained at the last.
- Recently received request is entertained first.
- Requests are selected at random
- None of these
416. In disk scheduling, SCAN algorithm states
- The arm is required to move in one direction only
- The arm can be moved in any direction.
- The arm is fixed.
- None of these
417. RAID (Redundant Array of independent Disks) Scheme consists of
- Five levels from one to six.
- Six levels , from zero to five
- Seven Levels, rom zero to six.
- None of these
418. In RAID scheme, which of the RAIL level does not use parity calculation in redundancy achievement
- RAIL 4
- RAIL 3
- RAIL 2
- RAIL 1
419. In system buffer cache, used in UNIX, following not true.
- it is a disk cache
- It is not a disk cache
- Data transfer between buffer cache and user process space always occurs using DMA.
- I/O operations with disk are handled through buffer code.
420. In disk scheduling, the shortest service time first policy selects the disk request that
- In cure the maximum seek time
- In cure the minimum seek time
- Is received first
- Is received at last