Operating system MCQs:-
- What is the simplest page replacement algorithm? a) Least Recently Used (LRU) b) Optimal Page replacement c) First In First Out (FIFO) d) Belady's Anomaly
Answer: c) First In First Out (FIFO)
- What is Belady's anomaly? a) It is the condition when a process terminates due to deadlock. b) It is a scenario in which a process is waiting indefinitely for resources held by another process. c) It is a condition where the operating system cannot distinguish between different types of memory. d) It proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.
Answer: d) It proves that it is possible to have more page faults when increasing the number of page frames while using the First in First Out (FIFO) page replacement algorithm.
- Which page replacement algorithm replaces pages that are not used for the longest duration of time in the future? a) Least Recently Used (LRU) b) Optimal Page replacement c) First In First Out (FIFO) d) Belady's Anomaly
Answer: b) Optimal Page replacement
- Which page replacement algorithm replaces the page that is least recently used? a) Least Recently Used (LRU) b) Optimal Page replacement c) First In First Out (FIFO) d) Belady's Anomaly
Answer: a) Least Recently Used (LRU)
- What is a file directory? a) A collection of related information that is recorded on secondary storage b) A collection of logically related entities c) Collection of files along with their attributes, location, and ownership d) A single directory that is maintained for all the users
Answer: c) Collection of files along with their attributes, location, and ownership
- Which file allocation method allocates a single continuous set of blocks to a file at the time of file creation? a) Indexed Allocation b) Linked Allocation c) Contiguous Allocation d) Tree-Structured Allocation
Answer: c) Contiguous Allocation
- Which file allocation method allocates blocks on an individual basis, where each block contains a pointer to the next block in the chain? a) Indexed Allocation b) Linked Allocation c) Contiguous Allocation d) Tree-Structured Allocation
Answer: b) Linked Allocation
- What is Seek Time? a) Time taken to locate the disk arm to a specified track where the data is to be read or write. b) Time taken by the desired sector of the disk to rotate into a position so that it can access the read/write heads. c) Time to transfer the data. d) Sum of the time taken by all requests to perform I/O operations.
Answer: a) Time taken to locate the disk arm to a specified track where the data is to be read or write.
- What is Rotational Latency? a) Time taken to locate the disk arm to a specified track where the data is to be read or write. b) Time taken by the desired sector of the disk to rotate into a position so that it can access the read/write heads. c) Time to transfer the data. d) Average time spent by a request waiting to perform its I/O operation.
Answer: b) Time taken by the desired sector of the disk to rotate into a position so that it can access the read/write heads.
- Which disk scheduling algorithm addresses requests in the order they arrive in the disk queue? a) FCFS b) SSTF c) SCAN d) C-SCAN
Answer: a) FCFS
Similar posts:-
- C-programming MCQs part-1
- C-programming MCQs part-2
- C-programming MCQs part-3
- C-programming MCQs part-4
- C-programming MCQs part-5
- C-programming MCQs part-6
- COA MCQs part-1
- COA MCQs part-2
- COA MCQs part-3
- COA MCQs part-4
- Microprocessor 8085 MCQs part-1
- Microprocessor 8085 MCQs part-2
- Microprocessor 8085 MCQs part-3
- CSS MCQs part-1
- CSS MCQs part-2
- CSS MCQs part-3
- CSS MCQs part-4
- CSS MCQs part-5
- Engineering Mathematics -II MCQs part-1
- Engineering Mathematics -II MCQs part-2
- Engineering Mathematics -II MCQs part-3
- Engineering Mathematics -II MCQs part-4
- Engineering Mathematics -II MCQs part-5
