Practice
Solution
Step 1: Identify circular wait
Each process holds a resource and waits for another held by the next process, forming a cycle.Step 2: Understand consequences
Because each process waits for a resource held by another in the cycle, none can proceed, causing indefinite waiting.Step 3: Analyze other options
One process releases its resource voluntarily, breaking the cycle immediately assumes voluntary release, which is not guaranteed. The operating system preempts resources from one process to resolve the wait involves preemption, which is not part of the circular wait condition. Processes detect the cycle and terminate themselves automatically assumes automatic termination, which is not standard behavior.Final Answer:
Option A -> Option AQuick Check:
Circular wait leads to indefinite blocking without external intervention.
- Assuming processes will release resources voluntarily
- Confusing circular wait with preemption or automatic recovery
Solution
Step 1: Understand the initial action
Each philosopher picks up their left fork simultaneously, so all forks on the left side are held.Step 2: Analyze waiting condition
Each philosopher now waits for the right fork, which is held by their neighbor, creating a circular wait.Step 3: Identify the system state
This circular wait with no forks released leads to deadlock.Final Answer:
Option C -> Option CQuick Check:
Deadlock arises immediately due to circular wait and mutual exclusion.
- Assuming philosophers can eat simultaneously
- Confusing deadlock with starvation
- Believing system recovers automatically without intervention
Solution
Step 1: Understand FCFS characteristics
FCFS schedules processes in the order they arrive without preemption, making it simple and fair in terms of arrival order.Step 2: Analyze each option
A is incorrect because FCFS does not optimize for similar burst times; it just queues by arrival.
B is incorrect because FCFS can cause long waiting times if a long process arrives first.
C is incorrect because FCFS is non-preemptive and does not handle unpredictable arrivals well.
D is correct because FCFS's main advantage is simplicity and fairness in order, not responsiveness or waiting time optimization.Final Answer:
Option D -> Option DQuick Check:
FCFS is chosen for simplicity and fairness, not for minimizing waiting time or handling preemption.
- Assuming FCFS minimizes average waiting time
- Confusing FCFS with preemptive scheduling
- Believing FCFS handles unpredictable arrivals efficiently
Solution
Step 1: Understand the role of directory entries in file name resolution
Directory entries map file names to inode numbers, acting as the bridge between human-readable names and inode metadata.Step 2: Clarify inode responsibilities
Inodes store metadata and pointers to data blocks but do not contain file names.Step 3: Differentiate superblock and data blocks
The superblock manages file system-wide metadata, not individual file mappings; data blocks store file content, not names.Final Answer:
Option D -> Option DQuick Check:
Directory entries handle name-to-inode mapping [OK]
- Confusing inode as containing file names
- Assuming data blocks store file names
- Believing superblock handles file name mappings
Solution
Step 1: Identify TLB miss consequence
A TLB miss means the translation is not cached, so the system must look up the page table.Step 2: Follow the steps
On a miss, the page table is consulted to get the physical frame number.
The TLB is updated with this translation for future accesses.
Then the memory access proceeds using the physical address.Step 3: Analyze incorrect options
A: Page fault only occurs if the page is not in memory, not on every TLB miss.
B: TLB does not fetch from disk; page table lookup is in memory.
C: CPU does not retry blindly; it performs page table lookup.Final Answer:
Option A -> Option AQuick Check:
TLB miss triggers page table lookup and TLB update before memory access.
- Confusing TLB miss with page fault
- Thinking TLB fetches translations from disk
