Consider the following memory representation, where free areas are indicated with their sizes. The processes P1 to P6 are already in the memory and indicated by their sizes and process number.

1) Draw the final memory state after executing the following events in sequence, using contiguous allocation. Use the memory maps given below to answer the question.

2) If there is not enough place for a certain process, this process is rejected once and for all. Write Px No space.

3) Show clearly all remaining free areas.

The below events happen in sequence one after the other.

1. P7 Arrives (requires 14KB),
2. P8 Arrives (requires 10KB),
3. P9 Arrives (requires 7KB),
4. P5 TERMINATED
5. P10 Arrives (requires 16KB)
6. P11 Arrives (requires 5KB)
7. P12 Arrives (requires 13KB)
8. P13 Arrives (requires 12KB)

1. Use First-Fit Allocation technique: [3marks]

P1	P2	P3	P4	P5	P6
10K	10K	8K	20K	6K	18K	4K	7K	9K	12K	12K	15K

2. Use Best-Fit Allocation technique: [3 marks]

P1	P2	P3	P4	P5	P6
10K	10K	8K	20K	6K	18K	4K	7K	9K	12K	12K	15K

3. Use Worst-Fit Allocation technique: [3 marks]

P1	P2	P3	P4	P5	P6
10K	10K	8K	20K	6K	18K	4K	7K	9K	12K	12K	15K

Answer rating: 100% (QA)

T 1 P7 Arrives requives 14 KB 2 P8 Arrives requires 11 KB 3 P1 terminated 4 b F T 1 5 6 7 8 4 5 1 2 ... View the full answer