Presentation is loading. Please wait.

Presentation is loading. Please wait.

February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16.

Published byHilary Wilkinson Modified over 8 years ago

Similar presentations

Presentation on theme: "February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16."— Presentation transcript:

1 February 23, 2009

2 Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16

3 Digital Electronics Logic “Gates” Just Boolean Algebra! ANDNAND (NOT AND) ORNOR (NOT OR) XOR (Inequality) XNOR (NOT XOR) (Tests equality) NOT

4 Try it out Find all ordered triples that make this circuit true.

5 Solution Convert to boolean algebra: (A XOR B) XOR (B OR C) Truth table: Evaluate each part individually

6 More challenging Find all gates (AND/OR/NAND/NOR/XOR/XNOR) that can replace the “X” such that only one tuple makes the circuit true.

7 Solution

Download ppt "February 23, 2009. Announcements ACSL – March 9 Digital Electronics – 2 Graph Theory – 2 Boolean Algebra – 1 USACO – March 13-16."

Similar presentations

Logic Gates.

Logic Gates.
CT455: Computer Organization Logic gate

CT455: Computer Organization Logic gate
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:

Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.

ECE 3110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR, Parity Circuits, Comparators.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.

Digital Electronics Dan Simon Cleveland State University ESC 120 Revised December 30, 2010.
DIGITAL SYSTEMS TCE1111 1 OTHER COMBINATIONAL LOGIC CIRCUITS WEEK 7 AND WEEK 8 (LECTURE 1 OF 3) COMPARATORS CODE CONVERTERS.

DIGITAL SYSTEMS TCE OTHER COMBINATIONAL LOGIC CIRCUITS WEEK 7 AND WEEK 8 (LECTURE 1 OF 3) COMPARATORS CODE CONVERTERS.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.

Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.

TDC 311 Digital Logic. Truth Tables  AND  OR  NOT  NAND  NOR  XOR  XNOR.
Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.

Erik Jonsson School of Engineering and Computer Science FEARLESS Engineeringwww.utdallas.edu/~pervin EE/CE 2310 – HON/002 Introduction to Digital Systems.
GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.

GK-12 Student designed project (AP physics) Digital logic and Boolean algebra exercise. IC logic gates brought from Stevens were used in making simple.
XOR, XNOR, and Binary Adders

XOR, XNOR, and Binary Adders
Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office 305.02,

Logical Circuit Design Week 5: Combinational Logic Circuits Mentor Hamiti, MSc Office ,
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.

XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.

1 Section 10.2 Boolean Algebra Motivation: Notice the list of corresponding properties for the algebra of sets and the algebra of propositional wffs. These.
What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.

What is an And Gate? It is a digital circuit that produce logical operations The logical operations are call Boolean logical Boolean operation consist.
 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.

 In studying digital integrated circuits, one must start with the simplest group of circuit, the SSIs or Small Scale Integrated Circuits. Since these.
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Basic logic gates  AND gate:The truth table is given by A.BBA 000 010 001 111.

Basic logic gates  AND gate:The truth table is given by A.BBA
BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.

BASIC LOGIC GATES. In studying digital in integrated circuits, one must start with the simples group of circuits, the SSIs or Small Scale Integrated Circuits.

Similar presentations

Ads by Google