Study this operating systems deck actively

Operating systems questions often test whether you can distinguish concepts that sound similar: a process from a thread, a page fault from a page replacement, or deadlock prevention from avoidance. A useful flashcard should make you retrieve one clear fact, then check whether your answer was precise enough—not just vaguely familiar.

Work through the deck below one card at a time. Read the question, say or write your answer, then reveal the answer and compare. In MySummaries, grade your recall with the four buttons: Again if you could not retrieve it, Hard if you needed substantial effort or missed a detail, Good if it came back correctly, and Easy if it was immediate and exact. Choose based on what happened, not what you hope to remember next time. The grade determines when the card returns for another review.

Do not give yourself credit for an answer that only uses the right keyword. For example, saying “a page fault means the page is missing” is incomplete: the operating system must handle the fault, and the page may need to be fetched from secondary storage. The point of a card is to practise the distinction until you can state it cleanly.

A MySummaries deck on this topic could look like this:

Cards — Operating Systems17 due

What is the difference between a program and a process?

A program is passive code stored as a file; a process is an executing instance with state and allocated resources.

All 17 cards
What is the difference between a program and a process?A program is passive code stored as a file; a process is an executing instance with state and allocated resources.
What information does a process control block (PCB) hold?Process-management information such as the process state, program counter, CPU registers, scheduling information and memory-management information.
What happens during a context switch?The OS saves the CPU state of the running process or thread and restores the saved state of another, so execution can resume there.
Which resources are typically shared by threads in one process, and which execution state is private?Threads share the process address space and resources such as open files; each thread has its own stack, program counter and register state.
What is a race condition?A result that depends on the timing or interleaving of concurrent operations on shared state, where at least one operation modifies that state.
What does mutual exclusion protect?It ensures that at most one thread at a time enters a critical section protected by the same lock, preventing simultaneous access to that section.
How does a counting semaphore differ from a binary semaphore?A counting semaphore represents a count of available instances of a resource; a binary semaphore has only two states and is often used for signalling or simple exclusion.
Name the four necessary conditions for deadlock.Mutual exclusion, hold and wait, no pre-emption, and circular wait. All four must hold for deadlock to be possible.
What makes a state safe in the Banker's algorithm?There is a safe sequence of processes in which each process can obtain its remaining maximum need from currently available resources plus resources released by earlier completed processes.
What does a page table do?It maps a process's virtual page numbers to physical frame numbers and records relevant status or protection information.
What is the purpose of a translation lookaside buffer (TLB)?It caches recent virtual-to-physical address translations so the processor can avoid walking the page table for every memory reference when the translation is present.
What is a page fault?An exception raised when a memory reference cannot be completed using the current page-table state; the OS checks whether it is valid and may load the page before restarting the instruction.
What is Belady's anomaly?With FIFO page replacement, increasing the number of page frames can sometimes increase the number of page faults.
How does least recently used (LRU) page replacement choose a victim?It replaces the page that has not been referenced for the longest time, using past recency as a predictor of future use.
What is thrashing?A condition in which processes spend so much time servicing page faults and swapping pages that useful execution falls substantially.
In round-robin scheduling, what does the time quantum control?It sets the maximum CPU time a runnable process receives before it is pre-empted and moved behind other runnable processes, if it has not blocked or finished.
What is the difference between deadlock prevention and deadlock avoidance?Prevention restricts the system so at least one necessary deadlock condition cannot hold; avoidance checks each allocation request and grants it only if the resulting state remains safe.

That is a MySummaries deck, filled with operating systems material. Yours is written from your own notes. Start free

Check the core facts behind the deck

After the first pass, look at the core checklist. It is a compact test of whether you can reconstruct the main relationships without relying on the wording of individual cards. Read each line and expand it aloud: name the conditions, explain the mechanism, or give the consequence. If an item feels like a string of terms rather than an explanation, revisit its cards.

These are the core facts this deck was cut from:

Must not miss coreOperating Systems
Deadlock requires all four conditions: mutual exclusion, hold and wait, no pre-emption, and circular wait.
A process owns an execution context and resources; threads in one process share its address space, but keep separate stacks and CPU execution state.
Virtual memory maps pages to physical frames; a TLB caches translations, and a page fault triggers OS handling that may load a valid page.
FIFO can show Belady's anomaly; LRU evicts the page least recently used, while thrashing means page-fault handling is displacing useful work.
Round-robin uses a time quantum; deadlock avoidance grants requests only when the resulting state is safe, unlike prevention, which breaks a necessary condition.

The checklist is not a substitute for explaining the ideas. Try to connect each fact to a small example. For deadlock, imagine two processes each holding one resource while waiting for the other: circular wait and hold-and-wait are present, but also check mutual exclusion and whether resources can be pre-empted. For virtual memory, distinguish the TLB lookup—which speeds up translation—from a page fault, which requires operating-system handling. These contrasts are common sources of imprecise answers.

Turn weak answers into targeted reviews

When a card returns, answer it before looking. If you got the answer wrong twice, make the next review more specific: say which term you confused and state the correction. “I mixed up avoidance and prevention” is more useful than “I need to revise deadlocks”. Then review the relevant core line and retest the card later.

A MySummaries remediation tray can bring a repeatedly missed distinction back as a direct prompt:

Remediation tray

You lost this mark twice: does deadlock avoidance break a necessary condition, or check that granting a request leaves the system in a safe state?

Add cardDismiss

For this prompt, a complete answer is: avoidance checks whether the allocation leaves a safe state; prevention restricts the system so at least one necessary deadlock condition cannot hold. If you only recalled “safe state” but could not contrast the terms, mark the card Hard rather than Good. The distinction should be retrievable both ways: given the method, identify its purpose, and given the purpose, name the method.

A review routine that keeps the deck useful

Use the deck in short sessions and let the cards you miss set the next session’s focus. Start by answering due cards without notes. For each miss, identify the precise gap: a missing condition, a reversed relationship, or a term you cannot define. Then revisit only the relevant topic in your course material and try the card again later.

Every few sessions, shuffle the order mentally by explaining the core checklist without reading it. This checks whether you understand the concepts outside the original question wording. You can also make a small comparison table in your notes—for example, process versus thread, prevention versus avoidance, or FIFO versus LRU—but keep each flashcard focused on one fact. If a card repeatedly requires a long explanation, split it into smaller retrieval questions rather than making the answer harder to learn.

Do not grade a card Easy simply because its answer looks obvious once revealed. Easy means you recalled it promptly before seeing the answer. Conversely, if you knew the answer but needed time to retrieve it, Hard is useful information: the fact is not yet stable. Honest grading gives the review schedule a better signal and prevents familiar-looking answers from being mistaken for recall.

How MySummaries helps

Build an Operating Systems revision board from your own course material, then generate and review flashcards from it. Start at MySummaries.