Question 1 |

The immediate addressing mode can be used for

1. Loading internal registers with initial values

2. Perform arithmetic or logical operation on data contained in instructions

Which of the following is true?

1. Loading internal registers with initial values

2. Perform arithmetic or logical operation on data contained in instructions

Which of the following is true?

Only 1 | |

Only 2 | |

Both 1 and 2 | |

Immediate mode refers to data in cache |

Question 1 Explanation:

Question 2 |

Statements associated with registers of a CPU are given. Identify the false statement.

The program counter holds the memory address of the instruction in execution | |

Only opcode is transferred to the control unit | |

An instruction in the instruction register consists of the opcode and the operand | |

The value of the program counter is incremented by 1 once its value has been read to the memory address register |

Question 2 Explanation:

Question 3 |

Which of the following affects the processing power assuming they do not influence each other

1. Data bus capability

2. Address scheme

3. Clock speed

1. Data bus capability

2. Address scheme

3. Clock speed

3 only | |

1 and 3 only | |

2 and 3 only | |

1,2 and 3 |

Question 3 Explanation:

Question 4 |

Convert the pre-fix expression to in-fix -^{*}+A B C^{*}-D E+F G

(A-B)^{*} C+\left(D^{*} E\right)-(F+G) | |

(A+B)^{*} C-(D-E)^{*}(F-G) | |

(A+B-C)^{*}(D-E)^{*}(F+G) | |

(((A+B)*C)-((D-E)*(F+G))) |

Question 4 Explanation:

Originally all Options are wrong. We have modified one option.

Click here for detail solution by gateoverflow

Click here for detail solution by gateoverflow

Question 5 |

An array of 2 two byte integers is stored in big endian machine in byte addresses as shown below. What will be its storage pattern in little endian machine ?

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&78\\0 \times 103&56\\0 \times 102&34\\0 \times 101&12\end{array}

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&78\\0 \times 103&56\\0 \times 102&34\\0 \times 101&12\end{array}

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&12\\0 \times 103&56\\0 \times 102&34\\0 \times 101&78\end{array} | |

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&12\\0 \times 103&34\\0 \times 102&56\\0 \times 101&78\end{array} \\ | |

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&56\\0 \times 103&78\\0 \times 102&12\\0 \times 101&34\end{array} \\ | |

\begin{array}{c|c}\text{Address}& \text{Data}\\\hline0 \times 104&56\\0 \times 103&12\\0 \times 102&78\\0 \times 101&34\end{array} |

Question 5 Explanation:

Question 6 |

A non-pipelined CPU has 12 general purpose registers?(R0,R1,R2,...,R12). Following operations are supported

ADD Ra, Rb, Rr Add Ra to Rb and store the result in Rr

MUL Ra, Rb, Rr Multiply Ra to Rb and store the result in Rr

MUL operation takes two clock cycles, ADD takes one clock cycle.

Calculate minimum number of clock cycles required to compute the value of the expression XY+XYZ+YZ. The variable X,Y,Z are initially available in registers R0,R1 and R2 and contents of these registers must not be modified.

ADD Ra, Rb, Rr Add Ra to Rb and store the result in Rr

MUL Ra, Rb, Rr Multiply Ra to Rb and store the result in Rr

MUL operation takes two clock cycles, ADD takes one clock cycle.

Calculate minimum number of clock cycles required to compute the value of the expression XY+XYZ+YZ. The variable X,Y,Z are initially available in registers R0,R1 and R2 and contents of these registers must not be modified.

5 | |

6 | |

7 | |

8 |

Question 6 Explanation:

Question 7 |

Consider a 5- segment pipeline with a clock cycle time 20 ns in each sub operation. Find out the approximate speed-up ratio between pipelined and non-pipelined system to execute 100 instructions. (if an average, every five cycles, a bubble due to data hazard has to be introduced in the pipeline)

5 | |

4.03 | |

4.81 | |

4.17 |

Question 7 Explanation:

Question 8 |

Consider a 32- bit processor which supports 70 instructions. Each instruction is 32 bit long and has 4 fields namely opcode, two register identifiers and an immediate operand of unsigned integer type. Maximum value of the immediate operand that can be supported by the processor is 8191. How many registers the processor has?

32 | |

64 | |

128 | |

16 |

Question 8 Explanation:

Question 9 |

In a 8-bit ripple carry adder using identical full adders, each full adder takes 34 ns for computing sum. If the time taken for 8-bit addition is 90 ns, find time taken by each full adder to find carry.

6 ns | |

7 ns | |

10 ns | |

8 ns |

Question 9 Explanation:

Question 10 |

Following Multiplexer circuit is equivalent to

Sum equation of full adder | |

Carry equation of full adder | |

Borrow equation for full subtractor | |

Difference equation of a full subtractor |

Question 10 Explanation:

There are 10 questions to complete.