Boolean Algebra Binary Arithmetic August 28, 2001 Ellen Spertus MCS 111.

Slides:



Advertisements
Similar presentations
CT455: Computer Organization Logic gate
Advertisements

(CSC 102) Discrete Structures Lecture 5.
Computer Organization and Architecture Tutorial 6 Kenneth Lee.
IEEE’s Hands on Practical Electronics (HOPE) Lesson 9: CMOS, Digital Logic.
Appendix B Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.
Chapter 11_1 (chap 10 ed 8) Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean.
Boolean Algebra and Logic Gate
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Digital Design II.
Binary & Decimal numbers = 3* * *10 + 5*1 = 3* * * *10 0 Decimal system: Ten digits: 0,1,2,3,…,9 Example:
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Logic Gates Circuits to manipulate 0’s and 1’s. 0’s and 1’s used for numbers Also to make decisions within the computer. In that context, 1 corresponds.
Revision Introductory Lesson
22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.
Chapter 10_1 Digital Logic. Irvine, Kip R. Assembly Language for Intel-Based Computers, NOT AND OR XOR NAND NOR Truth Tables Boolean Operators.
Binary Codes Computers and other digital systems "work" with binary numbers. I/P & O/P is usually done using decimal numbers, alphabetics, special symbols.
Logic and data representation Revision. AND gate A B A B All inputs have to be true ( i.e 1) for the output of the gate to be high, in all other cases.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
Binary Numbers.
Summer 2014 Chapter 1: Basic Concepts. Irvine, Kip R. Assembly Language for Intel-Based Computers 6/e, Chapter Overview Welcome to Assembly Language.
Information and Programs. Foundations of Computing Information –Binary numbers –Integers and Floating Point –Booleans (True, False) –Characters –Variables.
Fall 2012: FCM 708 Foundation I Lecture 2 Prof. Shamik Sengupta
Computer Science 210 Computer Organization Introduction to Boolean Algebra.
CSC Intro. to Computing Lecture 5: Boolean Logic, Gates, & Circuits.
CPU Internal memory I/O interface circuit System bus
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
CPS3340 COMPUTER ARCHITECTURE Fall Semester, /05/2013 Lecture 4: Basics of Logic Design Instructor: Ashraf Yaseen DEPARTMENT OF MATH & COMPUTER.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
CMP 100 Introduction to Computing Lecture Binary Numbers & Logic Operations.
Ellen Spertus MCS 111 October 16, 2001 Review. 2 What you will learn this semester Given devices that implement simple boolean functions… Understand how.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
Appendix B: Digital Logic
COMPUTER ARCHITECTURE & OPERATIONS I Instructor: Yaohang Li.
Logic Simplification-Using Boolean Laws Logic Design Laboratory EE 2121 Lectures By Manesh T EE2121-In Charge
DIGITAL ELECTRONICS. Everything in digital world is based on binary system. Numerically it involves only two symbols 0 or 1. –0 = False = No –1 = True.
Number Representation 1 Lecture 2. Outcomes By the end of the session you should: – Understand what bits/bytes/words are. – Understanding conversion between.
Fixed-point and floating-point numbers Ellen Spertus MCS 111 October 4, 2001.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
Chapter 3 Boolean Algebra and Digital Logic T103: Computer architecture, logic and information processing.
Dr. ClincyLecture Slide 1 CS6020- Chapter 3 (3A and ) Dr. Clincy Professor of CS First Exam - Tuesday, September 6th Coverage: All subjects up to.
Number Systems Decimal Can you write 12,045 in expanded form? Base? Allowable digits for each place?
Binary & Decimal numbers
Logic gates.
Assembly Lab1 - Review.
Computer Architecture & Operations I
Morgan Kaufmann Publishers
Computer Code.
Logic Gates and Boolean Algebra
Computer Science 210 Computer Organization
CSIS-110 Introduction to Computer Science
Digital Technology.
CS Chapter 3 (3A and ) Part 1 of 8
Binary numbers: Week 7 Lesson 1
Information Technology Introduction to Number System
COSC 3330/6308 First Review Session
CS Chapter 3 (3A and ) Part 1 of 8
Number System conversions
Digital Signals Digital Signals have two basic states:
University of Gujrat Department of Computer Science
EEL 3705 / 3705L Digital Logic Design
Number Systems Decimal (base 10) { }
Computer Science 210 Computer Organization
Dr. Clincy Professor of CS
Digital Logic.
Logic Gates.
Bits and Bytes Topics Representing information as bits
ECB2212-Digital Electronics Boolean algebra
Starter Using the fingers on only one hand, what is the highest number you can count to? Rules: You must start at 1 You must count sequentially (i.e.
Lab Instructors will overview the MSP430
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Presentation transcript:

Boolean Algebra Binary Arithmetic August 28, 2001 Ellen Spertus MCS 111

2 What you will learn this semester Given devices that implement simple boolean functions… Understand how a computer works –Build an actual computer that you will program –Study the MIPS architecture Write assembly language programs Learn the implementation of a MIPS subset

3 How you will learn Readings Lectures and discussion Homework assignments to review lecture material  Lab assignments to apply ideas in depth (every 2-3 weeks)

4 Boolean algebra George Boole ( ) What is an algebra? Boolean values Boolean operations Boolean functions

5 What is an algebra? Term from Hisab al-jabr w'al-muqabala by al-Khwarizmi (~ , Baghdad) Consists of –a set of values (e.g., the integers) –a set of functions multiplication addition

6 Expressing functions What’s a function? What are these functions? Why is this a bad way of expressing a function over the integers?

7 Boolean values false 0 low true 1 high

8 Boolean operations identity not or and xor (exclusive or) nand (not and) nor (not or)

9 Identity 0 Note: Bebop calls this “buf” (for “buffer”).

10 Not 0 Note: Some people write x’ instead of x. The “bubble” (or “bobble”) means “not”.

11 And Notes: Some people write a^b or a&b. The gate is shaped like a “D” as in “anD”.

12 Or Note: Some people write a  b or a|b.

13 Exclusive-or (xor)

14 Nand

15 Nor

16 What you will learn Given devices that implement simple boolean functions… Understand how a computer works

17 Base-10 (decimal) arithmetic Uses the ten numbers from 0 to 9 Each column represents a power of 10

18 Base-2 (binary) arithmetic Uses the two numbers from 0 to 1 Every column represents a power of 2

19 Converting from base-2 to base-10

20 Converting from base-10 to base-2

21 Addition Base-10Base-2 Note: A binary digit is called a bit. The bit with the lowest exponent (2 0 ) is called the least significant bit (LSB). The bit with the highest exponent is the most significant bit (MSB).

22 Practice binary arithmetic

23 Count on your fingers! How high can you count with –5 fingers? –10 fingers?

24 Looking ahead For you to do –Complete and turn in information form –Read syllabus and policies –Homework, due Tuesday, September 4 Coming up –Thursday: Digital computing –Next week: First lab sessions