$1.$ Determine the job's requested memory size.

$2.$ If job$\_$size $>$ size of the largest partition,

Then reject the job, print an appropriate message to the operator, and go to Step $1$ to handle the next job in line.

Else, continue with Step $3.$

$3.$ Set a counter to $1.$

$4.$ Do the following while counter $<=$ the number of partitions in memory:

a$.$ If job$\_$size $>$ memory$\_$partition$\_$size$($counter$),$

Then counter $=$ counter $+1.$

b$.$ Else, if memory$\_$partition$\_$status$($counter$)=$ "free",

Then load the job into memory$\_$partition$($counter$),$ change memory$\_$partition$\_$status$($counter$)$ to "busy," and go to Step $1$ to handle the next job in line.

Else, counter $=$ counter $+1.$

End do$.$

$5.$ If no partition is available at this time, put the job in the waiting queue.

$6.$ Go to Step $1$ to handle the next job in line.