hey guys one more problem ...if anybody want to think on it..
Q.
Assume that n program are to be stored on two tapes. let li be the
length of tape need to store the ith program. Assume that sigma(li)< L,
Where L is length of each tape. A programa can be stored on either of
two tapes.if S1 is the set of program on tape1, then the worst case
access time for the program is proportional to max{sigma(i belongs to
S1*li), sigma(i does not belongs to S1*li)). An optimal assignment of
program to tapes minimizes the worst case access times. give an
algorithm to determine the worst case access time of an optimal
assignment.Thanks much for ur time.. i realy realy appreciate it...i mean it guys :) --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
