Discussion
Contiguous memory allocation requires that
Answer: B
Correct answer: each process occupies a single unbroken block of memory
Contiguous allocation gives each process one unbroken region of physical memory, defined by a base address and a limit. Its virtue is simplicity: address translation needs only an addition and a bounds check, so a single relocation register and limit register suffice, and no page table is required. Its defect is external fragmentation. As processes come and go, free memory is left in scattered holes, and a request may fail even when the total free space is ample. Compaction can cure it by shuffling processes together, but at a heavy cost in copying and only where relocation is dynamic. The scheme comes in two forms. Fixed partitioning divides memory into a set number of regions, wasting whatever a process does not fill - internal fragmentation. Variable partitioning allocates exactly what is asked for, avoiding that but suffering external fragmentation instead. Paging was introduced to escape the dilemma: because any free frame serves for any page, contiguity is never required.
Post your comment
Please log in or register to post a comment.
Examination Categories
- SSC Exams
- Banking Exams
- Teaching Exams
- Civil Services Exams
- Railways Exams
- Engineering Recruitment Exams
- Defence Exams
- State Government Exams
- Police Exams
- Insurance Exams
- Nursing Exams
- Other Government Exams
- NRA CET
- PG Entrance Exams
- Campus Placement
- MBA Entrance Exams
- CUET and UG Entrance
- Judiciary Exams
- Regulatory Body Exams
- Software Development