Performing booth algorithm-non restoring division algorithm


Question 1)a) With neat block diagram describe the working of the first general purpose computer

b) Consider an assignment statement X = (a - b * c)/d where a, b, c, d and X are the main memory locations. Write a set of instructions to implement the above assignment statement on:

i) Accumulator based machine and

ii) Stack oriented machine.

iii) General register machine using two address instructions

Question 2)a) Perform (-88)10*(-44)10 using Booth’s algorithm.

b) Perform (100)10÷ (15)10 using Non Restoring division algorithm. Also draw the flow chart.

Question 3)a) Certain processor needs seven instructions (I0 to I6) whose relative frequency of occurrence is as shown below:

Instruction           I0           I1           I2            I3            I4          I5           I6
Rel. Frequency   0.05        0.1         0.4        0.18         0.2       0.04       0.03

i) Develop the Huffman's tree and design appropriate OPCODE for each instruction.

ii) Determine the percentage redundancy

b) With a neat block diagram explain the content addressable memory.

c) Write a detailed note on cache memory.

Question 4) Design hardwired control unit for Booths multiplication process. Show each steps clearly.

Question 5)a) Design a 4-bit, 4 functions ALU which can perform addition, subtraction, logical AND and logical OR operations

b) Describe the following terms with respect to the execution of p tasks using a q segment pipeline:

(i) Speed Up

(ii) Throughput

(iii) Efficiency

c) What are the components of Instruction Pipeline system ? Explain.

Question 6) With appropriate diagram describe ISO OSI reference model in computer networks.

b) Write a detailed note on Daisy chain interrupt handling.

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: Performing booth algorithm-non restoring division algorithm
Reference No:- TGS06309

Expected delivery within 24 Hours