Q.1

What is the most important operation in binary-coded decimal (BCD) arithmetic?

  • addition
  • subtraction
  • multiplication
  • division
Q.2

The binary subtraction 0 – 0 =

  • difference = 0
    borrow = 0
  • difference = 1
    borrow = 0
  • difference = 1
    borrow = 1
  • difference = 0
    borrow = 1
Q.3

When 1100010 is divided by 0101, what is the decimal remainder?

  • 2
  • 3
  • 4
  • 6
Q.4

Add the following BCD numbers.

0110 &nbsp 0111 &nbsp 1001
0101 &nbsp 1000 &nbsp 1000
  • 0000  1011    0000  1111    0001  0001
  • 0001  0001    0001  0101    0001  0001
  • 0000  1011    0000  1111    0001  0111
  • 0001  0001    0001  0101    0001  0111
Q.5

For a 4-bit parallel adder, if the carry-in is connected to a logical HIGH, the result is:

  • the same as if the carry-in is tied LOW since the least significant carry-in is ignored.
  • that carry-out will always be HIGH.
  • a one will be added to the final result.
  • the carry-out is ignored.
Q.6

A half-adder circuit would normally be used each time a carry input is required in an adder circuit.

  • True
  • False
Q.7

111010002 is the 2's-complement representation of –24.

  • True
  • False
Q.8

Determine the two's-complement of each binary number.
00110        00011        11101

  • 11001    11100    00010
  • 00111    00010    00010
  • 00110    00011    11101
  • 11010    11101    00011
Q.9

The decimal value for E16 is:

  • 1210
  • 1310
  • 1410
  • 1510
Q.10

Binary subtraction of a decimal 15 from 43 will utilize which two's complement?

  • 101011
  • 110000
  • 011100
  • 110001
Q.11

What logic function is the sum output of a half-adder?

  • AND
  • exclusive-OR
  • exclusive-NOR
  • NAND
Q.12

The carry propagation delay in full-adder circuits:

  • is normally not a consideration because the delays are usually in the nanosecond range.
  • decreases in a direct ratio to the total number of FA stages.
  • is cumulative for each stage and limits the speed at which arithmetic operations are performed.
  • increases in a direct ratio to the total number of FA stages but is not a factor in limiting the speed of arithmetic operations.
Q.13

The BCD addition of 910 and 710 will give initial code groups of 1001 +Addition of these groups generates a carry to the next higher position. The correct solution to this problem would be to:

  • ignore the lowest order code group because 0000 is a valid code group and prefix the carry with three zeros
  • add 0110 to both code groups to validate the carry from the lowest order code group
  • disregard the carry and add 0110 to the lowest order code group
  • add 0110 to the lowest order code group because a carry was generated and then prefix the carry with three zeros
Q.14

How many BCD adders would be required to add the numbers 97310 + 3910?

  • 3
  • 4
  • 5
  • 6
Q.15

The range of positive numbers when using an eight-bit two's-complement system is:

  • 0 to 64
  • 0 to 100
  • 0 to 127
  • 0 to 256
Q.16

What are the two types of basic adder circuits?

  • sum and carry
  • half-adder and full-adder
  • asynchronous and synchronous
  • one- and two's-complement
Q.17

There are four possible combinations for subtracting two binary numbers.

  • True
  • False
Q.18

The two's-complement method is used in computer systems that perform arithmetic.

  • True
  • False
Q.19

Adding in binary, a decimal 26 + 27 will produce a sum of:

  • 111010
  • 110110
  • 110101
  • 101011
Q.20

Add the following hexadecimal numbers.

3C &nbsp 14 &nbsp 3B
+25 &nbsp +28 &nbsp +DC
  • 60    3C    116
  • 62    3C    118
  • 61    3C    117
  • 61    3D    117
Q.21

An 8-bit register may provide storage for two's-complement codes within which decimal range?

  • +128 to –128
  • –128 to +127
  • +128 to –127
  • +127 to –127
Q.22

A full-adder adds ________.

  • two single bits and one carry bit
  • two 2-bit binary numbers
  • two 4-bit binary numbers
  • two 2-bit numbers and one carry bit
Q.23

What is the first thing you will need if you are going to use a macrofunction?

  • A complicated design project
  • An experienced design engineer
  • Good documentation
  • Experience in HDL
Q.24

The binary subtraction 0 – 1 = is
difference = 1
borrow = 0

  • True
  • False
Q.25

The look-ahead-carry adder is slower than the ripple-carry adder because it requires additional logic circuits.

  • True
  • False
Q.26

The solution to the binary problem 1011 × 0110 is 01100110.

  • True
  • False
Q.27

Fast-look-ahead carry circuits found in most 4-bit full-adder circuits:

  • determine sign and magnitude
  • reduce propagation delay
  • add a 1 to complemented inputs
  • increase ripple delay
Q.28

A full-adder adds ________.

  • two single bits and one carry bit
  • two 2-bit binary numbers
  • two 4-bit binary numbers
  • two 2-bit numbers and one carry bit
Q.29

Which of the following is the primary advantage of using binary-coded decimal (BCD) instead of straight binary coding?

  • Fewer bits are required to represent a decimal number with the BCD code.
  • BCD codes are easily converted from decimal.
  • the relative ease of converting to and from decimal
  • BCD codes are easily converted to straight binary codes.
Q.30

The binary adder circuit is designed to add ________ binary numbers at the same time.

  • 2
  • 4
  • 6
  • 8
0 h : 0 m : 1 s