Scribd
Upload
6 views2 pages

Electronics Practicals Summary

The document covers the realization of basic logic gates using discrete components, including circuit diagrams, truth tables, and verification processes. It also discusses De-Morgan's Theorems, half and full adders and subtractors, BCD to 7-segment display conversion, and binary to Gray code conversion. Each section includes diagrams, procedures, and results confirming the successful implementation of the logic functions.

Uploaded by

mohitedition4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
6 views2 pages

Electronics Practicals Summary

The document covers the realization of basic logic gates using discrete components, including circuit diagrams, truth tables, and verification processes. It also discusses De-Morgan's Theorems, half and full adders and subtractors, BCD to 7-segment display conversion, and binary to Gray code conversion. Each section includes diagrams, procedures, and results confirming the successful implementation of the logic functions.

Uploaded by

mohitedition4
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

A2: Realization of Basic Gates Using Discrete Components

1. Circuit Diagrams:
AND Gate: Inputs A & B via diodes to a point, then resistor to GND. Output at the common point.
OR Gate: Inputs A & B via diodes to output point, resistor to GND.
NOT Gate: Input via resistor to transistor base, output from collector, emitter to GND.

2. Truth Tables & Boolean Equations:


AND: A . B | OR: A + B | NOT: A'

3. Connection Verification: Verify with examiner before power-on.


4. Observations: Test all inputs, record outputs.
5. Results & Conclusion: Outputs match truth tables - successful.
6. What is a Logic Gate? Performs basic logical functions on binary inputs.
7. EX-OR Gate: Symbol like OR with extra curve. Equation: A XOR B = A'B + AB'

A4: Verification of De-Morgan's Theorems


1. Theorems:
- 1st: (A + B)' = A' . B'
- 2nd: (A . B)' = A' + B'
2. Diagrams:
- 1st LHS: NOR; RHS: NOTs then AND.
- 2nd LHS: NAND; RHS: NOTs then OR.
3. Truth Tables: Match confirms validity.
4. Bubbled Gates: Bubbled AND = NOR, Bubbled OR = NAND.
5. Significance: Simplifies logic, used with universal gates.

A5: Half & Full Adder Using Logic Gates


1. Diagrams:
Half: S = A XOR B, C = A . B
Full: S = A XOR B XOR Cin, Cout = AB + Cin(A XOR B)

2. Observations: Test all input combos.


3. Connections: Check with examiner before power.
4. Results: Outputs match expected.
5. Statements:
Half Adder: Adds 2 bits. Full Adder: Adds 3 bits.
6. XOR as Controlled Inverter: XOR with 0 = input, 1 = inverted.
7. Binary Addition: 11011 + 10101 = 110000

A15: BCD to 7-Segment Display using IC 74138 & 7447


1. Diagram: 74138 for digit selection, 7447 to 7-segment.
2. Truth Table: 0 = segment ON (common anode)
3. Procedure: Connect BCD to 7447; 7447 to display.
4. Common Anode vs Cathode:
- Anode: All anodes together, ON with LOW.
- Cathode: All cathodes together, ON with HIGH.
5. Applications: Clocks, meters, counters, lifts.

A8: 3-bit Binary to Gray Code


1. Truth Table:
G2 = B2, G1 = B2 XOR B1, G0 = B1 XOR B0
2. K-Maps: Used for simplification.
3. Logic Diagram: XOR gates for G1, G0; G2 direct.
4. Procedure: Verify diagram, connect, test outputs.
5. Result: Outputs match expected Gray codes.
6. Significance: Gray code reduces error in transitions.
7. Convert Gray 1101001 to Binary:
Result: 1001110

A6: Half & Full Subtractor Using Logic Gates


1. Diagrams:
Half: D = A XOR B, Bo = A' . B
Full: D = A XOR B XOR Bin, Bo = A'.B + (A' XOR B).Bin

2. Observations: Test all input combos.


3. Results: Outputs match truth tables.
4. Statements:
Half: Subtracts 2 bits. Full: Subtracts with borrow.
5. Binary Subtraction: 11011 - 10101 = 00110

You might also like