[Skip Breadc rumb N avigation] [Skip Breadc rumb N avigation] H ome C hapter 6 M ultiple C hoic e

Multiple Choice
This activity contains 30 questions.

The most commonly used system for representing signed binary numbers is the:
2's-complement system. 1's-complement system. 10's-complement system. sign-magnitude system.

When performing subtraction by addition in the 2's-complement system:

the minuend and the subtrahend are both changed to the 2's-complement. the minuend is changed to 2's-complement and the subtrahend is left in its original form. the minuend is left in its original form and the subtrahend is changed to its 2'scomplement. the minuend and subtrahend are both left in their original form.

The 2's-complement system is to be used to add the signed binary numbers 11110010 and 11110011. Determine, in decimal, the sign and value of each number and their sum.
113 and 114, 227 14 and 13, 27 11 and 16, 27 27 and 13, 40

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.

How many inputs must a full-adder have?

4 2 5 3

Find the 2's complement of 1101102.

110100 2

101010 2 001001 2 001010 2

10011110 01211110 000100000100 001000001000

The truth table for a full adder is shown below. What are the values of X, Y, and Z?

X = 0, Y = 1, Z = 1 X = 1, Y = 1, Z = 1 X = 1, Y = 0, Z = 1 X = 0, Y = 0, Z = 1

Which of the statements below best describes Figure 6-1?

Half-carry adder; Sum = 0, Carry = 1 Half-carry adder; Sum = 1, Carry = 0 Full-carry adder; Sum = 1, Carry = 0 Full-carry adder; Sum = 1, Carry = 1

What is the major difference between half-adders and full-adders?

Nothing basically; full-adders are made up of two half-adders. Full adders can handle double-digit numbers. Full adders have a carry input capability. Half adders can handle only single-digit numbers.

What is the correct output of the adder in Figure 6-2, with the outputs in the order:

10111 11101 01101 10011

What is one disadvantage of the ripple-carry adder?

The interconnections are more complex. More stages are required to a full adder. It is slow due to propagation time. All of the above.

Which of the following is correct for full adders?

Full adders have the capability of directly adding decimal numbers. Full adders are used to make half adders. Full adders are limited to two inputs since there are only two binary digits. In a parallel full adder, the first stage may be a half adder.

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.

Using 4-bit adders to create a 1See Section 6-bit adder:

requires 16 adders. requires 4 adders. requires the carry-out of the less significant adder to be connected to the carry-in of the next significant adder. requires 4 adders and the connection of the carry out of the less significant adder to the carry-in of the next significant adder.

What distinguishes the look-ahead-carry adder?

It is slower than the ripple-carry adder. It is easier to implement logically than a full adder. It is faster than a ripple-carry adder. It requires advance knowledge of the final answer.

What is wrong, if anything, with the circuit in Figure 6-3 based on the logic analyzer display accompanying the circuit?

The CO terminal is shorted to ground. The S1 output is shorted to Vcc. The P1 input is not being added into the total. Nothing is wrong; the circuit is functioning correctly.

Solve this binary problem:

11001001 10010000 01101110 01110110

The binary subtraction 0 0 =

difference = 0 borrow = 0 difference = 1 borrow = 0 difference = 1 borrow = 1 difference = 0 borrow = 1

Solve this binary problem: 01000110 00001010 =

0111 10011 1001 0011

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

system is:
0 to 64 0 to 100 0 to 127 0 to 256

Solve this BCD problem: 0100 + 0110 =

00010000 BCD 00010111 BCD 00001011 BCD 00010011 BCD

One way to make a four-bit adder perform subtraction is by:

inverting the output. inverting the carry-in. inverting the B inputs. grounding the B inputs.

Solve this binary problem:

1001 0110 0111 0101

Solve this binary problem: 01110010 01001000 =

00011010 00101010 01110010 00111100

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

If B[7..0] = 10100101, what is the value of B[6..2]?

10100 01001 10010

00101

If [A] = 1011 1010, [B] = 0011 0110, and [C] = [A] [B], what is [C 4..2] in decimal?
1 2 3 4

What are constants in VHDL code?

Fixed numbers represented by a name Fixed variables used in functions Fixed number types Constants do not exist in VHDL code.

In VHDL, what is a GENERATE statement?

The start statement of a program Not used in VHDL or ADHL A way to get the computer to generate a program from a circuit diagram A way to tell the compiler to replicate several components

The Submit Answers for Grading feature requires scripting to function. Your browser either does not support scripting or you have turned scripting off. So, the Submit Answers for Grading button below will not work. The following Submit Answers for Grading button is provided in its place and will clear your answers: Submit Answers for Grading The Clear Answers and Start Over feature requires scripting to function. Your browser either does not support scripting or you have turned scripting off. So, the Clear Answers and Start Over button below will not work. The following Clear Answers button is provided in its place and will clear your answers: Clear Answers

Copy ri ght 1995 - 2010 Pearson Education . Al l ri ghts reserv ed. P ea rson P renti ce Ha l l i s a n i mpri nt of Pearson .

Legal Notice | Privacy Policy | Permissions

[Return to the T op of this P age]: [Return to the T op of this P age]