Write the steps for various floating point arithmetic operations.
Steps for various floating point arithmetic operations are : Addition and Subtraction: Multiplication: Division: Simplified Explanation:
COA PYQ
Explain the basic format used to represent floating point numbers.
The floating point representation has three fields : Where S is significant (mantissa) digits, E is exponent, B is scaling factor, which is 2 for … Read more
Draw the data path of sequential n-bit binary divider.Give the non-restoring division algorithm for unsigned integers.Also illustrate algorithm for unsigned integer with a suitable example.
Datapath of sequential n-bit binary divider : Algorithm for non-restoring division : Non-restoring division operation :Step 1 : If the sign of A is 0, … Read more
What do you mean by over flow ? Describe the over flow detection.
Overflow in the context of digital computation occurs when the result of an arithmetic operation exceeds the capacity of the data type or storage space … Read more
Draw the flow chart for restoring and non-restoring division operation.
Flowchart for restoring division operation is shown in image: A flow chart for non-restoring division operation is shown in image:
Write down the step for restoring and non-restoring of division operations.
Restoring division operation :Step 1 : Shift A and Q left one binary position.Step 2 : Subtract divisor from A and place answer back in … Read more
Explain array multiplier method with the help of example.
1.The combinational circuit implemented to perform multiplication is called array multiplier. 2. The generalized multiplication process for array multiplier for two unsigned integers : Multiplicand … Read more
Draw the data path of 2’s compliment multiplier. Give the Robertson multiplication algorithm for 2’s compliment fractions.Also illustrate the algorithm for 2’s compliment fraction by a suitable example.
The algorithm for 2’s complement multiplication is as follows : Step 1 : Load multiplicand in B, multiplier in Q. For negative numbers, 2’s complement … Read more
Show the multiplication process using Booth’s algorithm when the following numbers are multiplied : (– 13) by (+ 8).
True binary equivalent of + 8 = 01000True binary equivalent of + 13 = 011011’s complement of + 13 = 10010 2’s complement of + … Read more