In: Computer Science
Consider the table given below for a fixed memory allocation scheme:
Given the jobs list information and memory information in the table below, answer the questions that follow:
| 
 Job Number  | 
 Memory Requested  | 
 
  | 
 Memory Block  | 
 Memory Block Size  | 
| 
 Job 1  | 
 600  | 
 Block 1  | 
 1200  | 
|
| 
 Job 2  | 
 920  | 
 Block 2  | 
 300  | 
|
| 
 Job 3  | 
 1100  | 
 Block 3  | 
 930  | 
|
| 
 Job 4  | 
 700  | 
 Block 4  | 
 950  | 
(Assume all jobs are in a waiting queue in the order given, also assume that the memory blocks are in the given order)
Choose from the options below the correct illustration/diagram that represents the Next-fit algorithm when the jobs are assigned in the main memory. [4]
Following is the sequence :
As we see, Job 3 does not get allocated, because no suitable block is found.