DIGITAL LOGIC

Important Objective Questions

Unit-2
1) What is the addition of the binary numbers 11011011010 and 010100101??
Ans- 11101111111.
2) Perform binary addition: 101101 + 011011=?
Ans- 1001000
3) Perform binary subtraction: 101111 – 010101 =?
Ans-011010
4) Perform multiplication of the binary numbers: 01001 × 01011 =?
Ans-001100011
5) Divide the binary number (011010000) by (0101) and find the quotient
Ans-101001
6) On subtracting (010110)2 from (1011001)2 using 2’s complement, we get----------.
Ans-1000011
7) Booth’s Algorithm is applied on _____________
Ans-Booth’s Algorithm is applied only on signed and unsigned binary numbers.
8) What will be the result of Booth recoding operation on 101100?
Ans- -1+10-100
9) In Booth's recoding, M is multiplicand and -1 is booth recoded multiplier, then
what will be the result of multiplication?
Ans- 2’s complement of M
10) In Booth’s algorithm, if Q0=0 and Q-1=0 then it will perform which operation,
Ans-Arithmetic right shift of A, Q and Q-1
11) In Booth’s algorithm, if Q0=1 and Q-1=0 then it will perform which operation?
Ans-A=A-M
12) What will be the effect of performing booth recoding operation on the multiplier?
Ans-Halves the maximum number of summands
13) What are the advantages of booth’s algorithm?
Ans- Advantages of booth's multiplication:
 Easy calculation of multiplication problem.
 Consecutive additions will be replaced.
 Less complex and ease scaling.
14) What are the limitations of booth’s algorithm?
Ans- Disadvantages of booth's multiplication:
 This algorithm will not work for isolated 1's.
 It is time consuming.
 If digital gates are more, chip area would be large.
15) The logic operations are implemented using _______ circuits.
Ans-combinatorial circuits 
16) The carry generation function: ci + 1 = yici + xici + xiyi, is implemented in
____________
 Ans- Full adders
17) Which option is true regarding the carry in the ripple adders?
a) Are generated at the beginning only
b) Must travel through the configuration
c) Is generated at the end of each operation
d) None of the mentioned
Ans- b
Explanation: The carry must pass through the configuration of the circuit till it
reaches the particular step.
18) In full adders the sum circuit is implemented using ________
Ans- XOR gate
19) In a normal adder circuit, the delay obtained in a generation of the output is
_______
Ans-2n + 2. The 2n delay cause of the carry generation and the 2 delay cause of
the XOR operation.
20) The delay reduced to in the carry look ahead adder is __________
Ans-5
21) We make use of ______ circuits to implement multiplication.
Ans-The fast adders are used to add the multiplied numbers.
22) The ______ is used to coordinate the operation of the multiplier.
Ans- Control sequencer
23) The method used to reduce the maximum number of summands by half is
_______
Ans- Bit-pair recording
24) The multiplier -6(11010) is recorded as _______ in bit pair recording method.
Ans-0-1-2
25) The most efficient method followed by computers to multiply two unsigned
numbers is?
Ans-Bit pair recording of multipliers
26) For the addition of large integers, most of the systems make use of-------------?
Ans- Carry look-ahead adders
27) Advantages of Bit pair recording.
Ans- in order to speed up the multiplication process, bit-pair recoding of the
multiplier is used to reduce the summands.
28) What is the advantage of non-restoring method of division over restoring method of
division?
Ans- The advantage of using non-restoring arithmetic over the standard restoring
division is that a test subtraction is not required; the sign bit determines whether an
addition or subtraction is used. The disadvantage, though, is that an extra bit must be
maintained in the partial remainder to keep track of the sign.
29) What is meant by floating-point number?
Ans- A floating point number, is a positive or negative whole number with a decimal
point. For example, 5.5, 0.25, and -103.342 are all floating point numbers, while 91, and 0
 are not. Floating point numbers get their name from the way the decimal point can "float"
to any position necessary.
30) If the decimal point is placed to the right of the first significant digit,
then the number is called ________
Ans- Normalized
31) The sign followed by the string of digits is called as ______
Ans- Mantissa
32)  In IEEE 32-bit representations, the mantissa of the fraction is said to
occupy ______ bits.
Ans- 23 bits
33) The 32 bit representation of the decimal number is called as --------
Ans- Single-precision
34) In double precision format, the size of the mantissa is------
Ans- 52 bits
35) What is Guard bit ?
Ans- A guard bit is needed to preserve calculation accuracy for a floating point operation.
36) The 64 bit representation of the decimal number is called as --------
Ans- Double precision
37) In double precision format, the size of the exponent is------
Ans- 11 bits
38) In single precision format, the size of the exponent is------
Ans- 8 bits