Register

GO Classes DPP | OS | OVERLAY

408 views
1 1 vote

A program is structured using an overlay tree to fit into limited physical memory.

What is the minimum partition size in physical memory required to run the longest possible path of this program?

  1. $44$ KB
     
  2. $22$ KB
     
  3. $26$ KB
     
  4. $48$ KB

2 Answers

1 1 vote
$\text { Minimum Partition Size }=\operatorname{Max}(\operatorname{Path} 1, \text { Path 2) }=26 \mathrm{~KB}$
Voting & Accepting an answer helps improve the community
← Previous · GO Classes DPP | OS ...Next → · GO Classes DPP | PYT...
← Previous in category · GO Classes DPP | OS ...Next in category → · GO Classes DPP | OS ...
Position:
Show:

Related questions

5 5 votes
2 2 answers
309
309 views
GO Classes asked Dec 31, 2025
309 views
GO Classes DPP | OS | VIRTUAL MEMORY
Consider a system where a CPU generates $\mathbf{32-}$bit virtual addresses with a page size of $\mathbf{8 ~KB}$. The system has a $\mathbf{2-way}$ set associative TLB th...
4 4 votes
3 3 answers
408
408 views
GO Classes asked Dec 31, 2025
408 views
GO Classes DPP | OS | CPU SCHEDULING
Consider the following set of CPU-intensive processes. The operating system uses the Preemptive Shortest Remaining Time First (SRTF) scheduling algorithm.\[\begin{array}{...
1 1 vote
3 3 answers
375
375 views
GO Classes asked Dec 31, 2025
375 views
GO Classes DPP | OS | CPU SCHEDULING
Consider the following set of processes, with arrival times and CPU burst times given in milliseconds. What is the average turnaround time for these processes using the P...
2 2 votes
3 3 answers
554
554 views
GO Classes asked Dec 31, 2025
554 views
GO Classes DPP | OS | CPU SCHEDULING
The sequence $\_\_\_\_$ is an optimal non-preemptive scheduling sequence for the following jobs which leaves the CPU idle for $\_\_\_\_$ unit(s) of time.\[\begin{array}{c...