BUILDING COMPUTER CIRCUITS prepared by Burak Galip ASLAN September, 2006 BOOLEAN LOGIC AND GATES CONTROL CIRCUITS.

Slides:



Advertisements
Similar presentations
TRUTH TABLES Section 1.3.
Advertisements

Chapter 3 section 2. Please form your groups The 1 st column represents all possibilities for the statement that can be either True or False. The 2 nd.
Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.
Hardware Implementations Gates and Circuits. Three Main Gates  AND  OR  NOT.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, Java Version, Third Edition.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition.
Gates and Circuits. Three Main Gates  AND  OR  NOT.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third & Fourth Edition Spring 2008:
CMPUT 101 Lab# – October 1, Lab 4 No demo Questions and the answer sheet can be found on the course website (pdf) Write your answers.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Third Edition.
Chapter 4: The Building Blocks: Binary Numbers, Boolean Logic, and Gates Invitation to Computer Science, C++ Version, Fourth Edition.
Boolean Algebra and Truth Table The mathematics associated with binary number system (or logic) is call Boolean: –“0” and “1”, or “False” and “True” –Calculation.
The Logic of Compound Statements
Constructing A Truth Table XYZF1F InputsOutput Input Combinations 3 – Inputs 8 – Combinations (8 = 2 3 ) Note the binary counting order.
Truth Tables for Negation, Conjunction, and Disjunction.
Section 1-4 Logic Katelyn Donovan MAT 202 Dr. Marinas January 19, 2006.
CPSC 171 Introduction to Computer Science Boolean Logic, Gates, & Circuits.
CS 1308 – Computer Literacy and the Internet. It’s Not Magic  The goal of the next series of lectures is to show you exactly how a computer works. 
Gates and Circuits Monday/Wednesday Week 7. Electronic Circuits  Two types of circuit diagrams See pp. 238 in The Analytical Engine by Decker and Hirshfield.
OCR GCSE Computing © Hodder Education 2013 Slide 1 OCR GCSE Computing Chapter 2: Binary Logic.
Binary Addition CSC 103 September 17, 2007.
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.
Chapter 4 The Building Blocks: Binary Numbers, Boolean Logic, and Gates.
Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.
Logic Gates & Boolean Algebra Chin-Sung Lin Eleanor Roosevelt High School.
Invitation to Computer Science 5th Edition
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
Introduction to Digital Logic and Circuits EE 101, Fall 2015 University of Kentucky.
Conditional Control Flow By Muhammad Ahsan Qadar SACS Programming Fundamentals Workshop 1.
MATH 102 Contemporary Math S. Rook
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
Islamic University Of Gaza, Nael Aburas Data Storage Introduction to computer, 2nd semester, 2010/2011 Mr.Nael Aburas
3.3: Truth Tables. Types of Statements Negation: ~p Conjunction: p ˄ q (p and q) Disjunction: p V q (p or q, or both) Conditional: p → q (if p, then q)
Linear Algebra. Circuits The circuits in computers and other input devices have inputs, each of which is either a 0 or 1, the output is also 0s and 1s.
Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.
How do I show that two compound propositions are logically equivalent?
Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.
CS 1308 – Computer Literacy and the Internet Building the CPU.
Simplifying Boolean Expressions. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xyx XOR y FFF FTT TFT TTF xNOT x FT TF.
TRUTH TABLES. Introduction The truth value of a statement is the classification as true or false which denoted by T or F. A truth table is a listing of.
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
UNIT 01 – LESSON 10 - LOGIC ESSENTIAL QUESTION HOW DO YOU USE LOGICAL REASONING TO PROVE STATEMENTS ARE TRUE? SCHOLARS WILL DETERMINE TRUTH VALUES OF NEGATIONS,
Fundamental Logic Gates And, Or, Not. Logic Gates: The Basics Regulate the flow of electricity within circuits to perform desired functionalities Each.
رياضيات متقطعة لعلوم الحاسب MATH 226. Text books: (Discrete Mathematics and its applications) Kenneth H. Rosen, seventh Edition, 2012, McGraw- Hill.
Section 1.1. Propositions A proposition is a declarative sentence that is either true or false. Examples of propositions: a) The Moon is made of green.
TRUTH TABLES Edited from the original by: Mimi Opkins CECS 100 Fall 2011 Thanks for the ppt.
Minute Paper 4/4/04 Z=50+j86.7=100
Logical Operators (Connectives) We will examine the following logical operators: Negation (NOT,  ) Negation (NOT,  ) Conjunction (AND,  ) Conjunction.
Discrete Structures for Computer Science Presented By: Andrew F. Conn Slides adapted from: Adam J. Lee Lecture #1: Introduction, Propositional Logic August.
Invitation to Computer Science, C++ Version, Fourth Edition
GCSE OCR Computing A451 Binary logic Computing hardware 6.
Activity 1 5 minutes Grab a whiteboard and pen, come to the front and work out the Truth Table for the following circuit: R A B C Q.
Computer Science 210 Computer Organization
Logic Gates.
CSCI-100 Introduction to Computing
Chapter 2.3 Binary Logic.
Invitation to Computer Science, Java Version, Third Edition
Computer Science 210 Computer Organization
Agenda – 2/12/18 Questions? Readings: CSI 4, P
3.4 Computer systems Boolean logic Lesson 2.
Computer Science 210 Computer Organization
Logic Gates.
GCSE Computer Science – Logic Gates & Boolean Expressions
Combinational Circuits
Binary Logic.
Chapter 4 Gates and Circuits.
Truth tables Mrs. Palmer.
Department of Electronics
Presentation transcript:

BUILDING COMPUTER CIRCUITS prepared by Burak Galip ASLAN September, 2006 BOOLEAN LOGIC AND GATES CONTROL CIRCUITS

Boolean logic 1815 – 1864 English mathematician and logician Based on symbolic logic TRUEFALSE Binary 1Binary 0 An expression that results in a value of either TRUE or FALSE Boolean expression 2 < 5a > 7

Some Boolean operators pqp + q TTT TFT FTT FFF pqp. q TTT TFF FTF FFF p~ p TF FT ORANDNOT inputsoutput binary operators unary operator

Gates An electronic device that operates on a collection of binary inputs to produce a binary output gate

AND gate (from two transistors)

OR gate (from two transistors)

NOT gate (one transtistor)

Building computer circuits A collection of gates that transforms a set of binary inputs into a set of binary outputs, and the values of the outputs depend only on the current values of the inputs combinational circuit

Building computer circuits sequential circuit

A circuit construction algorithm construct truth table construct sub-expression with AND & NOT gates construct sub-expression with OR gates construct circuit diagram sum-of-products algorithm For each output column

Control circuits multiplexer

Control circuits decoder

Control circuits multiplexerdecoder

Summary What is Boolean logic? Relation between Boolean logic and gates Combinational circuits (an introduction)

An Invitation to Computer Science, 1st Edition (1995) (Schneider & Gersting) ( Section 4.2 ) Wikipedia & Google September, 2006 References