Scribd
Upload
20 views5 pages

Week 4

The document outlines an experiment focused on designing and implementing a logic gate circuit based on a specified Boolean expression. It includes background theory on Boolean expressions, required hardware, procedures for building the circuit, and review questions to assess understanding. The learning outcomes aim to ensure students can comprehend complex Boolean expressions and design corresponding logic circuits.

Uploaded by

parirani1535
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
20 views5 pages

Week 4

The document outlines an experiment focused on designing and implementing a logic gate circuit based on a specified Boolean expression. It includes background theory on Boolean expressions, required hardware, procedures for building the circuit, and review questions to assess understanding. The learning outcomes aim to ensure students can comprehend complex Boolean expressions and design corresponding logic circuits.

Uploaded by

parirani1535
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/ 5

Experiment # 04

OBJECTIVE:
To design and implement a logic gate circuit for the given Boolean expression

BACKGROUND THEORY:
In computer science, a Boolean expression is an expression in a programming language that
produces a Boolean value when evaluated, i.e. one of true or false. A Boolean expression may
be composed of a combination of the Boolean constants true or false, Boolean-typed
variables, Boolean-valued operators, and Boolean-valued functions. Boolean expressions
correspond to propositional formulas in logic and are a special case of Boolean circuits.

Most programming languages have the Boolean operators OR, AND and NOT; in C and some
newer languages, these are represented by "||" (double pipe character), "&&" (double
ampersand) and "!" (Exclamation point) respectively, while the corresponding bitwise
operations are represented by "|", "&" and "~" (tilde). In theoretical literature the symbols
used are often "+" (plus), "·" (dot) and over bar, or "䴒" (cup), "䴑" (cap) and "¬" or "_"
(prime).

In Boolean expressions, we observe the regular order of operations: Multiplication (AND)


comes before addition (OR). Thus, when we write , we mean .We can use
parentheses when this order of operations isn't what we want. For NOT, the bar over the
expression indicates the extent of the expression to which it applies; thus, represents
NOT x OR y), while represents (NOT A) OR (NOT B).
A warning: Students new to Boolean expressions frequently try to abbreviate as ,
that is, they draw a single line over the whole expression, rather than two separate lines over
the two individual pieces. This abbreviation is wrong.

EXAMPLE PROBLEM

Every expression directly corresponds to a circuit and vice versa. To determine the expression
corresponding to a logic circuit, we feed expressions through the circuit just as values propagate
through it. Suppose we do this for our below circuit
LAB TASK

Design a logic gate circuit for the Boolean expression given below:

A B C Y

L L L

L L H

L H L

L H H

H L L

H L H

H H L

H H H

HARDWARE REQUIRED:
• Power supply with cables
• Breadboard
• Logic gate ICs: (1) AND Gate (2) OR Gate (3) NOT Gate
• LEDs
• Logic Probe (optional)

PROCEDURE:

1. Build the circuit on the bread board or electronic workbench software. 2.


Check the Output (Y) of the circuit after applying Inputs (A, B, C)
3. Compute the truth tables.

Home Activity:

By using Multisim, construct a logic gate circuit of given Boolean expression and also
determine the truth table of this expression

Y= A.B + ( )

Comment your name and roll number on design suite and attach the screen shot at the
end of experiment#4.
REVIEW QUESTIONS:

Q.1) Does the theoretical calculations confirmed by Experimental findings? If yes, what is the
advantage in designing the circuits on paper rather than going straight to Hardware implementation
without calculation?

Q.2) Write the Boolean expression for each of the logic circuits

a)_ b)_ c)_

Q.3) What have you learnt from this experiment?

LEARNING OUTCOMES:

Upon successful completion of the lab, students will be able to:

LO1: Understand fairly complex Boolean expressions.

LO2: Design a Logic Circuit for a given Boolean expression


Lab’s Evaluation Sheet

Students Registration No

Date Performed:

Group No:

Date of Submission

Total Marks /Grade


Sr. No. Categories
Marks/Grade Obtained

1 Student’s Behavior 0.25

2 Lab Performance 0.25

3 On Time Submission 0.25

4 Home Activity 0.25

Net Result 1

You might also like