Operating Systems - Paging vs Segmentation - Address TranslationWhich of the following statements about segmentation is INCORRECT?ASegmentation completely eliminates fragmentation issuesBSegments can vary in size and represent logical units of a programCSegment tables store base and limit for each segmentDSegmentation allows sharing of segments between processesCheck Answer
Step-by-Step SolutionStep 1: Analyze Segments can vary in size and represent logical units of a programSegments are variable-sized logical units; this is correct.Step 2: Analyze Segmentation completely eliminates fragmentation issuesSegmentation does not eliminate fragmentation; it can cause external fragmentation.Step 3: Analyze Segment tables store base and limit for each segmentSegment tables store base and limit addresses; this is correct.Step 4: Analyze Segmentation allows sharing of segments between processesSegmentation supports sharing segments like code segments; this is correct.Final Answer:Option A -> Option AQuick Check:Fragmentation remains a problem in segmentation due to variable sizes.Quick Trick: Segmentation = variable size -> external fragmentation possibleCommon Mistakes:MISTAKESBelieving segmentation removes all fragmentationConfusing segment tables with page tablesAssuming segments cannot be sharedTrap Explanation:PITFALLOption A is incorrect; candidates often mistakenly believe segmentation removes all fragmentation.Interviewer Note:CONTEXTChecks candidate's ability to identify subtle misconceptions about segmentation.
Master "Paging vs Segmentation - Address Translation" in Operating Systems2 interactive learning modes - each teaches the same concept differentlySolutionTrace
More Operating Systems Quizzes Banker's Algorithm - Safe State & Resource Allocation - Banker's Algorithm - Safe State & Resource Allocation - Quiz 3easy Banker's Algorithm - Safe State & Resource Allocation - Banker's Algorithm - Safe State & Resource Allocation - Quiz 10hard Deadlock - Four Necessary Conditions (Coffman) - Deadlock - Four Necessary Conditions (Coffman) - Quiz 10hard Dining Philosophers - Problem, Deadlock & Solution - Dining Philosophers - Problem, Deadlock & Solution - Quiz 9hard Page Replacement - FIFO, LRU, Optimal Algorithm - Page Replacement - FIFO, LRU, Optimal Algorithm - Quiz 11easy Producer-Consumer Problem Using Semaphores - Producer-Consumer Problem Using Semaphores - Quiz 1easy Semaphore vs Mutex - When to Use Which - Semaphore vs Mutex - When to Use Which - Quiz 3easy Thrashing - Working Set Model & Prevention - Thrashing - Working Set Model & Prevention - Quiz 10hard Thrashing - Working Set Model & Prevention - Thrashing - Working Set Model & Prevention - Quiz 15hard Thrashing - Working Set Model & Prevention - Thrashing - Working Set Model & Prevention - Quiz 13medium