Question

Consider a multilevel computer in which all levels are different. Each level has instructions that are m times as powerful as those of the level below it; that is, one level r instructions that are m times as powerful as those of the level below it; that is, one level r instruction can do the work of m level r-1 instructions. If a level-1 program requires k seconds to run, how long would equivalent programs take at levels 2, 3, and 4, assuming n level r instrucions are required to interpret a single r+1 instruction?

Answer 1

Following are the responses to the given question:

Step-by-step explanation:

Its machine slows for each further level of evaluation by an n/m factor. Therefore are the times for implementation for levels 2, 3, and 4 are
`(kn)/(m) \ and\ (kn^2)/(m^2) \ and \ (kn^3)/(m^3)`.

So, the level values are:

`level \ 2 = (kn)/(m)\\\\level \ 3 = (kn^2)/(m^2)\\\\level \ 4 = (kn^2)/(m^2)\\\\`