Question

Results Circuit (a) Circuit (b) Circuit (c) Circuit (d) B F Table 10-2: Truth Table for Circuit in Figure 10-2 2. D Symbol 46) 6) 40 Figure 10-2

2. The circuits in Figure 10- 2 (a) and (d) constitute a half-adder. Explain why this is so.

3. Logic outputs are said to be “asserted” high or low depending upon which level (high or low) is “active” (that is, produces the desired effect. Look at your truth table for the 7447 (Table 10- 3). Are its outputs asserted high or asserted low? What about the inputs to the 7447?

4. How do you explain the strange symbols that are displayed on the 7 segment display when the numbers 1010, 1011, 1100, 1101, 1110, and 1111 are applied to the input terminals DCBA?

5. Which is the most significant bit (A, B, C, or D) of the inputs to the 7447 and which is the least significant bit? Could that be reversed? If not explain why not. If so, explain how

0 0
Add a comment Improve this question Transcribed image text
Answer #1

Answers:

2. The truth table of a Half-adder is

A B    Sum    Carry_out

0 0 0    0

0 1 1    0

1 0 1    0

1 1 0    1

You would notice that Carry_out is nothing but ANDing of A and B. Therefore the circuit in 10.2b) computes the carry_cout

You would also notice that Sum is XORing of A and B. This is done by circuit of 10.2d).

So circuits of 10.2b and d together constitute a half-adder.

Answer 3:

As per the truth table 10.3 the outputs of 7447 are asserted high. That is when a segment of the 7-segment display needs to glow, the corresponding output from 7447 goes high. The inputs are also asserted high (BCD 0 is input as 0000, BCD 1 is input as 0001 and so on).

Having said this, if you check out the truth-table of 7447 in its datasheet (http://html.alldatasheet.com/html-pdf/80216/NSC/7447/187/4/7447.html) you will find that outputs are asserted low. So I think the truth-table in 10.3 is actually a complement of actual 7447 truth table.

Answer 4:

These six symbols correspond to inputs 1010, 1011, 1100, 1101, 1110 and 1111. In hex these are A, B, C , D, E and F respectively. These letters cannot be adequately displayed using just the seven-segments.

Answer 5:

D is the most significant input bit, A is the least-significant input bit. Yes, these can be reversed by inverting DCBA to /D /C /B /A before inputting them to 7447. So you will need to use four additional NOT gates.

Hope this helps.

PS: There seems to be another mistake in truth-table in 10.3. The output corresponding to DCBA = 1000 should be all high. This table shows e output as 0, which is incorrect.

Add a comment
Know the answer?
Add Answer to:
2. The circuits in Figure 10- 2 (a) and (d) constitute a half-adder. Explain why this...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • Truth Table Wire up the following 2-bit adder circuit shown in Figure 2. Connect the inputs...

    Truth Table Wire up the following 2-bit adder circuit shown in Figure 2. Connect the inputs to the logic switches on the proto-burnd and the outputs to the LED indicators. Fill out a truth table for all 16 combinations of the input switches, and verify that the circuit behaves as expected Disconnect the Ao bit from the switch and connect it to the TTL function generator. Set bit A1 to 0 and Bo and B to . Measure the propagation...

  • Preparation (Pre-lab) Before coming to the first lab session, complete the following tasks: Generate a truth...

    Preparation (Pre-lab) Before coming to the first lab session, complete the following tasks: Generate a truth table showing inputs vs outputs for the following circuit blocks in Part I: Comparator, Circuit A, and Circuit B. o Use the truth tables to produce minimized SOP (sum of products) for the Comparator, Circuit A and Circuit B. Part I - Simple Binary to BCD Conversion Design Specifications You are to design a circuit that converts a four-bit binary number V[3..0] = V[3]...

  • A seven segment decoder is a digital circuit that displays an input value 0 through 9 as a digital output in the 7-segment display. The behavior of this design can be modeled with the schematic diagra...

    A seven segment decoder is a digital circuit that displays an input value 0 through 9 as a digital output in the 7-segment display. The behavior of this design can be modeled with the schematic diagram below, where DCBA is the 4-bit input (D is the most significant bit and A is the least significant bit) and abcdefg is the 7-segment output. 2. (20 POINTS) A seven segment decoder is a digital circuit that displays an input value 0 through...

  • 3. PRELAB 1. A half adder is a circuit that has two inputs, A and B,...

    3. PRELAB 1. A half adder is a circuit that has two inputs, A and B, and two outputs, sum and carry. It adds A and B according to the rules of binary addition and outputs the sum and carry. Design a half-adder circuit using one XOR gate and one AND gate. Verify your design through truth table and with Multisim. 2. Whereas the half adder added two inputs A and B, the full adder adds three inputs together, A,...

  • 1. A 2-bit adder may be constructed by connection two full adders (i.e. 1-bit adders) or directly...

    Can you please show the work!plzz 1. A 2-bit adder may be constructed by connection two full adders (i.e. 1-bit adders) or directly. For the latter, suppose the inputs (corresponding to the operands A and B) are A, Ao, B1 and Bo; and the outputs are So and S, for the 2-bit sum, S, and a carry-out, C . Give a truth table for the "direct" adder » From the truth table, derive a logic expression in sum-of-products form Give...

  • Please help me with 1-7 dale seriäi diagra lor design of a tull adder (fulladder.sch). Full-Adder...

    Please help me with 1-7 dale seriäi diagra lor design of a tull adder (fulladder.sch). Full-Adder Full-adder is the basic building block of many arithmetic aircuits. A single ful-adder adds two bits, A and B, and put the results in S. Cn and Cou signals are added to the full-adder circuit to make it usable for adding mulit-bit numbers. The truth table for a full adder circuit is shown below 0 101 0 10 1 0 3. Construct the K...

  • Identify the inputs and outputs of a one-bit binary full adder 2. Create a truth table...

    Identify the inputs and outputs of a one-bit binary full adder 2. Create a truth table for the full adder 3. Write an equation for each output as a function of the inputs 4. Minimize (simplify) each equation

  • Use logism or any other circuit simulation program: A half adder is adequate for summing the...

    Use logism or any other circuit simulation program: A half adder is adequate for summing the low-order bits of two multi-bit numbers, but it will not work for a bit in the middle of a number because it does not handle the carry into the position from the right. A full adder is needed. A full adder is built up from two half adders. The Sum output line is 1 if an odd number of the inputs A, B, and...

  • please answers to all thanks. Alt Car Ripple Blanking in Seven-Segment Decoders 4. In the following...

    please answers to all thanks. Alt Car Ripple Blanking in Seven-Segment Decoders 4. In the following drawings, four 741547 seven segment decoders are configured to suppress leading or trailing zeros, using the ripple-blanking feature of the decoder a. Complete each drawing to show how to interconnect the decaders to display the digits and blank displays as shown. [2 marks for each drawing: 4 marks totall b. Label each set of decoder inputs (DCBA, RBI) and output (RBO only) with the...

  • a full-adder circuit is used to add 2 bits A and B and the carry (Cin)...

    a full-adder circuit is used to add 2 bits A and B and the carry (Cin) that resulted from the addition of the previous 2 bits. It then produces a SUM S and a carry out (Cout) that would be added to the more significant bits. Generate a truth table that has inputs A, B and Cin and the 2 outputs S and Cout. Find the logical function from the truth table and simplify it, if possible. Implement the function...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT