Operating Systems Flashcards
19 cards from real IKM practice questions. Tap to flip, then mark Knew It or Still Learning — missed cards come back until you master them.
Read the first 19 Operating Systems flashcards as text
Which scheduling algorithm gives each process an equal time slice in circular order?
Answer: Round Robin
Round Robin assigns a fixed time quantum to each process in circular order.
What is the primary purpose of virtual memory?
Answer: Allow programs to use more memory than physically available
Virtual memory uses disk space as an extension of RAM, enabling programs to address more memory than physically installed.
Which file system is the default for modern Linux distributions?
Answer: ext4
ext4 is the default file system for most modern Linux distributions, offering journaling and large file support.
What is a deadlock in operating systems?
Answer: Two or more processes waiting for resources held by each other
A deadlock occurs when processes are permanently blocked, each waiting for a resource held by another.
Which system call creates a new process in Unix/Linux?
Answer: fork()
fork() creates a child process that is a copy of the parent process.
What is the purpose of a semaphore?
Answer: Synchronize access to shared resources between processes
A semaphore controls access to shared resources using wait and signal operations.
What is the difference between a process and a thread?
Answer: Processes have separate address spaces; threads share the same address space
Processes have independent memory spaces while threads share code, data, and heap.
Which page replacement algorithm is optimal but impractical?
Answer: Optimal (Belady's)
Belady's Optimal algorithm replaces the page not used for the longest future time, requiring future knowledge.
What is the primary advantage of a microkernel over a monolithic kernel?
Answer: Better modularity and fault isolation
Microkernels move drivers and services to user space, providing better fault isolation.
What is thrashing in virtual memory?
Answer: Excessive page faulting that severely degrades performance
Thrashing occurs when the system spends more time swapping pages than executing instructions.
Which I/O scheduling algorithm services requests in arrival order?
Answer: FCFS
FCFS processes disk I/O requests in the order received.
What is the role of the bootloader?
Answer: Load the OS kernel into memory and start execution
The bootloader loads the kernel from storage into RAM and transfers control to it.
Which page replacement algorithm can suffer from Belady's anomaly, where adding more frames increases page faults?
Answer: First-In, First-Out (FIFO)
FIFO is not a stack algorithm, so more frames can occasionally produce more page faults.
A low-priority task holds a mutex needed by a high-priority task while a medium-priority task preempts it. Which technique best resolves this?
Answer: Priority inheritance
Priority inheritance temporarily raises the lock holder's priority so it can finish and release the mutex.
Immediately after a UNIX fork() on a modern system using copy-on-write, what happens to the parent's memory pages?
Answer: Pages are shared read-only and copied only when either process writes
Copy-on-write defers physical copying until a write fault occurs on a shared page.
A process has exited but still appears in the process table with state 'Z'. What is the most likely cause?
Answer: Its parent has not yet called wait() to collect its exit status
A zombie keeps its process-table entry until the parent reaps it with wait() or waitpid().
What does a Translation Lookaside Buffer (TLB) cache?
Answer: Virtual-to-physical address translations
The TLB stores recent page-table entries so address translation avoids extra memory accesses.
A system shows very high disk activity and low CPU utilization because processes constantly page in and out. Which approach most directly addresses this?
Answer: Reduce the number of active processes based on their working sets
Thrashing is relieved by ensuring each active process's working set fits in memory, often by suspending processes.
The Banker's algorithm is an example of which deadlock strategy?
Answer: Deadlock avoidance
It grants requests only if the resulting state is safe, avoiding deadlock dynamically.
Written and edited by Nathan Beja, founder of Practice Test Geeks, with AI assistance. Exam facts are checked against the official sources linked below. Editorial policy
Sources & references
Exam facts on this page (fees, format, dates, passing scores) are checked against these official sources; the date is our last check. Editorial policy
- ikmnet.com — Test delivery, passing score · verified Oct 2026
- online.ikmnet.com — Eligibility, exam format, retake policy, score release, time limit · verified Oct 2026