Individual Assignment Due in class next Wednesday (March 28) 9.14 and 9.22 on page 407 9.14: Consider the problem of jobs waiting in a queue until sufficient memory becomes available for them to be loaded and executed. If the queue is a simple first-in-first-out structure, then only the job at the head of the queue may be considered for placement in memory. With a more complex queuing mechanism, it might be possible to examine the entire queue to choose the next job to be loaded and executed. Show how the latter discipline, even though more complex, might yield better throughput than the simple first-in-first-out strategy. What problem could the latter approach suffer from? 2004 Deitel & Associates, Inc. All rights reserved. Show CSC400-Assign4 (1)-pdf CSC400-Assign4.pdf 1:23 PM 3/24/2011