Operating System MCQs with Answers
Practice important Operating System MCQs with answers and explanations.
Chapter: 31
Q841:
What is a characteristic of fixed-size partitions in MFT?
A. Partition sizes cannot change
B. Processes are allowed to grow dynamically
C. Memory fragmentation is eliminated
D. Multiple processes can share the same partition
Correct Answer:
A
Chapter: 31
Q842:
Which method does MFT use for memory protection?
A. Storage keys
B. Address translation
C. Segmentation
D. Memory paging
Correct Answer:
A
Chapter: 31
Q843:
What happens when a process in MFT terminates?
A. The partition becomes available for another process
B. The process is moved to the disk
C. The partition size is reduced
D. The memory is cleared
Correct Answer:
A
Chapter: 31
Q844:
In MFT, how are processes loaded into memory?
A. Using a scheduling algorithm
B. From an input queue into free partitions
C. From memory disk into the system partition
D. Using a paging method
Correct Answer:
B
Chapter: 31
Q845:
The main memory in a system with contiguous allocation is divided into which two main sections?
A. Operating system and user processes
B. User processes and swap space
C. Kernel and heap partitions
D. OS code and I/O buffers
Correct Answer:
A
Chapter: 31
Q846:
In MFT, how are partition boundaries handled?
A. They are set at boot time and are not movable
B. They can be adjusted dynamically
C. They are decided based on the process size
D. They are based on priority levels
Correct Answer:
A
Chapter: 31
Q847:
What is a primary concern with swapping processes that have pending I/O operations?
A. The swapped-out process may attempt to access memory occupied by another process
B. The I/O operations may be lost
C. Memory space might not be enough for other processes
D. Swapping causes high transfer time
Correct Answer:
A
Chapter: 31
Q848:
What is the advantage of using base/limit registers for protection in memory management?
A. They make it easier to move a job
B. They provide better space allocation
C. They avoid memory fragmentation
D. They speed up the swapping process
Correct Answer:
A
Chapter: 31
Q849:
In memory management, which technique ensures that only a single process resides in each partition in MFT?
A. Fixed partitioning
B. Multiple partitioning with one process
C. Fixed size partitions with multiple processes
D. Shared partition allocation
Correct Answer:
A
Chapter: 31
Q850:
What is the purpose of the relocation register in memory management?
A. Store the base address of the process
B. Load process segments into different memory locations
C. Translate logical addresses into physical addresses
D. Identify the start of memory partitions
Correct Answer:
C
Chapter: 31
Q851:
Which of the following is true about MFT with a single input queue?
A. There is a single queue for all partitions
B. Multiple queues exist for each partition
C. No input queue is used
D. Processes are not queued
Correct Answer:
A
Chapter: 31
Q852:
Swapping involves transferring processes between memory and __________.
A. A backing store
B. Temporary storage
C. Shared memory
D. Kernel space
Correct Answer:
A
Chapter: 31
Q853:
What does MFT use to allocate memory to processes?
A. First-fit, best-fit, and worst-fit algorithms
B. Fixed-size partitions only
C. Flexible partitioning
D. Priority-based scheduling algorithms
Correct Answer:
A
Chapter: 31
Q854:
What is a disadvantage of MFT with multiple queues?
A. Wasted memory space due to empty partitions
B. Processes cannot be swapped out
C. The input queue becomes too large
D. Multiple queues lead to fragmentation
Correct Answer:
A
Chapter: 31
Q855:
Which of the following is true about internal fragmentation in MFT?
A. It occurs when there is wasted space within a partition
B. A partition becomes too large
C. The partition boundaries change dynamically
D. Processes cannot be moved between partitions
Correct Answer:
A
Chapter: 31
Q856:
The roll-out, roll-in swapping technique is used in which of the following scheduling algorithms?
A. Priority-based scheduling
B. Round-robin scheduling
C. First-come-first-served scheduling
D. Fair-share scheduling
Correct Answer:
A
Chapter: 31
Q857:
Swapping is constrained by which of the following in a multiprogramming environment?
A. Quantum and pending I/O
B. Acknowledgment time for swap requests
C. Quantum only
D. Swap in/out speed
Correct Answer:
B
Chapter: 31
Q858:
Contiguous memory allocation is characterized by __________.
A. Each process being contained in a single block of memory
B. Memory being divided into fixed partitions
C. Processes being stored in separate segments
D. Multiple processes sharing the same memory block
Correct Answer:
A
Chapter: 32
Q859:
In the MVT scheme, the size of the partitions can _______.
A. be fixed
B. change with time
C. remain constant
D. be predetermined
Correct Answer:
B
Chapter: 32
Q860:
Which of the following is a characteristic of the MVT scheme?
A. Single partition
B. forced job size
C. internal fragmentation
D. dynamic address translation
Correct Answer:
D