The document describes a bin packing problem where a software manufacturer needs to fit 10 computer programs of various file sizes onto 4 discs of 400kB each. It asks the student to:
1) Determine the lower bound for fitting the programs onto the fewest number of discs.
2) Apply first-fit and first-fit decreasing algorithms to solve the problem.
3) Consider if there is a better solution.
4) Discuss the advantages and disadvantages of the algorithms.
The document describes a bin packing problem where a software manufacturer needs to fit 10 computer programs of various file sizes onto 4 discs of 400kB each. It asks the student to:
1) Determine the lower bound for fitting the programs onto the fewest number of discs.
2) Apply first-fit and first-fit decreasing algorithms to solve the problem.
3) Consider if there is a better solution.
4) Discuss the advantages and disadvantages of the algorithms.
The document describes a bin packing problem where a software manufacturer needs to fit 10 computer programs of various file sizes onto 4 discs of 400kB each. It asks the student to:
1) Determine the lower bound for fitting the programs onto the fewest number of discs.
2) Apply first-fit and first-fit decreasing algorithms to solve the problem.
3) Consider if there is a better solution.
4) Discuss the advantages and disadvantages of the algorithms.
The document describes a bin packing problem where a software manufacturer needs to fit 10 computer programs of various file sizes onto 4 discs of 400kB each. It asks the student to:
1) Determine the lower bound for fitting the programs onto the fewest number of discs.
2) Apply first-fit and first-fit decreasing algorithms to solve the problem.
3) Consider if there is a better solution.
4) Discuss the advantages and disadvantages of the algorithms.
(10 marks) • A software manufacturer wants to fit the following computer programs on to four 400kB discs. Program A B C D E F G H I Size (kb) 100 80 60 65 110 25 50 60 90 Program J K L M N O P Q R Size (kB) 140 75 120 75 100 70 200 120 40 • Describe how you determine the lower bound for this problem. • Apply the first-fit and first-fit decreasing algorithms to this problem. • Is there a better solution? • Describe the advantage(s) and disadvantage(s) of all the algorithms that you have learnt.