Question One (20 marks) (a) Explain 3 stages of Address binding? (3 marks) (b) G

Question

Question One (20 marks) (a) Explain 3 stages of Address binding? (3 marks) (b) Given memory partitions of 250K, 400K, 300K and 200K are in order. (i) How would each of the First-fit, Best-fit and Worst fit algorithms place processes of 350K, 250K, 120K and 250K (in order)? (i) Which algorithm makes the most efficient use of memory? Explain briefly. List 2 problems of contiguous memory allocation? Available memory scattered across multiple free holes as in the Figure 1 (4 marks) (1 mark) (4 marks) (c) (d) 100 120 150 Hole 1 Hole 2 200 Hole 3 300 Figure 1 (i) Can we allocate process with a request 120K? Explain briefly. (2 marks) (ii) Explain how compaction can be used to allocate the request. (2 marks)

Explanation / Answer

Qa)

Answer)

a) 3 stages of Address binding:

Address binding is the process by which we can convert the virtual addresses of the computer to the physical addresses. The stages of Address binding are:

i) CPU ask for virtual address to be fetched from RAM

ii) MMU or address translation unit translated the address from virtual to physical

iii) The output is the physical address of the corresponding virtual address in RAM.

The above are the 3 steps for Address binding also known as run-time address binding.

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.