Q1. Describe the differences between:
a) Logical and physical address space.
b) Internal and external fragmentation.
c) Paging and segmentation.
Q2. The memory partitions of 100k, 500k, 200k, 300k and 600k are given (in order), apply first fit and best fit algorithms to place the processes with space requirement of 212k, 417k, 112k and 426k (in order)? Name the algorithm which makes the most effective use of the memory?
Q3. Consider the condition in which the disk read or prepare head is presently situated at track 45 (of tracks 0-255) and moving in positive direction.
Suppose that the given track requests have been made in this order: 40, 67, 11, 240, and 87. Illustrate the order in which the optimized C-SCAN would service such requests and determine the total seek distance?