answers 100%.
2025-2026 CNIT 176 1-15 MCQ accurate
answers 100%.
1. What is multiprogramming?
A) Running multiple processors simultaneously
B) Allocating memory to a single program
C) Keeping multiple programs in main memory at the same time
D) Running a single program on multiple computers - ANSWER C
2. What is a frame in memory management?
A) A variable-sized portion of main memory
B) A fixed size portion of main memory that holds a process page
C) A temporary storage for CPU instructions
D) A graphical user interface component - ANSWER B
3. What was the first operating system approach?
A) Multiprogramming
B) Time-sharing
C) Real-time processing
D) Batch processing - ANSWER D
4. What is a page in memory management?
A) A variable-sized portion of a process
B) A fixed size portion of a process that is stored into a memory frame
C) The entire memory allocated to a process
D) A segment of the hard drive - ANSWER B
,2025-2026 CNIT 176 1-15 MCQ accurate
answers 100%.
5. What does time sharing in operating systems allow?
A) Multiple users to interact with a computer at the same time
B) Only one user to interact with the computer at a time
C) Users to share physical hardware
D) Only system processes to run simultaneously - ANSWER A
6. What is swapping in memory management?
A) The act of switching off the computer
B) Switching tasks between different CPUs
C) Transferring data between two hard drives
D) The act of bringing in a page from secondary memory, often causing another page to be written back
to secondary memory - ANSWER D
7. What is thrashing in memory management?
A) Efficient processing of multiple pages
B) Inefficient processing caused by constant page swaps
C) Storing all pages in main memory
D) Defragmenting the hard drive - ANSWER B
8. How many programs are in memory in single contiguous memory management?
A) Only 1 program
B) 2 programs - operating system and application program
C) Multiple programs in a queue
D) No programs, only the operating system - ANSWER A
9. What is a process control block (PCB)?
A) A program loaded into memory
B) A data structure used by the operating system to manage information about a process
,2025-2026 CNIT 176 1-15 MCQ accurate
answers 100%.
C) A memory partition
D) A hardware device driver - ANSWER B
10. How is memory divided in fixed partitions?
A) Dynamically as needed
B) Into fixed number of partitions in which programs can be loaded
C) Into random segments
D) By the user manually - ANSWER B
11. What occurs during a context switch?
A) The system shuts down
B) The exchange of register information
C) A new program is loaded
D) The memory is cleared - ANSWER B
12. In which scheduling algorithm are processes moved to the CPU in the order they arrive in the
running state?
A) Shortest job next
B) Round robin
C) First come, first serve
D) Preemptive scheduling - ANSWER C
13. In the shortest job next scheduling algorithm, which process is moved into the running state first?
A) The process with the longest estimated running time
B) The process with the shortest estimated running time
C) The process with the highest priority
D) The process that arrived first - ANSWER B
, 2025-2026 CNIT 176 1-15 MCQ accurate
answers 100%.
14. How are partitions created in dynamic partition memory management?
A) As needed to fit the programs waiting to be loaded
B) At system startup
C) Only once when the system is installed
D) By the user manually - ANSWER A
15. In non-preemptive scheduling, when does the currently executing process give up the CPU?
A) Voluntarily
B) When the system decides
C) At a fixed time interval
D) When a higher priority process arrives - ANSWER A
16. In preemptive scheduling, who decides to favor another process?
A) The user
B) The currently executing process
C) The operating system
D) The hardware - ANSWER C
17. What is turnaround time in process scheduling?
A) The time taken to switch between processes
B) The amount of time between when a process arrives in the ready state the first time and when it exits
the running state for the last time
C) The time a process spends in the waiting state
D) The time taken for a process to execute an instruction - ANSWER B
18. What happens in the round robin scheduling algorithm?
A) Each process runs until it finishes