Q.1.

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

Q.2.

The binary subtraction 0 – 0 =

Q.3.

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

Q.4.

Add the following BCD numbers.

0110 &nbsp 0111 &nbsp 1001
0101 &nbsp 1000 &nbsp 1000
Q.5.

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

Q.6.

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

Q.7.

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

Q.8.

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

Q.9.

The decimal value for E16 is:

Q.10.

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

Q.11.

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

Q.12.

The carry propagation delay in full-adder circuits:

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:

Q.14.

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

Q.15.

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

Q.16.

What are the two types of basic adder circuits?

Q.17.

There are four possible combinations for subtracting two binary numbers.

Q.18.

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

Q.19.

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

Q.20.

Add the following hexadecimal numbers.

3C &nbsp 14 &nbsp 3B
+25 &nbsp +28 &nbsp +DC
Q.21.

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

Q.22.

A full-adder adds ________.

Q.23.

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

Q.24.

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

Q.25.

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

Q.26.

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

Q.27.

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

Q.28.

A full-adder adds ________.

Q.29.

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

Q.30.

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