Operating Systems
About Computer Science MCQs
Master computer science concepts with our comprehensive MCQs. This section covers Artificial Intelligence, Programming, Data Structures, and more. Perfect for exam prep and interviews.
All Questions for: Operating Systems
Question 101: What is response time in interactive systems?
- A The time from submission of a request until the first response is produced
- B The total time required to complete an entire job
- C The time taken for a context switch to finish
- D The delay before a hardware interrupt is acknowledged
Explanation: Response time is the time from request submission until the first response is produced.
Question 102: Which scheduling algorithm assigns execution time slices to each process in a cyclic order?
- A Round Robin
- B First-Come, First-Served
- C Shortest Job First
- D Priority Scheduling
Explanation: Round Robin (RR) assigns a fixed time quantum to each process in cyclic order.
Question 103: What happens in Round Robin scheduling if the time quantum is extremely large?
- A It degenerates into First-Come, First-Served (FCFS) scheduling
- B It becomes equivalent to Shortest Job First scheduling
- C The system experiences excessive context switching overhead
- D All processes suffer from immediate starvation
Explanation: If the time quantum is very large, Round Robin degenerates into First-Come, First-Served (FCFS) scheduling.
Question 104: What happens in Round Robin scheduling if the time quantum is extremely small?
- A It causes high overhead due to excessive context switching
- B It converts into a non-preemptive FCFS scheduling queue
- C CPU utilization drops to zero permanently
- D Processes complete execution instantly without delay
Explanation: If the time quantum is too small, frequent context switches create significant overhead.
Question 105: What is multilevel queue scheduling?
- A Partitioning the ready queue into multiple separate queues with individual scheduling algorithms
- B Using a single queue that sorts processes by strict numerical priority
- C Moving processes dynamically between RAM and disk storage partitions
- D Executing multiple kernel threads simultaneously across CPU cores
Explanation: Multilevel queue scheduling partitions the ready queue into separate queues with distinct algorithms.
Question 106: What is multilevel feedback queue scheduling?
- A A scheduler allowing processes to move between queues based on execution behavior and waiting time
- B A fixed queue system where processes can never change their assigned queue
- C A disk I/O scheduling algorithm that optimizes read head positions
- D A memory allocation policy using feedback loops to prevent fragmentation
Explanation: Multilevel feedback queue scheduling allows processes to move between queues based on execution behavior and aging.
Question 107: What is a resource allocation graph used for?
- A To model process resource requests and allocations for deadlock detection
- B To map virtual memory addresses to physical RAM frames
- C To schedule disk track head movements efficiently
- D To organize directory hierarchies in a file system
Explanation: A resource allocation graph models process resource requests and allocations to detect or avoid deadlocks.
Question 108: What is a safe state in deadlock avoidance?
- A A state where the system can allocate resources to all processes in some order without deadlocking
- B A state where no processes are currently running in memory
- C A system state where all files are backed up to cloud storage
- D A security mode preventing unauthorized user login attempts
Explanation: A state is safe if the OS can allocate resources to all processes in some order without encountering a deadlock.
Question 109: What is a safe sequence?
- A An execution order of processes such that each can acquire its required resources safely
- B A sequence of boot instructions stored in the motherboard BIOS
- C A priority ranking of threads in the short-term ready queue
- D An ordered list of disk blocks forming a contiguous file
Explanation: A safe sequence is an execution order of processes such that each process can safely acquire its needed resources.
Question 110: What is starvation (indefinite blocking)?
- A A situation where a process is perpetually denied necessary resources to execute
- B A condition where physical memory runs completely out of free space
- C An error where the CPU overheats due to lack of cooling fan power
- D A network timeout caused by weak Wi-Fi signal strength
Explanation: Starvation is a scenario where a process is perpetually denied required resources to execute.
Question 111: What is logical address space?
- A The set of all logical addresses generated by the CPU for a program
- B The physical locations of RAM chips installed on the motherboard
- C The total storage capacity of the hard disk drive partition
- D The cache memory addresses inside the processor core
Explanation: Logical address space is the set of all logical addresses generated by the CPU for a program.
Question 112: What is physical address space?
- A The set of all physical addresses corresponding to memory unit locations
- B The virtual memory swap space allocated on secondary disk storage
- C The register addresses used by assembly language instructions
- D The network IP address assigned to the computer interface
Explanation: Physical address space is the set of all physical addresses corresponding to memory unit locations.
Question 113: What is the memory management unit (MMU)?
- A A hardware component that transforms virtual addresses into physical addresses
- B A software utility that cleans up unused RAM files
- C A storage controller managing SSD flash translation layers
- D An operating system daemon handling process swapping
Explanation: The MMU is a hardware device that transforms virtual addresses into physical addresses.
Question 114: What is a relocation register?
- A A register containing the base physical address added to logical addresses for relocation
- B A register tracking the number of page faults encountered
- C A hardware register storing the current program execution counter
- D A pointer to the top of the process call stack
Explanation: The relocation register contains the base physical address added to every logical address for relocation.
Question 115: What is swapping in memory management?
- A Temporarily moving a process between main memory and secondary storage disk
- B Exchanging two active threads on the same CPU core
- C Replacing a failing RAM stick with a new hardware module
- D Switching the active desktop user profile
Explanation: Swapping involves temporarily moving a process between main memory and secondary storage disk.
Question 116: What is a page table?
- A A data structure used to map virtual addresses to physical memory frames
- B A table tracking available hard disk blocks and file sectors
- C A directory listing all user accounts and permissions
- D A queue schedule table for short-term CPU tasks
Explanation: A page table is a data structure mapping virtual addresses to physical memory frames.
Question 117: What is demand paging?
- A Loading pages into memory only when they are referenced during execution
- B Loading the entire program into RAM before execution begins
- C Allocating fixed disk partitions upon user request
- D Streaming video data over a network connection
Explanation: Demand paging loads pages into memory only when they are referenced during execution.
Question 118: What is the second-chance (clock) page replacement algorithm?
- A A page replacement algorithm using a reference bit and a circular pointer resembling a clock hand
- B An algorithm that replaces pages twice a second to keep memory clean
- C A CPU scheduling algorithm based on wall-clock time intervals
- D A disk scheduling method synchronized with hardware timer chips
Explanation: The clock algorithm uses a reference bit and a circular queue pointer to give pages a second chance.
Question 119: What is the working set model in virtual memory?
- A A model based on program locality defining the set of pages currently in active use
- B A software suite used by developers to write operating system code
- C A hardware specification defining minimum RAM requirements
- D A configuration setting for network file sharing permissions
Explanation: The working set model defines the set of pages currently in active use based on locality of reference.