Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Multiple Choice Questions
Q1041: What is the key difference between vfork() and fork()?
- A: vfork() suspends the parent process while creating the child
- B: vfork() creates a duplicate of the parent’s address space
- C: fork() requires less memory than vfork()
- D:
View Answer
A
Q1042: What happens when a page fault occurs in a user process?
- A: The process is terminated
- B: The page is loaded from the disk
- C: The page is removed from memory
- D: The page is swapped out
View Answer
B
Q1043: The operating system’s page-fault service routine includes which step when no free frame is available?
- A: Terminate the process
- B: Swap out a process
- C: Use a page replacement algorithm
- D: Allocate more memory
View Answer
C
Q1044: When a page’s modify bit is set, it indicates that _________.
- A: The page is being accessed
- B: The page has been modified
- C: The page is not in memory
- D: The page is being replaced
View Answer
B
Q1045: FIFO stands for _________.
- A: First In, Fast Out
- B: First In, First Out
- C: Fast In, Fast Out
- D: None of the above
View Answer
B
Q1046: What is the main disadvantage of the FIFO page replacement algorithm?
- A: High page fault rate
- B: Belady’s anomaly
- C: Complex to implement
- D: Low page fault rate
View Answer
B
Q1047: The optimal page replacement algorithm replaces the page that _________.
- A: Is least recently used
- B: Will not be used for the longest period of time
- C: Has not been accessed in the past
- D: Has been modified
View Answer
B
Q1048: The LRU page replacement algorithm approximates the optimal algorithm by replacing the page that _________.
- A: Was used the least recently
- B: Is least recently used
- C: Has been in memory for the longest time
- D: Is the oldest
View Answer
A
Q1049: The FIFO algorithm associates with each page _________.
- A: A reference string
- B: A time when it was last accessed
- C: A time when it was brought into memory
- D: The number of page faults
View Answer
C
Q1050: Which of the following page replacement algorithms is most difficult to implement due to future knowledge requirements?
- A: FIFO
- B: Optimal
- C: LRU
- D: None of the above
View Answer
B