Group 4 Project. James Earthman, Gregg Greenleaf, Zach Harvey, Zac Leids

Similar documents
Advanced Information Storage 02

Department of Computer Science University at Albany, State University of New York Solutions to Sample Discrete Mathematics Examination II (Fall 2007)

Combinational Logic. By : Ali Mustafa

Information Storage and Spintronics 02

XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

CSE 20 DISCRETE MATH. Fall

4.3. Riemann Sums. Riemann Sums. Riemann Sums and Definite Integrals. Objectives

π-day, 2013 Michael Kozdron

1). To introduce and define the subject of mechanics. 2). To introduce Newton's Laws, and to understand the significance of these laws.

CIRCUITS AND ELECTRONICS. The Digital Abstraction

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

The History of Motion. Ms. Thibodeau

Total Time = 90 Minutes, Total Marks = 50. Total /50 /10 /18

A B OUT_0 OUT_1 OUT_2 OUT_

Physics Talk NEWTON S SECOND LAW OF MOTION. Evidence for Newton s Second Law of Motion

THE LOGIC OF COMPOUND STATEMENTS

Integration. Copyright Cengage Learning. All rights reserved.

Cs302 Quiz for MID TERM Exam Solved

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

INTRO TO LIMITS & CALCULUS MR. VELAZQUEZ AP CALCULUS

Physics Talk NEWTON S SECOND LAW OF MOTION. Evidence for Newton s Second Law of Motion

Boolean Algebra & Digital Logic

10/14/2009. Reading: Hambley Chapters

Packet #2: Set Theory & Predicate Calculus. Applied Discrete Mathematics

ENGIN 112 Intro to Electrical and Computer Engineering

COMBINATIONAL LOGIC CIRCUITS. Dr. Mudathir A. Fagiri

Fundamentals of Digital Design

Development of Thought continued. The dispute between rationalism and empiricism concerns the extent to which we

Proofs with Predicate Calculus ITCS 2175 Revision: 1.0. Author: Zachary Wartell Copyright Zachary Wartell, UNCC, 2010 Contributors:?

BOOLEAN ALGEBRA INTRODUCTION SUBSETS

Carry Look Ahead Adders

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

IST 4 Information and Logic

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

Dear AP Calculus AB student,

Quiz 2 Room 10 Evans Hall, 2:10pm Tuesday April 2 (Open Katz only, Calculators OK, 1hr 20mins)

ON1 Big Mock Test 4 October 2013 Answers This test counts 4% of assessment for the course. Time allowed: 10 minutes

Chapter 4: Combinational Logic Solutions to Problems: [1, 5, 9, 12, 19, 23, 30, 33]

Chapter 0. Introduction. An Overview of the Course

A Digitalized Tractarian World

MthEd/Math 300 Williams Fall 2011 Midterm Exam 2

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Unit 4: Computer as a logic machine

Lecture 4 Modeling, Analysis and Simulation in Logic Design. Dr. Yinong Chen


AP Calculus AB. Limits & Continuity. Table of Contents

3. The Logic of Quantified Statements Summary. Aaron Tan August 2017

Notes on Polynomials from Barry Monson, UNB

Leibniz and the Discovery of Calculus. The introduction of calculus to the world in the seventeenth century is often associated

THE LOGIC OF QUANTIFIED STATEMENTS

UNIVERSITI TENAGA NASIONAL. College of Information Technology

THE LOGIC OF COMPOUND STATEMENTS

Digital Logic (2) Boolean Algebra

The Scientific Revolution

MAT2345 Discrete Math

Definition 2. Conjunction of p and q

Discrete Mathematics and Logic II. Predicate Calculus

Philadelphia University Student Name: Student Number:

ELEMENTS IN MATHEMATICS FOR INFORMATION SCIENCE NO.6 TURING MACHINE AND COMPUTABILITY. Tatsuya Hagino

Function of Combinational Logic ENT263

Chapter 2: Introduction to Propositional Logic

The Arithmetic of Reasoning. Chessa Horomanski & Matt Corson

January 5, SWBAT explain Newton s first law by describing it in a series of examples.

EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits)

S C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T

THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements I CHAPTER 3 SECTION 3.

Systems I: Computer Organization and Architecture

Outline. EECS150 - Digital Design Lecture 4 - Boolean Algebra I (Representations of Combinational Logic Circuits) Combinational Logic (CL) Defined

1. Consider the conditional E = p q r. Use de Morgan s laws to write simplified versions of the following : The negation of E : 5 points

What is a Revolution? A Revolution is a complete change, or an overthrow of a government, a social system, etc.

Binary addition example worked out

DE58/DC58 LOGIC DESIGN DEC 2014

The logic is straightforward. Adding two 0s will result in 0. Adding two 1s results in 10 where 1 is the carry bit and 0 is the sum bit.

2. Associative Law: A binary operator * on a set S is said to be associated whenever (A*B)*C = A*(B*C) for all A,B,C S.

PROOFS OF IMPLICATIONS INVOLVING QUANTIFIERS DISTRIBUTION OVER LOGICAL OPERATORS

4 Switching Algebra 4.1 Axioms; Signals and Switching Algebra

Slides for Lecture 10

Predicate Calculus lecture 1

Part I, Number Systems. CS131 Mathematics for Computer Scientists II Note 1 INTEGERS

A Preview Of Calculus & 2.1 Rates of Change

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

Switches: basic element of physical implementations

Math /Foundations of Algebra/Fall 2017 Numbers at the Foundations: Real Numbers In calculus, the derivative of a function f(x) is defined

CS21 Decidability and Tractability

What is Binary? Digital Systems and Information Representation. An Example. Physical Representation. Boolean Algebra

Building a Computer Adder

Rules for Differentiation Finding the Derivative of a Product of Two Functions. What does this equation of f '(

Section Summary. Section 1.5 9/9/2014

Digital Logic Design ENEE x. Lecture 14

Algorithms. Shanks square forms algorithm Williams p+1 Quadratic Sieve Dixon s Random Squares Algorithm

CSE 20 Discrete Math. Algebraic Rules for Propositional Formulas. Summer, July 11 (Day 2) Number Systems/Computer Arithmetic Predicate Logic

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

Limits and Continuity

ADVANCED PROGRAMME MATHEMATICS: PAPER I MODULE 1: CALCULUS AND ALGEBRA

Digital Electronics Final Examination. Part A

Combinational Logic. Jee-Hwan Ryu. School of Mechanical Engineering Korea University of Technology and Education

The Error in an Alternating Series

Why digital? Overview. Number Systems. Binary to Decimal conversion

Review Getting the truth table

Transcription:

Group 4 Project James Earthman, Gregg Greenleaf, Zach Harvey, Zac Leids

2.5 #21 21. Give the output signals S and T for the circuit in the right column if the input signals P, Q, and R are as specified. Note that this is not the circuit for a full-adder. a. P = 1, Q = 1, R = 1 b. P = 0, Q = 1, R = 0 c. P = 1, Q = 0, R = 1

2.5 #21 Solution a. S = 0, T = 1 b. S = 1, T = 0 c. S = 0, T = 0 A Half-Adder takes two binary digits and adds them together. The output for a half-adder is given in two parts, the carry and the sum. The carry is returned true when both of the inputs are true or 1, this is like carrying a digit in decimal addition. The sum is returned true when one of the inputs is true but not both. Both the carry and the sum are returned false if both inputs are false. This circuit also uses an AND gate. An AND gate only returns a true value when both inputs are true, it returns false in any other case.

Gottfried Leibniz Gottfried Leibniz was the mathematician who invented the Binary number system. Leibniz was a German academic that excelled in areas of mathematics and philosophy. He is infamously known for inventing Calculus independant of Isaac Newton. Newton later claimed that Leibniz had stolen his work. Although he was an amazing mathematician, he also wrote on politics and law. Binary number theorem is the foundation for modern computing.

2.5 #22 22. Add 11111111 + 1 and convert the result to decimal notation, to verify that 11111111 = (2 8 1)10.

2.5 #22 Solution 11111111 + 1 = 100000000 100000000 -> Decimal = 256 or 2 8 When adding binary numbers, 1 is carried when both digits are 1 this leaves behind a sum of 0. In this problem, the a 1 is carried all the way to the ninth digit leaving behind 0 s is each column. When converting the binary number to decimal when can assign a binary value to each digit via 2 Digit N, then take the sum of those values and calculate our decimal number. For this problem, we see that there is a 1 in the 8th digit giving us a value of 256, since none of the other digits are true our answer is just 256.

2.5 #47 Part 1: Convert 61502 to decimal notation. Part 2: Convert 20763 to decimal notation.

2.5 #47 Solution Part 1: 61502 = 6 * 8 4 + 1 * 8 3 + 5 * 8 2 + 0 * 8 1 + 2 * 8 0 = 25410 Part 2: 20763 = 2 * 8 4 + 0 * 8 3 + 7 * 8 2 + 6 * 8 1 + 3 * 8 0 = 8691

3.3 #56 Let P(x) and Q(x) be predicates and suppose D is the domain of x. In 55 58, for the statement forms in each pair, determine whether (a) they have the same truth value for every choice of P(x), Q(x), and D, or (b) there is a choice of P(x), Q(x), and D for which they have opposite truth values. x D, (P(x) Q(x)) and ( x D, (P(x)) ( x D, Q(x))

3.3 #56 Solution a) No matter what the domain D or the predicates P(x) and Q(x) are, the given statements have the same truth value. If the statement x D, (P(x) Q (x)) is true, then P(x) Q(x) is true for the x chosen in D, which implies that both P(x) and Q(x) are true for the x chosen in D. But then P(x) is true for the x chosen in D, and also Q(x) is true for the x chosen in D. So the statement ( x D, (P(x)) ( x D, Q(x)) is true. Conversely, if the statement ( x D, (P(x)) ( x D, Q(x)) is true, then P(x) is true for the x chosen in D, and also Q(x) is true for the x chosen in D. This implies that both P(x) and Q(x) are true for the x chosen in D, and so P(x) Q(x) is true for the x chosen in D. Hence the statement x D, (P(x) Q(x)) is true.

3.3 #58 Let P(x) and Q(x) be predicates and suppose D is the domain of x. In 55 58, for the statement forms in each pair, determine whether (a) they have the same truth value for every choice of P(x), Q(x), and D, or (b) there is a choice of P(x), Q(x), and D for which they have opposite truth values. x D, (P(x) Q(x)), and ( x D, P(x)) ( x D, Q(x))

3.3 #58 Solution a) If the statement x D, (P(x) Q(x)) is true, then P(x) Q(x) is true for the x chosen in D, since only P(x) or Q(x) has to be true for the chosen x in D. So the statement ( x D, (P(x)) ( x D, Q(x)) must be true. Conversely, if the statement ( x D, (P(x)) ( x D, Q(x)) is true, then P(x) is true for the x chosen in D, or Q(x) is true for the x chosen in D. This implies that P(x) or Q(x) are true for the x chosen in D, and so P(x) Q(x) is true for the x chosen in D. Hence the statement x D, (P(x) Q(x)) is true.

References http://en.wikipedia.org/wiki/list_of_mathematical_symbols http://academic.evergreen.edu/projects/biophysics/technotes/misc/bin_math. htm http://www.wikihow.com/convert-from-binary-to-decimal http://simple.wikipedia.org/wiki/gottfried_leibniz