Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Digital Logic & Microprocessor Lab: Verifying Gates & Designing Circuits, Lab Reports of Digital Logic Design and Programming

Various tasks for a digital logic and microprocessor lab. Students are required to verify the working of logic gates (OR, AND, NOT, NOR, NAND, X-OR, X-NOR) using truth tables, simplify Boolean expressions, write Boolean expressions in different forms, and design and verify circuits using Multisim. Topics include digital logic, microprocessors, Boolean algebra, and circuit design.

What you will learn

  • How does a NOT gate work?
  • What is the truth table for a NAND gate?
  • How do you verify the working of an OR gate using its truth table?
  • What is the truth table for an AND gate?
  • What is the truth table for a NOR gate?

Typology: Lab Reports

2020/2021

Uploaded on 03/10/2022

sri-pritika-balamurugan
sri-pritika-balamurugan 🇮🇳

4 documents

1 / 26

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
SWE-1003 DIGITAL LOGIC AND
MICROPROCESSOR LAB
NAME:K.SNEHA
REG.NO:19MIS0043
Verification of Logic gates
A.Verify the working of OR gate with its truth table
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff
pf12
pf13
pf14
pf15
pf16
pf17
pf18
pf19
pf1a

Partial preview of the text

Download Digital Logic & Microprocessor Lab: Verifying Gates & Designing Circuits and more Lab Reports Digital Logic Design and Programming in PDF only on Docsity!

SWE-1003 DIGITAL LOGIC AND

MICROPROCESSOR LAB

NAME:K.SNEHA

REG.NO:19MIS

Verification of Logic gates A.Verify the working of OR gate with its truth table

B.Verify the working of AND gate with its truth table

D .Verify the working of NOR gate with its truth table

E .Verify the working of NAND gate with its truth table

G .Verify the working of X-NOR gate with its truth table

  1. Verification of Boolean Expressions

1.X+X’Y=X+Y

3.AB+A’C+BC=AB+A’C

4. PQ+Q’R+WPRV=PQ+Q’R

b) (x + y) (x + y’)

5.Write the following Boolean expressions in Standard Sum of Products form: (b + d)(a’ + b’ + c)

7.Simplify the following Boolean functions: a)F(A,B,C,D)=∏(1,3,5,7,13,15)

b)F(A, B, C, D) = ∑(1, 3, 6, 9, 11, 12, 14)

9.Design a Half adder and verify the circuit using Multisim.

10.Design a Full adder and verify the circuit using

Multisim.