Ask
Login
0
20kviews
Explain optimal storage on tapes and find the optimal order for given instance.
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k •   modified 5.7 years ago

Explain optimal storage on tapes and find the optimal order for given instance.

n = 3, and (1, 12, 13) = (5, 10, 3).
analysis of algorithms
ADD COMMENT EDIT
1 Answer
0
468views
written 9.4 years ago by gravatar for teamques10 teamques10 ★ 70k
  1. Given n programs to be stored on tape, the lengths of these programs are i1, i2….in respectively. Suppose the programs are stored in the order of i1, i2…in. 2 We have a tape of length L i.e. the storage capacity of the tape is L. We are also given n …

Create a free account to keep reading this post.

and 5 others joined a min ago.

ADD COMMENT EDIT
Please log in to add an answer.