Heap Layout $($KB$)$:

$-$ Block $1$: $150$ KB $($Free$)$

$-$ Block $2$: $300$ KB $($Occupied$)$

$-$ Block $3$: $250$ KB $($Free$)$

$-$ Block $4$: $50$ KB $($Free$)$

$-$ Block $5$: $280$ KB $($Occupied$)$

$-$ Block $6$: $600$ KB $($Free$)$

$-$ Block $7$: $200$ KB $($Free$)$

Incoming Process Requests $($KB$)$:

$-$ Session $1$: $140$ KB

$-$ Session $2$: $60$ KB $($Critical$)$

$-$ Session $3$: $50$ KB

$-$ Session $4$: $250$ KB

$-$ Session $5$: $90$ KB

Challenge: Determine which strategy $($First Fit, Best Fit, or Worst Fit$)$ would allocate memory most effectively. Analyze any potential delays, especially for the critical Session $3,$ and justify your chosen strategy.

Instructions for Analysis:

$$ Pros and Cons: Identify the pros and cons of using each strategy and support

your conclusions with calculations and memory state diagrams.

$$ Calculate and report internal fragmentation: Ensure that you calculate the

internal fragmentation after each allocation and summarize the total internal

fragmentation for each strategy.

$$ Note potential allocation failures: Highlight if any strategy is unable to

accommodate all process requests, and analyze why this occurs. Discuss how

fragmentation or allocation choices contributed to the failure.

$$ Include memory state diagrams: Provide visual representations of the heap

before and after each allocation. This will help illustrate how the strategy affects

memory over time and how fragmentation is managed.

$$ Evaluate strategy limitations: Discuss the scenarios where certain strategies

excel or fail. Include an analysis of which strategy handles critical requests most

effectively and why.

$$ Summarize overall findings: Conclude with a comparative analysis of all

strategies, noting which one was the most effective for each scenario and why.

DRAW HEAP DIAGRAM