Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Topic is operating systems. Please answer the following: Some questions could have multiple correct answers. Choose all correct answers. a point for each correct answer

Topic is operating systems.
Please answer the following:
Some questions could have multiple correct answers.
Choose all correct answers.
a point for each correct answer selected.
a half-point off for each incorrect answer selected.
image text in transcribed
image text in transcribed
Question 22 3 pts Computer A can execute a program in 92615 microseconds. Computer B can execute the same program at a rate of 1.12867 times per second. Which computer can execute the program in less amount of time? Computer A Computer B Question 23 3 pts A processor operates at a clock rate of 1.1 GHz yet has a varying CPI for different instruction types. A given program has 200 ALU instructions which take the processor 10 cycles to cycles to complete each instruction. It has 500 memory instructions that take 20 cycles to cycles to complete each instruction. It also has 270 branching operations that take 27 cycles to cycles to complete each instruction. How long does it take to execute this program? Give the answer in microseconds. 98.15656411 5.156165468 17.53636364 Question 24 3 pts A program has 797000 thousand instructions. The program is run on a processor that takes 29 cycles per instruction. The processor operates at 2.9 GHz. Assuming all instructions take the same number of cycles to complete, how long does it take for the program to run? Give the answer in seconds. 0.008s 7.97 O 0.42 7970000.0 5 Question 25 3 pts Computer A can execute a program in 42629 microseconds. Computer B can execute the same program at a rate of 1.62602 times per second. Which computer can execute the program in less amount of time? Computer A Computer B

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Readings In Database Systems

Authors: Michael Stonebraker

2nd Edition

0934613656, 9780934613651

More Books

Students also viewed these Databases questions

Question

Complexity of linear search is O ( n ) . Your answer: True False

Answered: 1 week ago