Chapter 2: Universal Building Blocks. CS105: Great Insights in Computer Science
|
|
|
- Erin Melissa Gardner
- 5 years ago
- Views:
Transcription
1 Chapter 2: Universal Building Blocks CS105: Great Insights in Computer Science
2 Homework 1 It is now available on our website. Answer questions in Word or any text editor and upload it via sakai. No paper please. Office hours for three TAs and me are posted on the website DUE NEXT WEDNESDAY, SEPT 23rd
3 Clicker Questions!
4 Review, OR and
5 Bit Equality The input to the function or circuit has two bits bit1, bit2 The output of the function is one bit out1 The output is true only if the value of both bits is the same. Example, if bit1 = true and bit2 = true, these bits would be equal. First, create a truth table
6 Bit Equality Now, we have truth table, which describes all the information about the function We can make either a logical function or a circuit, because they represent the same thing Second, make a Boolean function!
7 Truth Table to Formula If table is mostly False Make a clause for each True. - not A and not B and C - not A and B and C 2. Or them together. - (not A and not B and C) or (not A and B and C) 3. Simplify, if possible A B C D F F F F F F T T F T F F F T T T T F F F T F T F T T F F T T T F - D = (not A and C) or (not B and B) = not A and C
8 Truth Table to Formula If table is mostly True Make a clause for each False. - not A and B and not C - A and B and C 2. Or them together. - (not A and B and not C) or (A and B and C) 3. Simplify, if possible - B and ((not A and not C) or (A and C)) = B and (A=C) 4. Invert via DeMorgan s Law - D = not(b and (A=C)) = not B or (A xor C)) A B C D F F F T F F T T F T F F F T T T T F F T T F T T T T F T T T T F
9 Bit Equality, Part Deux Lastly, we can make a representation using only, OR and gates from our logical expression!
10 Bit Equality Input: bit1, bit2: Output: out1 = ((bit1 and bit2) or (not bit1 and not bit2)) bit1 bit2 equal OR out1 Output True if either bit1 = True and bit2 = True or bit1 = False and bit2 = False (they are equal).
11 Group Equality Now that we can test two bits for equality, we would like to test a group of 5 bits for equality (two bit patterns). Two groups are equal if each of their bits are equal: bit 0 = bit 0, bit 1 = bit 1, etc. Input: char1, char2 Output: (equal(char1[0],char2[0]) and (equal(char1[1],char2[1]) and (equal(char1[2],char2[2]) and (equal(char1[3],char2[3]) and equal(char1[4],char2[4])))))
12 equal5 Equal5 Diagram equal OR char1 char2 equal OR equal OR equal OR equal OR EQUAL EQUAL EQUAL EQUAL EQUAL 5
13 equal5 Equal5 Diagram equal OR char1 char2 equal OR equal OR equal OR equal OR
14 Equal5 Diagram OR equal OR char1 char equal OR equal OR equal equal5 OR equal
15 Gates in EQUAL5 10 inputs (2 groups of 5), 1 output bit. The equal5 gate consists of - 1 and5 gate - 4 and gates (4 total) - 5 equal gates - 2 and, 2 not, 1 or (5 total) - Total = 29 gates
16 Gates: Could Create And-k: k ins, 1 out (True if all ins are True) Or-k: k ins, 1 out (True if any ins are True) Equal-k: 2 k-bit blocks in, 1 out (True if blocks same) And many other interesting functions
17 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
18 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
19 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
20 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
21 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n 0 2 Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
22 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n 0 2 Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
23 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
24 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
25 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
26 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). n 2 2n Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n.
27 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
28 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
29 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
30 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
31 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
32 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. n 2 2n For n inputs: 2 2n.
33 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
34 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
35 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
36 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
37 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
38 Counting Boolean Functions With 2 input bits, there are 2 2 =4 rows of the truth table (combinations of truth assignments to these variables). Each row can take an output of true or false, for a total of 2 4 =16 tables. For n inputs: 2 2n. n 2 2n
39 Universal Gate A B Take two inputs, A and B. Take four more inputs defining what the gate should output for each combination of A and B. d00 d01 d10 UNIV Output the right bit! d11 3 OR4
40 Algebraic Version Input: (A, B, d00, d01, d10, d11): w = 3(not A, not B, d00) x = 3(not A, B, d01) y = 3(A, not B, d10) z = 3(A, B, d11) Output: OR4(w,x,y,z) hard to follow...
41 Can Represent Them All Almost all multi-input functions require an enormous number of logic gates. However, the most useful ones can be represented succinctly.
42 Binary Numbers!
43 Magic Trick?
44 Reminder: Decimal Notation x100 +0x10 +7x1 = 207
45 Binary Notation x128+0x64+0x32+1x16+1x8+0x4+1x2+0x1 = 154 How can you tell if a binary number is even?
46 Conversion To Binary To go from decimal to binary, start with the biggest power of 2 no bigger than your number. Write down a 1. Subtract the power of 2 from your number. Cut the power of 2 in half. If your remaining number is larger than the power of 2, write down a 1 and subtract the power of 2. If not, write down 0. Repeat by cutting the power of 2 in half (until you get to 1).
47 Conversion To Binary To go from decimal to binary, start with the biggest power of 2 no bigger than your number. If your remaining number is larger than the power of 2, write down a 1 and subtract the power of 2. Write down a 1. Subtract the power of 2 from your number. If not, write down 0. Repeat by cutting the power of 2 in half (until you get to 1). Cut the power of 2 in half. It s a bit like making change.
48 Example: Convert 651 Bigger than: 2 9 = Next power of 2 = =139. Next power of 2 = 8. 1 Next power of 2 = =3 Next power of 2 = Next power of 2 = =11. Next power of 2 = 2. 1 Next power of 2 = =1 Next power of 2 = Last power of 2 = =651 1
49 Welcome to the Club There are 10 kinds of people in the world. Those who understand binary. And those who don t.
Combinational Circuits Digital Logic (Materials taken primarily from:
Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a
Binary Adders: Half Adders and Full Adders
Binary Adders: Half Adders and Full Adders In this set of slides, we present the two basic types of adders: 1. Half adders, and 2. Full adders. Each type of adder functions to add two binary bits. In order
Standard Forms of Expression. Minterms and Maxterms
Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:
Propositional Calculus: Boolean Algebra and Simplification. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus: Boolean Algebra and Simplification CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Topics Motivation: Simplifying Conditional Expressions
1. Mark the correct statement(s)
1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another
QUESTION BANK FOR TEST
CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice
ENGIN 112 Intro to Electrical and Computer Engineering
ENGIN 2 Intro to Electrical and Computer Engineering Lecture 5 Boolean Algebra Overview Logic functions with s and s Building digital circuitry Truth tables Logic symbols and waveforms Boolean algebra
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions
Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make
Binary Values. CSE 410 Lecture 02
Binary Values CSE 410 Lecture 02 Lecture Outline Binary Decimal, Binary, and Hexadecimal Integers Why Place Value Representation Boolean Algebra 2 First: Why Binary? Electronic implementation Easy to store
EE292: Fundamentals of ECE
EE292: Fundamentals of ECE Fall 2012 TTh 10:00-11:15 SEB 1242 Lecture 22 121115 http://www.ee.unlv.edu/~b1morris/ee292/ 2 Outline Review Binary Number Representation Binary Arithmetic Combinatorial Logic
CS2630: Computer Organization Homework 1 Bits, bytes, and memory organization Due January 25, 2017, 11:59pm
CS2630: Computer Organization Homework 1 Bits, bytes, and memory organization Due January 25, 2017, 11:59pm Instructions: Show your work. Correct answers with no work will not receive full credit. Whether
ECE 550D Fundamentals of Computer Systems and Engineering. Fall 2017
ECE 550D Fundamentals of Computer Systems and Engineering Fall 2017 Combinational Logic Prof. John Board Duke University Slides are derived from work by Profs. Tyler Bletsch and Andrew Hilton (Duke) Last
Circuit analysis summary
Boolean Algebra Circuit analysis summary After finding the circuit inputs and outputs, you can come up with either an expression or a truth table to describe what the circuit does. You can easily convert
Propositional Calculus. Math Foundations of Computer Science
Propositional Calculus Math Foundations of Computer Science Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus so that they can use it to
Designing Information Devices and Systems II Fall 2017 Miki Lustig and Michel Maharbiz Discussion 1B
EEC 16B esigning Information evices and ystems II Fall 2017 Miki Lustig and Michel Maharbiz iscussion 1B igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)
Digital Logic Design Exercises. Assignment 1
Assignment 1 For Exercises 1-5, match the following numbers with their definition A Number Natural number C Integer number D Negative number E Rational number 1 A unit of an abstract mathematical system
(Refer Slide Time 3:31)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 5 Logic Simplification In the last lecture we talked about logic functions
Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic
Department of Electrical Engineering McGill University ECSE 221 Introduction to Computer Engineering Assignment 2 Combinational Logic Question 1: Due October 19 th, 2009 A convenient shorthand for specifying
Read this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
Logic Gates and Boolean Algebra ENT263
Logic Gates and Boolean Algebra ENT263 Logic Gates and Boolean Algebra Now that we understand the concept of binary numbers, we will study ways of describing how systems using binary logic levels make
LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology
LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a
CARLETON UNIVERSITY. Laboratory 2.0
CARLETON UNIVERSITY Department of Electronics ELEC 267 Switching Circuits Jan 3, 28 Overview Laboratory 2. A 3-Bit Binary Sign-Extended Adder/Subtracter A binary adder sums two binary numbers for example
Experiment 4 Boolean Functions Implementation
Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.
Lecture #21 March 31, 2004 Introduction to Gates and Circuits
Lecture #21 March 31, 2004 Introduction to Gates and Circuits To this point we have looked at computers strictly from the perspective of assembly language programming. While it is possible to go a great
60-265: Winter ANSWERS Exercise 4 Combinational Circuit Design
60-265: Winter 2010 Computer Architecture I: Digital Design ANSWERS Exercise 4 Combinational Circuit Design Question 1. One-bit Comparator [ 1 mark ] Consider two 1-bit inputs, A and B. If we assume that
LOGIC CIRCUITS. Kirti P_Didital Design 1
LOGIC CIRCUITS Kirti P_Didital Design 1 Introduction The digital system consists of two types of circuits, namely (i) Combinational circuits and (ii) Sequential circuit A combinational circuit consists
Basic Arithmetic (adding and subtracting)
Basic Arithmetic (adding and subtracting) Digital logic to show add/subtract Boolean algebra abstraction of physical, analog circuit behavior 1 0 CPU components ALU logic circuits logic gates transistors
GC03 Boolean Algebra
Why study? GC3 Boolean Algebra Computers transfer and process binary representations of data. Binary operations are easily represented and manipulated in Boolean algebra! Digital electronics is binary/boolean
LECTURE 4. Logic Design
LECTURE 4 Logic Design LOGIC DESIGN The language of the machine is binary that is, sequences of 1 s and 0 s. But why? At the hardware level, computers are streams of signals. These signals only have two
1010 2?= ?= CS 64 Lecture 2 Data Representation. Decimal Numbers: Base 10. Reading: FLD Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9
CS 64 Lecture 2 Data Representation Reading: FLD 1.2-1.4 Decimal Numbers: Base 10 Digits: 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 Example: 3271 = (3x10 3 ) + (2x10 2 ) + (7x10 1 ) + (1x10 0 ) 1010 10?= 1010 2?= 1
DKT 122/3 DIGITAL SYSTEM 1
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits
Read this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
Logic Design: Part 2
Orange Coast College Business Division Computer Science Department CS 6- Computer Architecture Logic Design: Part 2 Where are we? Number systems Decimal Binary (and related Octal and Hexadecimal) Binary
Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A
EEC 16B esigning Information evices and ystems II pring 2018 J. Roychowdhury and M. Maharbiz iscussion 1A 1 igit Bases (N) p is used to indicate that the number N is expressed in base p. For example, (N)
Midterm Exam Review. CS 2420 :: Fall 2016 Molly O'Neil
Midterm Exam Review CS 2420 :: Fall 2016 Molly O'Neil Midterm Exam Thursday, October 20 In class, pencil & paper exam Closed book, closed notes, no cell phones or calculators, clean desk 20% of your final
Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of
Section 001. Read this before starting!
Points missed: Student's Name: Total score: / points East Tennessee State University Department of Computer and Information Sciences CSCI 25 (Tarnoff) Computer Organization TEST 2 for Fall Semester, 25
CSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session
Name: Email Username: Lab Date and Time: CSC 101: Lab #5 Boolean Logic Practice Due Date: 5:00pm, day after lab session Lab Report: Answer the questions within this document as you encounter them. Also,
Read this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
Combinational Logic Worksheet
Combinational Logic Worksheet Concept Inventory: Truth tables sum-of-products equations implementation using NOT/AND/OR Demorgan s Law, implementation using NAND/NOR Simplification, truth tables w/ don
Lecture (04) Boolean Algebra and Logic Gates
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee ١ Dr. Ahmed ElShafee, ACU : Spring 26, Logic Design Boolean algebra properties basic assumptions and properties: Closure law A set S is
Lecture (04) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee
Lecture (4) Boolean Algebra and Logic Gates By: Dr. Ahmed ElShafee Boolean algebra properties basic assumptions and properties: Closure law A set S is closed with respect to a binary operator, for every
Discrete structures - CS Fall 2017 Questions for chapter 2.1 and 2.2
Discrete structures - CS1802 - Fall 2017 Questions for chapter 2.1 and 2.2 1. (a) For the following switch diagrams, write the corresponding truth table and decide whether they correspond to one of the
Experimental Methods I
Experimental Methods I Computing: Data types and binary representation M.P. Vaughan Learning objectives Understanding data types for digital computers binary representation of different data types: Integers
UNCA CSCI 255 Exam 1 Spring February, This is a closed book and closed notes exam. It is to be turned in by 1:45 PM.
UNCA CSCI 255 Exam 1 Spring 2017 27 February, 2017 This is a closed book and closed notes exam. It is to be turned in by 1:45 PM. Communication with anyone other than the instructor is not allowed during
Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University
Logic Design First Stage Lecture No.5 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Boolean Operations Laws of Boolean Algebra Rules of Boolean Algebra
Bits and Bytes. How do computers compute?
Bits and Bytes How do computers compute? Representing Data All data can be represented with: 1s and 0s on/of true/false Numbers? Five volunteers... Binary Numbers Positional Notation Binary numbers use
Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012
Henry Lin, Department of Electrical and Computer Engineering, California State University, Bakersfield Lecture 7 (Digital Logic) July 24 th, 2012 1 Digital vs Analog Digital signals are binary; analog
Unit 2: Data Storage CS 101, Fall 2018
Unit 2: Data Storage CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Evaluate digital circuits that use AND, OR, XOR, and NOT. Convert binary integers to/from decimal,
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, Third Edition Objectives In this chapter, you will learn about: The binary numbering
1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]
![1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]](/thumbs/93/114163715.jpg "1. Boolean algebra. [6] 2. Constructing a circuit. [4] 3. Number representation [4] 4. Adders [4] 5. ALU [2] 6. Software [4]")
Family Name:.......................... Other Names:.......................... ID Number:.......................... ENGR101: Test 4 May 2009 Instructions Time allowed: 45 minutes. There are 45 marks in
ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two Solutions 26 February 2014
Problem 1 (4 parts, 21 points) Encoders and Pass Gates Part A (8 points) Suppose the circuit below has the following input priority: I 1 > I 3 > I 0 > I 2. Complete the truth table by filling in the input
Read this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Fall Semester,
2.6 BOOLEAN FUNCTIONS
2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses
Propositional Calculus. CS 270: Mathematical Foundations of Computer Science Jeremy Johnson
Propositional Calculus CS 270: Mathematical Foundations of Computer Science Jeremy Johnson Propositional Calculus Objective: To provide students with the concepts and techniques from propositional calculus
(Refer Slide Time 6:48)
Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about
CS140 Lecture 03: The Machinery of Computation: Combinational Logic
CS140 Lecture 03: The Machinery of Computation: Combinational Logic John Magee 25 January 2017 Some material copyright Jones and Bartlett Some slides credit Aaron Stevens 1 Overview/Questions What did
Read this before starting!
Points missed: Student's Name: Total score: /1 points East Tennessee State University Department of Computer and Information Sciences CSCI 215 (Tarnoff) Computer Organization Section 1 TEST 1 for Fall
Grade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions
EE210: Switching Systems Lecture 3: Binary Subtraction, Switching Algebra, Gates, and Algebraic Expressions Prof. YingLi Tian Feb. 5/7, 2019 Department of Electrical Engineering The City College of New
Grade 7/8 Math Circles Fall November 6/7/8 Boolean Logic
Faculty of Mathematics Waterloo, Ontario N2L 3G Centre for Education in Mathematics and Computing Grade 7/8 Math Circles Fall 28 - November 6/7/8 Boolean Logic Logic is everywhere in our daily lives. We
Combinational Circuits
Combinational Circuits Q. What is a combinational circuit? A. Digital: signals are or. A. No feedback: no loops. analog circuits: signals vary continuously sequential circuits: loops allowed (stay tuned)
6. Combinational Circuits. Building Blocks. Digital Circuits. Wires. Q. What is a digital system? A. Digital: signals are 0 or 1.
Digital Circuits 6 Combinational Circuits Q What is a digital system? A Digital: signals are or analog: signals vary continuously Q Why digital systems? A Accurate, reliable, fast, cheap Basic abstractions
Chapter 2. Boolean Expressions:
Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean
Binary. Hexadecimal BINARY CODED DECIMAL
Logical operators Common arithmetic operators, like plus, minus, multiply and divide, works in any number base but the binary number system provides some further operators, called logical operators. Meaning
ENGIN 112. Intro to Electrical and Computer Engineering
ENIN 2 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra ENIN2 L6: More Boolean Algebra September 5, 23 A B Overview Epressing Boolean functions Relationships between algebraic
Read this before starting!
Points missed: Student's Name: Total score: /100 points East Tennessee State University Department of Computer and Information Sciences CSCI 2150 (Tarnoff) Computer Organization TEST 1 for Spring Semester,
01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2006
Introduction to Digital Logic ENGR 34 Computer Architecture Mark L. Chang Fall 26 Acknowledgements Patterson & Hennessy: Book & Lecture Notes Patterson s 997 course notes (U.C. Berkeley CS 52, 997) Tom
Address Class (Exercise) B A
Address Class (Exercise) Address Class 177.100.18.4 B 119.18.45.0 A 192.249.234.191 C 10.10.251.12 A 223.32.232.190 C 129.132.24.2 B 18.250.1.1 A 150.10.15.0 B 197.14.2.0 C 174.17.9.1 B 148.17.9.1 B 193.42.1.1
Starting Boolean Algebra
Boolean Algebra March 2, 27 Diagram for FunChip2 Here is a picture of FunChip2 that we created more or less randomly in class on /25 (used in various Activities): Starting Boolean Algebra Boolean algebra
COMP combinational logic 1 Jan. 18, 2016
In lectures 1 and 2, we looked at representations of numbers. For the case of integers, we saw that we could perform addition of two numbers using a binary representation and using the same algorithm that
MODULE 5 - COMBINATIONAL LOGIC
Introduction to Digital Electronics Module 5: Combinational Logic 1 MODULE 5 - COMBINATIONAL LOGIC OVERVIEW: For any given combination of input binary bits or variables, the logic will have a specific
2. BOOLEAN ALGEBRA 2.1 INTRODUCTION
2. BOOLEAN ALGEBRA 2.1 INTRODUCTION In the previous chapter, we introduced binary numbers and binary arithmetic. As you saw in binary arithmetic and in the handling of floating-point numbers, there is
Lecture 10: Floating Point, Digital Design
Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single
Introduction to Boolean logic and Logical Gates
Introduction to Boolean logic and Logical Gates Institute of Statistics Fall 2014 We saw the importance of the binary number system for data representation in a computer system. We ll see that the construction
At this point in our study of digital circuits, we have two methods for representing combinational logic: schematics and truth tables.
HPTER FIVE oolean lgebra 5.1 Need for oolean Expressions t this point in our study of digital circuits, we have two methods for representing combinational logic: schematics and truth tables. 0 0 0 1 0
This podcast will demonstrate a logical approach as to how a computer adds through logical gates.
This podcast will demonstrate a logical approach as to how a computer adds through logical gates. A computer is a programmable machine that receives input, stores and manipulates data, and provides output
CSC 101: Lab #5 Prelab Boolean Logic Practice Due Date: 5:00pm, day after lab session
Name: Email Username: Lab Date and Time: CSC 101: Lab #5 Prelab Boolean Logic Practice Due Date: 5:00pm, day after lab session Purpose: The purpose of this pre-lab is to provide you with hands-on experience
01 Introduction to Digital Logic. ENGR 3410 Computer Architecture Mark L. Chang Fall 2008
Introduction to Digital Logic ENGR 34 Computer Architecture Mark L. Chang Fall 28 Acknowledgements Patterson & Hennessy: Book & Lecture Notes Patterson s 997 course notes (U.C. Berkeley CS 52, 997) Tom
Computer Organization and Levels of Abstraction
Computer Organization and Levels of Abstraction Announcements PS8 Due today PS9 Due July 22 Sound Lab tonight bring machines and headphones! Binary Search Today Review of binary floating point notation
CDS Computing for Scientists. Midterm Exam Review. Midterm Exam on October 22, 2013
CDS 130-001 Computing for Scientists Midterm Exam Review Midterm Exam on October 22, 2013 1. Review Sheet 2. Sample Midterm Exam CDS 130-001 Computing for Scientists Midterm Exam - Review Sheet The following
4. Write a sum-of-products representation of the following circuit. Y = (A + B + C) (A + B + C)
COP 273, Winter 26 Exercises 2 - combinational logic Questions. How many boolean functions can be defined on n input variables? 2. Consider the function: Y = (A B) (A C) B (a) Draw a combinational logic
ECE 2020B Fundamentals of Digital Design Spring problems, 6 pages Exam Two 26 February 2014
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
Data III & Integers I
Data III & Integers I CSE 351 Spring 2017 Instructor: Ruth Anderson Teaching Assistants: Dylan Johnson Kevin Bi Linxing Preston Jiang Cody Ohlsen Yufang Sun Joshua Curtis Administrivia Everyone has VM
Lecture 10: Floating Point, Digital Design
Lecture 10: Floating Point, Digital Design Today s topics: FP arithmetic Intro to Boolean functions 1 Examples Final representation: (-1) S x (1 + Fraction) x 2 (Exponent Bias) Represent -0.75 ten in single
CS 261 Fall Mike Lam, Professor. Logic Gates
CS 261 Fall 2016 Mike Lam, Professor Logic Gates The final frontier Java programs running on Java VM C programs compiled on Linux Assembly / machine code on CPU + memory??? Switches and electric signals
ECE 2030D Computer Engineering Spring problems, 5 pages Exam Two 8 March 2012
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
Course Syllabus [1/2]
![Course Syllabus [1/2]](/thumbs/81/83845788.jpg "Course Syllabus [1/2]")
Course Syllabus [1/2] Instructor 逄愛君, acpang@csie.ntu.edu.tw Office Number: 417, Office Hour: 15:00~17:00 (Thursday) Textbook Assembly Language for Intel-Based Computers, Kip R. Irvine, Pearson Education,
Data III & Integers I
Data III & Integers I CSE 351 Autumn 2018 Instructor: Justin Hsia Teaching Assistants: Akshat Aggarwal An Wang Andrew Hu Brian Dai Britt Henderson James Shin Kevin Bi Kory Watson Riley Germundson Sophie
DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
DIGITAL CIRCUIT LOGIC UNIT 7: MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES 1 iclicker Question 13 Considering the K-Map, f can be simplified as (2 minutes): A) f = b c + a b c B) f = ab d + a b d AB CD
Computer Organization and Levels of Abstraction
Computer Organization and Levels of Abstraction Announcements Today: PS 7 Lab 8: Sound Lab tonight bring machines and headphones! PA 7 Tomorrow: Lab 9 Friday: PS8 Today (Short) Floating point review Boolean
Philadelphia University Student Name: Student Number:
Philadelphia University Student Name: Student Number: Faculty of Engineering Serial Number: Final Exam, First Semester: 2018/2019 Dept. of Computer Engineering Course Title: Logic Circuits Date: 03/01/2019
SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)
Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called
Spring 2010 CPE231 Digital Logic Section 1 Quiz 1-A. Convert the following numbers from the given base to the other three bases listed in the table:
Section 1 Quiz 1-A Convert the following numbers from the given base to the other three bases listed in the table: Decimal Binary Hexadecimal 1377.140625 10101100001.001001 561.24 454.3125 111000110.0101
COSC 243. Data Representation 3. Lecture 3 - Data Representation 3 1. COSC 243 (Computer Architecture)
COSC 243 Data Representation 3 Lecture 3 - Data Representation 3 1 Data Representation Test Material Lectures 1, 2, and 3 Tutorials 1b, 2a, and 2b During Tutorial a Next Week 12 th and 13 th March If you
LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling
LAB #3: ADDERS and COMPARATORS using 3 types of Verilog Modeling LAB OBJECTIVES 1. Practice designing more combinational logic circuits 2. More experience with equations and the use of K-maps and Boolean
Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)
Chapter 4. Combinational Logic
Chapter 4. Combinational Logic Tong In Oh 1 4.1 Introduction Combinational logic: Logic gates Output determined from only the present combination of inputs Specified by a set of Boolean functions Sequential
ECE 2030B 1:00pm Computer Engineering Spring problems, 5 pages Exam Two 10 March 2010
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate
Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 09 MULTIPLEXERS
Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 09 MULTIPLEXERS OBJECTIVES: To experimentally verify the proper operation of a multiplexer.