Explain Optimal storage on tape example.

1.9kviews

written 7.8 years ago by

Optimal storage problem:

Input: We are given ‘n’ problem that are to be stored on computer tape of length L and the length of program i is Li

Such that 1 ≤i≤ n and Σ 1≤k≤j Li≤ 1

Output: A permutation from all n! For the n programs so that …

Create a free account to keep reading this post.

and 4 others joined a min ago.

ADD COMMENT EDIT

You can also watch this on youtube to understand this problem better.

6.1 years ago by teamques10 ★ 65k