Preview

Half Adder

Good Essays
Open Document
Open Document
2129 Words
Grammar
Grammar
Plagiarism
Plagiarism
Writing
Writing
Score
Score
Half Adder
University of the East
College of Engineering
Electronics and Communications Engineering Department

Experiment 5:

ADDERS

Lugtu ,John Kelly S.
20081107280
Grade

Engr. Oliver G. Daiton
Instructor

EXPERIMENT NO. 5
ADDERS
OBJECTIVES

1. To verify the operations of a half adder and a full adder.
2. To determine the differences between the half adder and full adder.
3. To study the operation of full adder MSI IC.

SKILLS REQUIRED

For the experiment to proceed smoothly, the student must be

1. Familiar with logic gates.
2. Familiar with addition of binary numbers

MATERIALS AND EQUIPMENTS NEEDED

Logic Trainer or breadboard Logic ICs: 7486, 7408, 7432, 7483 Connecting wires Long nose pliers Optional: Dc power supply LED’s

PROCEDURES

PART A. HALF ADDER

Step 1. Connect the circuit as shown in figure 1.

Figure 1. Half Adder Circuit

Step 2. Apply the input combinations given table 1 and observe the output. Which LED represents the SUM and which LED represents the CARRY?

Table 1

SW1
SW2
LED1
LED2
0
0

0
1

1
0

1
1

Step 3. Turn off power and disconnect all wires. Remove the ICs.

PART B. FULL ADDER CIRCUIT

Step 1. Connect the full-adder circuit shown in figure 2 using the necessary IC.

Figure 2. Full Adder Circuit

Step 2. Apply the input combinations given table 1 and observe the output. Which LED represents the SUM and which LED represents the CARRY?

Table 2

SW 1
SW 2
SW 3
LED 1
LED 2
0
0
0

0
0
1

0
1
0

0
1
1

1
0
0

1
0
1

1
1
0

1
1
1

Step 3. Turn off power and disconnect all wires and remove ICs.

PART C. MSI ADDER CIRCUIT

Part B. MSI full adder

Step 1. Turn the power of trainer off.

Step 2. Wire the 74LS83 as shown in figure 3. Use the data switches for the input signals and the LED for the indicators

Figure 3.

You May Also Find These Documents Helpful

  • Good Essays

    Nt1310 Unit 9 Exam Paper

    • 486 Words
    • 2 Pages

    Following the two scenarios where if one bit is converted and results in the same received pattern +-0+-0-+…

    • 486 Words
    • 2 Pages
    Good Essays
  • Good Essays

    Pt1420 Unit 5 Study Guide

    • 2789 Words
    • 12 Pages

    2. Convert the binary number to hexadecimal by grouping bits in threes, starting from right.…

    • 2789 Words
    • 12 Pages
    Good Essays
  • Satisfactory Essays

    Step 3: Complete the following pseudocode based on the algorithm and the variables you declared above.…

    • 777 Words
    • 4 Pages
    Satisfactory Essays
  • Satisfactory Essays

    Homework Week 2

    • 743 Words
    • 3 Pages

    c. Design an algorithm in pseudocode to solve this problem. Make sure to include steps to get each input and generate each output.…

    • 743 Words
    • 3 Pages
    Satisfactory Essays
  • Good Essays

    From the previous POW it was concluded that it would take 5 weighings as described by the equation for an unknown item value:…

    • 1383 Words
    • 6 Pages
    Good Essays
  • Satisfactory Essays

    Number Conversions

    • 180 Words
    • 2 Pages

    2.Convert your binary result back into decimal to prove your answer is correct. This is also…

    • 180 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    ECT114 Week3 Homework

    • 1022 Words
    • 15 Pages

    TP1 is the output of an OR gate. The Boolean operator for the OR gate is + and the inputs are A and B. Refer to Chapter 3 of the textbook for more information.…

    • 1022 Words
    • 15 Pages
    Satisfactory Essays
  • Good Essays

    Compter Science

    • 819 Words
    • 4 Pages

    truth table construction, subexpression construction using AND and NOT gates, subexpression combination using OR gates, circuit diagram production…

    • 819 Words
    • 4 Pages
    Good Essays
  • Satisfactory Essays

    6. In the “Cum Sum” column, calculate the cumulative sum (running total) of the subtotal count. You need to write a nested formula that combines IF, Sum, and ISNUMBER functions.…

    • 432 Words
    • 2 Pages
    Satisfactory Essays
  • Satisfactory Essays

    quiz 1 answer

    • 291 Words
    • 5 Pages

    You have 20 minutes to complete and turn in this quiz. Each question is worth 20 points.…

    • 291 Words
    • 5 Pages
    Satisfactory Essays
  • Good Essays

    001 10011000 1010100 10001111100 1011100101011100 101100011101001 1011110100011010 00001010010110010 1001010101100111 1111010101000101 1101001101010011 001010010101010 1010101000110010 010101001011000 110101100011010 11010100001011 001010100110 1001010010 IP Addressing and Subnetting Workbook Version 1.1 11111110 10010101 00011011 11010011 10000110 IP Address Classes Class A 1 – 127 (Network 127 is reserved for loopback and internal testing) 00000000.00000000.00000000.00000000 Leading bit pattern 0 Network . Host . Host .…

    • 5619 Words
    • 94 Pages
    Good Essays
  • Satisfactory Essays

    A Boolean expression for a logic circuit may be reduced to a simpler form The simplified expression can then be used to implement a circuit equivalent to the original circuit Consider the following example:…

    • 3354 Words
    • 14 Pages
    Satisfactory Essays
  • Satisfactory Essays

    let her go passenger tabs

    • 2503 Words
    • 83 Pages

    Let Her Go Passenger Tabbed by www.GoliathGuitarTutorials.com Standard tuning 1 = E 4=D 2=…

    • 2503 Words
    • 83 Pages
    Satisfactory Essays
  • Better Essays

    MATLAB EL6114

    • 554 Words
    • 3 Pages

    It use the basic principle of convolution. When this matrix multiple x’, every line of this matrix multiple x’ and finally add together.…

    • 554 Words
    • 3 Pages
    Better Essays
  • Satisfactory Essays

    Logic Gates

    • 754 Words
    • 4 Pages

    A half-adder (HA) is an adder that accepts two inputs and gives two outputs. The two inputs are the two single bit binary values that will be added to each other. The two outputs represent the sum. We need two outputs (rather than one output) because the sum may have a carry bit. For example, in binary, 1+0 = 1. This situation has no carry bit in the output. In other words, the output itself is 1 bit. However, if we add 1+1, we get 10. This output is 2 bits long. This is a case where the carry-bit for the output is needed. A half adder consists of two logic gates. These are an AND gate, and an Exclusive OR gate. A diagram of a half adder is shown below.…

    • 754 Words
    • 4 Pages
    Satisfactory Essays