58) Consider the following heap :
JOB1-50 FREE-150 JOB2-300 FREE-350 JOB3-600
The sequence of requests for blocks of sizes 300, 25, 125, 50 can be satisfied if we use

59) Cached and interleaved memories are ways of speeding up memory access between CPUs and slower RAM. Which memory models are best suited (i.e. improves performance the most) for which programs ?
(i) Cached memory is best suited for small loops.
(ii) Interleaved memory is best suited for small loops.
(iii) Interleaved memory is best suited for large sequential code.
(iv) Cached memory is best suited for large sequential code.

60) Consider following page trace :4,3,2, 1,4,3,5,4,3,2, 1,5
Number of page faults that would occur if FIFO page replacement algorithm is used with Number of frames for the Job M=3, will be

61) Consider following page trace : 4,3,2, 1,4,3,5,4,3,2, 1,5
Percentage of page faults that would occur if FIFO page replacement algorithm is used with Number of frames for the Job M = 4, will be

62) Consider a logical address space of 8 pages of 1024 words mapped into memory of 32 frames. How many bits are there in the logical address?