Answered

At Westonci.ca, we make it easy for you to get the answers you need from a community of knowledgeable individuals. Join our Q&A platform to connect with experts dedicated to providing precise answers to your questions in different areas. Our platform provides a seamless experience for finding reliable answers from a network of experienced professionals.

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?

Sagot :

Answer:

Following are the responses to the given question:

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 [tex]\frac{kn}{m} \ and\ \frac{kn^2}{m^2} \ and \ \frac{kn^3}{m^3}[/tex].

So, the level values are:

[tex]level \ 2 = \frac{kn}{m}\\\\level \ 3 = \frac{kn^2}{m^2}\\\\level \ 4 = \frac{kn^2}{m^2}\\\\[/tex]

Thanks for stopping by. We are committed to providing the best answers for all your questions. See you again soon. Your visit means a lot to us. Don't hesitate to return for more reliable answers to any questions you may have. Thank you for trusting Westonci.ca. Don't forget to revisit us for more accurate and insightful answers.