Math Final Exam December 14, 2009 Page 1 of 5

Similar documents
2.2: Logical Equivalence: The Laws of Logic

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

CSC Discrete Math I, Spring Propositional Logic

DISCRETE MATH: FINAL REVIEW

Logic and Truth Tables

Lecture 2. Logic Compound Statements Conditional Statements Valid & Invalid Arguments Digital Logic Circuits. Reading (Epp s textbook)

Logic, Sets, and Proofs

Algebra 1. Standard 1: Operations With Real Numbers Students simplify and compare expressions. They use rational exponents and simplify square roots.

2. The Logic of Compound Statements Summary. Aaron Tan August 2017

Logic and Truth Tables

Practice Midterm Exam Solutions

Boolean Algebra & Logic Gates. By : Ali Mustafa

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

DEPARTMENT OF MATHEMATICS. MA1301 Discrete Mathematics

More Propositional Logic Algebra: Expressive Completeness and Completeness of Equivalences. Computability and Logic

Equivalence and Implication

Compound Propositions

1) Let h = John is healthy, w = John is wealthy and s = John is wise Write the following statement is symbolic form

ECE 238L Boolean Algebra - Part I

AN INTRODUCTION TO MATHEMATICAL PROOFS NOTES FOR MATH Jimmy T. Arnold

Discrete Mathematics Exam File Spring Exam #1

ELEC Digital Logic Circuits Fall 2014 Boolean Algebra (Chapter 2)

Announcements. CS311H: Discrete Mathematics. Propositional Logic II. Inverse of an Implication. Converse of a Implication

UNIVERSITY OF VICTORIA DECEMBER EXAMINATIONS MATH 122: Logic and Foundations

Part I: Propositional Calculus

Mat 243 Exam 1 Review

Packet #1: Logic & Proofs. Applied Discrete Mathematics

Section 1.2 Propositional Equivalences. A tautology is a proposition which is always true. A contradiction is a proposition which is always false.

Problem 1: Suppose A, B, C and D are finite sets such that A B = C D and C = D. Prove or disprove: A = B.

We last time we began introducing equivalency laws.

Math 10850, fall 2017, University of Notre Dame

What is Logic? Introduction to Logic. Simple Statements. Which one is statement?

With Question/Answer Animations. Chapter 2

Truth-Functional Logic

Chapter 4, Logic using Propositional Calculus Handout

COT 2104 Homework Assignment 1 (Answers)

6-4 Solving Special Systems

Exercise Set 1 Solutions Math 2020 Due: January 30, Find the truth tables of each of the following compound statements.

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence

Chapter 2. Boolean Algebra and Logic Gates

Introduction to Logic

PSU MATH RELAYS LOGIC & SET THEORY 2017

Sets. Alice E. Fischer. CSCI 1166 Discrete Mathematics for Computing Spring, Outline Sets An Algebra on Sets Summary

Foundations of Mathematics MATH 220 FALL 2017 Lecture Notes

The following techniques for methods of proofs are discussed in our text: - Vacuous proof - Trivial proof

KP/Worksheets: Propositional Logic, Boolean Algebra and Computer Hardware Page 1 of 8

Midterm Exam Solution

Section 2.2 Set Operations. Propositional calculus and set theory are both instances of an algebraic system called a. Boolean Algebra.

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Review CHAPTER. 2.1 Definitions in Chapter Sample Exam Questions. 2.1 Set; Element; Member; Universal Set Partition. 2.

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.

CS100: DISCRETE STRUCTURES. Lecture 5: Logic (Ch1)

Test Bank Questions. (a) Is there an integer n such that n has? (b) Does there exist such that if n is divided by 4 the remainder is 1 and if?

APPENDIX: MATHEMATICAL INDUCTION AND OTHER FORMS OF PROOF

Anna University, Chennai, November/December 2012

1. Prove: A full m- ary tree with i internal vertices contains n = mi + 1 vertices.

Example. Logic. Logical Statements. Outline of logic topics. Logical Connectives. Logical Connectives

McGill University Faculty of Science. Solutions to Practice Final Examination Math 240 Discrete Structures 1. Time: 3 hours Marked out of 60

Proposition/Statement. Boolean Logic. Boolean variables. Logical operators: And. Logical operators: Not 9/3/13. Introduction to Logical Operators

Tutorial Obtain the principal disjunctive normal form and principal conjunction form of the statement

Sample Problems for all sections of CMSC250, Midterm 1 Fall 2014

The Logic of Compound Statements cont.

1. a. Give the converse and the contrapositive of the implication If it is raining then I get wet.

Sets are one of the basic building blocks for the types of objects considered in discrete mathematics.

Logic and Proofs. (A brief summary)

Introduction to Decision Sciences Lecture 2

Show Your Work! Point values are in square brackets. There are 35 points possible. Some facts about sets are on the last page.

Propositional Resolution Introduction

Announcements. CS243: Discrete Structures. Propositional Logic II. Review. Operator Precedence. Operator Precedence, cont. Operator Precedence Example

1. From Lewis Carroll: extract a pair of premises and finish the conclusion.

A. Propositional Logic

Supplementary exercises in propositional logic

Section 1.1 System of Linear Equations. Dr. Abdulla Eid. College of Science. MATHS 211: Linear Algebra

MTH 299 In Class and Recitation Problems SUMMER 2016

CHAPTER 6. Copyright Cengage Learning. All rights reserved.

1.1 Statements and Compound Statements

INTRODUCTION TO LOGIC

Proving Things. Why prove things? Proof by Substitution, within Logic. Rules of Inference: applying Logic. Using Assumptions.

Logic Overview, I. and T T T T F F F T F F F F

Boolean Algebra and Proof. Notes. Proving Propositions. Propositional Equivalences. Notes. Notes. Notes. Notes. March 5, 2012

Propositional Logic: Equivalence

Algebra 1 Seamless Curriculum Guide

Propositional Logic Basics Propositional Equivalences Normal forms Boolean functions and digital circuits. Propositional Logic.

Undergraduate Notes in Mathematics. Arkansas Tech University Department of Mathematics. Introductory Notes in Discrete Mathematics Solution Guide

CISC-102 Fall 2018 Week 11

2. Find all combinations of truth values for p, q and r for which the statement p (q (p r)) is true.

Boolean Logic. CS 231 Dianna Xu

Lecture Notes on DISCRETE MATHEMATICS. Eusebius Doedel

Math Exam Jam Concise. Contents. 1 Algebra Review 2. 2 Functions and Graphs 2. 3 Exponents and Radicals 3. 4 Quadratic Functions and Equations 4

PS10.3 Logical implications

Tautologies, Contradictions, and Contingencies

Math 313 (Linear Algebra) Exam 2 - Practice Exam

Foundations Revision Notes

CISC-102 Winter 2016 Lecture 17

This form sometimes used in logic circuit, example:

Solutions to Exam I MATH 304, section 6

1.1 Language and Logic

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Simplification by Truth Table and without Truth Table

Classify, graph, and compare real numbers. Find and estimate square roots Identify and apply properties of real numbers.

Transcription:

Math 201-803-Final Exam December 14, 2009 Page 1 of 5 (3) 1. Evaluate the expressions: (a) 10 C 4 (b) 10 P 4 (c) 15!4! 3!11! (4) 2. (a) In how many ways can a president, a vice president and a treasurer be selected for a club with 7 members? (b) Six students are going to be chosen at random from a class of 20 students to take a trip to Ottawa. In how many ways can this be done? (3) 3. Let A = {1, 3, 5}, B = {2, 4, 6} and U = {x N : 1 x 10}. a) Are A and B equivalent? Explain. b) Find A. c) Find A B and A B (2) 4. Draw a Venn diagram and show by hatching the following set: (B C) (A C) (5) 5. For each expression, name the property from the given list and say whether it is a set property, a network property, or a logic property: associative, closure, commutative, complement, contradiction, DeMorgan, distributive, double complement, double negation, idempotent, identity, property of 1 (or 0), tautology. a) (p p) p b) A A = c) A B = A + B d) ( p) p e) A + B C = (A + B) (A + C) (1) 6. What is a contradiction? (4) 7. Use a truth table to determine whether or not (NAND) distribute over (EOR). That is, whether or not p (q r) is equivalent to (p q) (p r). (6) 8. Use a truth table to determine whether the argument is valid or not. H: If there are two books on the table, then one of them belongs to Jane. If one of the books belongs to Jane, then Jane is happy. Jane is not happy. C: There are not two books on the table. (3) 9. Use a Venn diagram to determine the validity of the argument. H: All Pandas are black and white. Some black and white animals are endangered. C: Some Pandas are endangered. (4) 10. If you have a flu, then you must stay home for seven days. a) Write the converse, the contrapositive, and the inverse of the implication above. b) Say which among the four statements are equivalent.

Math 201-803-Final Exam December 14, 2009 Page 2 of 5 (4) 11. Find a Boolean table for the expression: a) A B + A B b) Write a logical statement which is analogous to this expression. (2) 12. Draw a network to represent the given boolean expression: F(A + CD) + (EFG) (5) 13. Simplify each expression, justifying each step using properties of Boolean algebra. a) A + AB + B b) AB + BC + B(C + B) (6) 14. Classify each system below (without solving) as dependent or independent, consistent with one solution only, consistent with infinitely many solutions or inconsistent. Justify your answers. a) b) c) 3x 2y = 3 2x 3y = 3 5x 2y = 3 2y 5x = 3 3x y = 6 6x + 2y = 3 (5) 15. Given the system { 2x 3y = 7 x + 3y = 2 a) Estimate the solution by graphing. b) Solve the system algebraically by substitution or elimination. c) Compare results from a) and b) (Write a comment). (12) 16. Given: A = D = 0 2 1 3 5 1 1 1 3 6 2 10 3 0 5 B = I = 0 1 4 3 1 2 C = 1 3 2 0 1 7 find each of the following, if possible. If an operation is not possible, say why. a) 3B 5I b) C 1 c) B 4 d) C + I e) AI f) A T D g) CD (10) 17. Find the inverse of each matrix or explain why it does not exist. 1 2 4 a) A = b) B = 2 5 6 c) C = 3 3 3 9 8 (4) 18. Given the linear system x y 3z = 0 x + 2y + 4z = 1 x + y = 3 a) write the system in matrix form AX = B. 4 3 2 b) If A 1 = 4 3 1, solve the system using A 1. 3 2 1 2 3 4 2 5 3 0 8 7,

Math 201-803-Final Exam December 14, 2009 Page 3 of 5 (4) 19. Given a linear system AX = B. a) If the reduced form of augmented matrix is b) If the augmented matrix has a form 3 1 0 1 2 5 0 0 0 0 5 5 0 1 2 3 0 0 what is the solution, if any? what is the solution, if any? (6) 20. If possible solve the following system using matrices and row operations. 3x + 8y 4z = 6 x + 3y 2z = 2 x + 4y 7z = 7 (4) 21. If possible, solve the following system using matrices and row operations. 2x y + 5z = 5 3x + 2y z = 3 4x 2y + 10z = 9 (3) 22. Prove by mathematical induction that for all positive integers n ANSWERS: 2 + 4 + 8 + + 2 n = 2(2 n 1) Note: 2 m+n = 2 m 2 n 1. a) 210 b) 5040 c) 131040 2. a)7 P 3 = 210 b) 20 C 6 = 38760 3. a) Yes, A and B have the same number of elements. b) A = {2, 4, 6, 7, 8, 9, 10} c)a B = Ø and A B = {1, 2, 3, 4, 5, 6} 4. Solution is anything shaded or hatched U A B C

Math 201-803-Final Exam December 14, 2009 Page 4 of 5 5. a) idempotent, logic b) complement, sets c) DeMorgan, network d) double negation, logic e) distributive, network 6. Logical statement which is false in every case. 7. Not equivalent 8. Valid argument 9. Invalid argument 10. a) Converse: If you must stay home for seven days, then you have a flu. Contrapositive: If you don t have to stay home for seven days, then you don t have a flu. Inverse: If you don t have a flu, then you don t have to stay home for seven days. b) The original statement is equivalent to contrapositive. The converse statement is equivalent to inverse. 11. a) It is 0 when A B, (A = 1, B = 0 or A = 0, B = 1) and 1 when A = B(A = 1, B = 1 or A = 0, B = 0). b) p q (or equivalent statement (p q) ( p q)) 12. A F C D E F G 13. a) 1 b) B 14. a) different slopes, independent and consistent, one solution b) same line, dependent and consistent, infinitely many solutions c) same slope and different intercepts means parallel lines, independent and inconsistent system, no solution. 15. a)the graph suggests that x 5 and y 1, which turns out to be the exact answer by b). y (2,0) (5,1) (0, 2 3 ) (7 2,0) x (0, 7 3 ) 7 9 469 468 16. a) b) no inverse, C is not square matrix c) 3 1 156 157 0 2 d) undefined e) 1 3 21 2 15 25 7 17 f) g) 17 8 29 15 2 45 5 1

Math 201-803-Final Exam December 14, 2009 Page 5 of 5 17. a) 18. a) 1 1 3 1 1 3 1 2 4 1 b) 7 10 4 1 2 1 3 3 1 2 2 2 x y z = 0 1 3 c) No inverse, C can not be reduced to I. b) X = A 1 B = 9 6 5 19. a) x = 1 3t y = 5 + 2t z = t b) x = 5 y = 3 z = 0 20. x = 6 y = 2 z = 1 21. System inconsistent (no solution). 22.