Consider the following segment table:

Segment Base

(Starting Address) Length

(bytes)

0 793 561

1 2800 164

2 90 9

3 1374 980

4 1999 86

What are the physical addresses for the following logical addresses?

[2+2+2+2+2=10 Marks]

(a) 0,860

(b) 1,292

(c) 2,8

(d) 3,500

(e) 4,133

Another placement algorithm for dynamic partitioning is referred to as worst-fit. In this case, the largest free block of memory is used for bringing in a process.

a. Discuss the pros and cons of this method compared to first-fit, next-fit, and best-fit.

b. What is the average length of the search for worst-fit?