adplus-dvertising
frame-decoration

Question

When the PC having Clock rate of 2 and the CPU clock cycle for a program is 4 then Execution time of this computer for a program will be

a.

1

b.

1.5

c.

1.75

d.

2

Answer: (d).2

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. When the PC having Clock rate of 2 and the CPU clock cycle for a program is 4 then Execution time of this computer for a program will be

Similar Questions

Discover Related MCQs

Q. The time between the start and the end of program execution is known as

Q. A set of standard CPU-intensive, floating points and integers benchmarks are referred to as

Q. Computer B having execution time 110 ns and computer A having 1001 then

Q. A first goal of compiler writer

Q. Optimizations on the sources with output leading to later optimization passes are known as

Q. In 32-bit addressing mode, the address field is either 1 byte or

Q. The one of the advantage of MIPS 16 and Thumb is: the instruction caches acting as if they are about

Q. One of the complex jobs of the compiler writer, is to figure-out what instruction sequence will be used best for each segment, named as

Q. One that is used to allocate local variables is

Q. Vector architectures are operated on vectors of

Q. Graph coloring gives best results, when there are at-least

Q. Compilers usually chooses which procedure calls has to be expanded inline before knowing the size of the procedure, that is being called, the stated problem is known as

Q. The operation is normally specified in one field, known as

Q. The length of 80x86 instructions can vary between

Q. Optimization, known as basic block, by the compiler people is

Q. The procedure when call procedure that has been called, saving the registers it wants for using, when the caller has been left unrestrained, is known as

Q. When the call procedure saving the registers which it wants to be preserved to access even after the call, is refered to as

Q. Replacing the instances of a variable, to which a constant is assigned with the constant, is refered as

Q. The optimization: finding two examples of an expression, computing the same value and saving the value of the 1st computation in a temporary variable, is refered as

Q. Register allocation algorithms are particularly based on the technique, named as