Operating System MCQ Set 1
1. RAID level 3 supports a lower number of I/Os per second, because ___
a) Every disk has to participate in every I/O request
b) Only one disk participates per I/O request
c) I/O cycle consumes a lot of CPU time
d) All of the mentioned
Answer
Answer: a [Reason:] None.
2. RAID level _____ is also known as block interleaved parity organisation and uses block level striping and keeps a parity block on a separate disk.
a) 1
b) 2
c) 3
d) 4
Answer
Answer: d [Reason:] None.
3. A performance problem with ___ is the expense of computing and writing parity.
a) non-parity based RAID levels
b) parity based RAID levels
c) all RAID levels
d) none of the mentioned
Answer
Answer: b [Reason:] None.
4. In RAID level 4, one block read, accesses ____
a) only one disk
b) all disks simultaneously
c) all disks sequentially
d) none of the mentioned
Answer
Answer: a [Reason:] Other requests are allowed to be processed by other disks.
5. The overall I/O rate in RAID level 4 is :
a) low
b) very low
c) high
d) none of the mentioned
Answer
Answer: c [Reason:] All disks can be read in parallel.
6. A write of a block has to access :
a) the disk on which the block is stored
b) parity disk
c) a parity block
d) all of the mentioned
Answer
Answer: d [Reason:] None.
7. RAID level 5 is also known as :
a) bit-interleaved parity organization
b) block-interleaved parity organization
c) block-interleaved distributed parity
d) memory-style ECC organization
Answer
Answer: c [Reason:] None.
8. RAID level ____ spreads parity and data among all N+1 disks rather than storing data in N disks and parity in 1.
a) 3
b) 4
c) 5
d) 6
Answer
Answer: c [Reason:] None.
9. The potential overuse of a single parity disk is avoided in RAID level _______
a) 3
b) 4
c) 5
d) all of the mentioned
Answer
Answer: c [Reason:] None.
10. RAID level 0+1 is used because, RAID level 0 provides ______ whereas RAID level 1 provides ________
a) performance, redundancy
b) performance, reliability
c) redundancy, performance
d) none of the mentioned
Answer
Answer: b [Reason:] None.
11. If a disk fails in RAID level ___ rebuilding lost data is easiest.
a) 1
b) 2
c) 3
d) 4
Answer
Answer: a [Reason:] Data can be copied from another disk in raid level 1, for other raid levels all other disks have to be accessed.
12. Where performance and reliability are both important, RAID level ____ is used.
a) 0
b) 1
c) 2
d) 0+1
Answer
Answer:d [Reason:] None.
Operating System MCQ Set 2
1. Tertiary storage is built with :
a) a lot of money
b) unremovable media
c) removable media
d) secondary storage
Answer
Answer: c [Reason:] None.
2. Floppy disks are examples of :
a) primary storage
b) secondary storage
c) tertiary storage
d) none of the mentioned
Answer
Answer: c [Reason:] None.
3. A magneto-optic disk is :
a) primary storage
b) secondary storage
c) removable disk
d) none of the mentioned
Answer
Answer: c [Reason:] None.
4. The magneto-optic head flies _____ the disk surface than a magnetic disk head does.
a) much farther from
b) much closer to
c) at the same distance as
d) none of the mentioned
Answer
Answer: a [Reason:] None.
5. Optical disks ______ magnetism.
a) use
b) do not use
c) may use
d) none of the mentioned
Answer
Answer: b [Reason:] None.
6. The phase change disk is coated with a material that can freeze into either _______ or ________ state.
a) crystalline, solid
b) ice, amorphous
c) crystalline, liquid
d) crystalline, amorphous
Answer
Answer: d [Reason:] None.
7. WORM stands for :
a) write only, read mandatory
b) write once, read many times
c) write only once, read multiple
d) none of the mentioned
Answer
Answer: b [Reason:] None.
8. A tape holds _______ data than optical or magnetic disk cartridge.
a) lesser
b) more
c) much lesser
d) none of the mentioned
Answer
Answer: b [Reason:] None.
9. Random access to tape is _______ a disk seek.
a) much slower than
b) much faster than
c) comparable to
d) none of the mentioned
Answer
Answer: a [Reason:] None.
10. A typical tape drive is ________ a typical disk drive.
a) more expensive than
b) cheaper than
c) of the same cost as
d) none of the mentioned
Answer
Answer: a [Reason:] None.
11. The surface area of a tape is ________ the surface area of a disk.
a) much lesser than
b) much larger than
c) equal to
d) none of the mentioned
Answer
Answer: b [Reason:] None.
Operating System MCQ Set 3
1. The main memory accommodates :
a) operating system
b) cpu
c) user processes
d) all of the mentioned
Answer
Answer: a [Reason:] None.
2. The operating system is :
a) in the low memory
b) in the high memory
c) either low or high memory (depending on the location of interrupt vector)
d) none of the mentioned
Answer
Answer: c [Reason:] None.
3. In contiguous memory allocation :
a) each process is contained in a single contiguous section of memory
b) all processes are contained in a single contiguous section of memory
c) the memory space is contiguous
d) none of the mentioned
Answer
Answer: a [Reason:] None.
4. The relocation register helps in :
a) providing more address space to processes
b) a different address space to processes
c) to protect the address spaces of processes
d) none of the mentioned
Answer
Answer: c [Reason:] None.
5. With relocation and limit registers, each logical address must be _______ the limit register.
a) less than
b) equal to
c) greater than
d) none of the mentioned
Answer
Answer: a [Reason:] None.
6. The operating system and the other processes are protected from being modified by an already running process because :
a) they are in different memory spaces
b) they are in different logical addresses
c) they have a protection algorithm
d) every address generated by the CPU is being checked against the relocation and limit registers
Answer
Answer: d [Reason:] None.
7. Transient operating system code is code that :
a) is not easily accessible
b) comes and goes as needed
c) stays in the memory always
d) never enters the memory space
Answer
Answer: b [Reason:] None.
8. Using transient code, _______ the size of the operating system during program execution.
a) increases
b) decreases
c) changes
d) maintains
Answer
Answer: c [Reason:] None.
9. When memory is divided into several fixed sized partitions, each partition may contain ________
a) exactly one process
b) atleast one process
c) multiple processes at once
d) none of the mentioned
Answer
Answer: a [Reason:] None.
10. In fixed sized partition, the degree of multi programming is bounded by _____
a) the number of partitions
b) the CPU utilization
c) the memory size
d) all of the mentioned
Answer
Answer: a [Reason:] None
11. The first fit, best fit and worst fit are strategies to select a ______
a) process from a queue to put in memory
b) processor to run the next process
c) free hole from a set of available holes
d) all of the mentioned
Answer
Answer: c [Reason:] None.
Operating System MCQ Set 4
1. In internal fragmentation, memory is internal to a partition and :
a) is being used
b) is not being used
c) is always used
d) none of the mentioned
Answer
Answer: b [Reason:] None.
2. A solution to the problem of external fragmentation is :
a) compaction
b) larger memory space
c) smaller memory space
d) none of the mentioned
Answer
Answer: a [Reason:] None.
3. Another solution to the problem of external fragmentation problem is to :
a) permit the logical address space of a process to be noncontiguous
b) permit smaller processes to be allocated memory at last
c) permit larger processes to be allocated memory at last
d) all of the mentioned
Answer
Answer: a [Reason:] None.
4. If relocation is static and is done at assembly or load time, compaction ___
a) cannot be done
b) must be done
c) must not be done
d) can be done
Answer
Answer: a [Reason:] None.
5. The disadvantage of moving all process to one end of memory and all holes to the other direction, producing one large hole of available memory is :
a) the cost incurred
b) the memory used
c) the CPU used
d) all of the mentioned
Answer
Answer: a [Reason:] None.
6. ____ is generally faster than ___ and ___
a) first fit, best fit, worst fit
b) best fit, first fit, worst fit
c) worst fit, best fit, first fit
d) none of the mentioned
Answer
Answer: a [Reason:] None.
7. External fragmentation exists when :
a) enough total memory exists to satisfy a request but it is not contiguous
b) the total memory is insufficient to satisfy a request
c) a request cannot be satisfied even when the total memory is free
d) none of the mentioned
Answer
Answer: a [Reason:] None.
8. External fragmentation will not occur when :
a) first fit is used
b) best fit is used
c) worst fit is used
d) no matter which algorithm is used, it will always occur
Answer
Answer: d [Reason:] None.
9. Sometimes the overhead of keeping track of a hole might be :
a) larger than the memory
b) larger than the hole itself
c) very small
d) all of the mentioned
Answer
Answer: b [Reason:] None.
10. When the memory allocated to a process is slightly larger than the process, then :
a) internal fragmentation occurs
b) external fragmentation occurs
c) both internal and external fragmentation occurs
d) neither internal nor external fragmentation occurs
Answer
Answer: a [Reason:] None.
Operating System MCQ Set 5
1. Physical memory is broken into fixed-sized blocks called ________
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer
Answer: a [Reason:] None.
2. Logical memory is broken into blocks of the same size called ___
a) frames
b) pages
c) backing store
d) none of the mentioned
Answer
Answer: b [Reason:] None.
3. Every address generated by the CPU is divided into two parts :
a) frame bit & page number
b) page number & page offset
c) page offset & frame bit
d) frame offset & page offset
Answer
Answer: b [Reason:] None.
4. The ____ is used as an index into the page table.
a) frame bit
b) page number
c) page offset
d) frame offset
Answer
Answer: b [Reason:] None.
5. The _____ table contains the base address of each page in physical memory.
a) process
b) memory
c) page
d) frame
Answer
Answer: c [Reason:] None.
6. The size of a page is typically :
a) varied
b) power of 2
c) power of 4
d) none of the mentioned
Answer
Answer: b [Reason:] None.
7. If the size of logical address space is 2 to the power of m, and a page size is 2 to the power of n addressing units, then the high order _____ bits of a logical address designate the page number, and the ____ low order bits designate the page offset.
a) m, n
b) n, m
c) m – n, m
d) m – n, n
Answer
Answer: d [Reason:] None.
8. With paging there is no ________ fragmentation.
a) internal
b) external
c) either type of
d) none of the mentioned
Answer
Answer: b [Reason:] None.
9. The operating system maintains a ______ table that keeps track of how many frames have been allocated, how many are there, and how many are available.
a) page
b) mapping
c) frame
d) memory
Answer
Answer: c [Reason:] None.
10. Paging increases the ______ time.
a) waiting
b) execution
c) context – switch
d) all of the mentioned
Answer
Answer: c [Reason:] None.
11. Smaller page tables are implemented as a set of _______
a) queues
b) stacks
c) counters
d) registers
Answer
Answer: d [Reason:] None.
12. The page table registers should be built with _______
a) very low speed logic
b) very high speed logic
c) a large memory space
d) none of the mentioned
Answer
Answer: b [Reason:] None.
13. For larger page tables, they are kept in main memory and a ____ points to the page table.
a) page table base register
b) page table base pointer
c) page table register pointer
d) page table base
Answer
Answer: a [Reason:] None.
14. For every process there is a ____
a) page table
b) copy of page table
c) pointer to page table
d) all of the mentioned
Answer
Answer: a [Reason:] None.
15. Time taken in memory access through PTBR is :
a) extended by a factor of 3
b) extended by a factor of 2
c) slowed by a factor of 3
d) slowed by a factor of 2
Answer
Answer: d [Reason:] None.
