MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

Similar documents
PSU MATH RELAYS LOGIC & SET THEORY 2017

Full download all chapters instantly please go to Solutions Manual, Test Bank site: testbanklive.com

Unit 1 Logic Unit Math 114

Unit 1 Logic Unit Math 114

Chapter 1 Logic Unit Math 114

Unit 6 Logic Math 116

MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.

ANALYSIS EXERCISE 1 SOLUTIONS

Chapter 1: The Logic of Compound Statements. January 7, 2008

Chapter 2. Reasoning and Proof

PS10.3 Logical implications

Part 2 Module 2 The Conditional Statement. A conditional statement is a statement of the form "If p, then q,"

CCHS Math Unit Exam (Ch 1,2,3) Name: Math for Luiberal Arts (200 Points) 9/23/2014

Logic Review Solutions

Quantifiers. P. Danziger

Propositional Logic Not Enough

1) A) 1 B) 2 C) 3 D) 2 3

Total score: /100 points

Computer Science 280 Spring 2002 Homework 2 Solutions by Omar Nayeem

Solving and Graphing Inequalities Joined by And or Or

2.1 Start Thinking. 2.1 Warm Up. 2.1 Cumulative Review Warm Up

~ p is always false. Based on the basic truth table for disjunction, if q is true then p ~

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

LOGIC CONNECTIVES. Students who have an ACT score of at least 30 OR a GPA of at least 3.5 can receive a college scholarship.

LAMC Intermediate I & II November 2, Oleg Gleizer. Warm-up

Maryam Al-Towailb (KSU) Discrete Mathematics and Its Applications Math. Rules Math. of1101 Inference 1 / 13

1) The set of the days of the week A) {Saturday, Sunday} B) {Sunday, Monday, Tuesday, Wednesday, Thursday, Friday, Sunday}

Fill in the blank with either or to make the statement true. A) B)

1.5 MATHEMATICAL LANGUAGE

Section 2 Equations and Inequalities

Logic of Sentences (Propositional Logic) is interested only in true or false statements; does not go inside.

Section 3.1 Statements, Negations, and Quantified Statements

Mathematical Logic Part One

Mathematical Logic Part One

(p == train arrives late) (q == there are taxis) (r == If p and not q, then r. Not r. p. Therefore, q. Propositional Logic

Practice assignment 2

2 Conditional and Biconditional Propositions

WUCT121. Discrete Mathematics. Logic. Tutorial Exercises

Mat 243 Exam 1 Review

Predicates, Quantifiers and Nested Quantifiers

CHAPTER 1 - LOGIC OF COMPOUND STATEMENTS

Section 1.3. Let I be a set. When I is used in the following context,

10 LOGIC Introduction. Objectives

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

DISCRETE MATHEMATICS BA202

LOGIC. Name: Teacher: Pd: Page 1

CS2336 Discrete Mathematics

Math.3336: Discrete Mathematics. Propositional Equivalences

PHI Propositional Logic Lecture 2. Truth Tables

Logic and Truth Tables

MATH 215 Discrete Mathematics Worksheets. Which of these are propositions? What are the truth values of those that are propositions?

Section 2-1. Chapter 2. Make Conjectures. Example 1. Reasoning and Proof. Inductive Reasoning and Conjecture

Chapter 3: Logic. Diana Pell. A statement is a declarative sentence that is either true or false, but not both.

Name Period Date DRAFT

Proof. Theorems. Theorems. Example. Example. Example. Part 4. The Big Bang Theory

Math Assignment 2 Solutions - Spring Jaimos F Skriletz Provide definitions for the following:

Mathematical Logic Part One

Math 1312 Lesson 1: Sets, Statements, and Reasoning. A set is any collection of objects. These objects are called the elements of the set.

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

FUNDAMENTALS OF MATHEMATICS HANDOUT 1.3 DR. MCLOUGHLIN

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?

Sets and Logic Linear Algebra, Spring 2012

PART 2 MODULE 1 LOGIC: STATEMENTS, NEGATIONS, QUANTIFIERS, TRUTH TABLES

Read ahead and use your textbook to fill in the blanks. We will work the examples together.

Full file at Chapter 1

Proposi'onal Logic Not Enough

Discrete Structures for Computer Science

4 Quantifiers and Quantified Arguments 4.1 Quantifiers

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

Logic and Propositional Calculus

Math 3336: Discrete Mathematics Practice Problems for Exam I

Algebra Terminology Part 1

ARTIFICIAL INTELLIGENCE

Mathematical Logic Part One

GENERAL MATHEMATICS 11

Logical Operators. Conjunction Disjunction Negation Exclusive Or Implication Biconditional

Implications, Quantifiers, and Venn Diagrams. Implications Logical Quantifiers Venn Diagrams. Different Ways of Stating Implications

Chapter 2: The Logic of Quantified Statements

THE LOGIC OF COMPOUND STATEMENTS

Statements and Quantifiers

Sec 3.3 The Conditional & Circuits

Introduction Propositional Logic. Discrete Mathematics Andrei Bulatov

Section 2.1: Introduction to the Logic of Quantified Statements

ACCUPLACER Sample Questions for Students

1.6. Solving Linear Inequalities. What you should learn. Why you should learn it To model real-life situations, such as amusement park fees in Ex. 50.

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

Examples. Example (1) Example (2) Let x, y be two variables, and denote statements p : x = 0 and q : y = 1. Solve. x 2 + (y 1) 2 = 0.

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

The PROMYS Math Circle Problem of the Week #3 February 3, 2017

Conditional Statements

DEDUCTIVE REASONING Propositional Logic

2/2/2018. CS 103 Discrete Structures. Chapter 1. Propositional Logic. Chapter 1.1. Propositional Logic

UNIT 5 INEQUALITIES CCM6+/7+ Name: Math Teacher:

Solutions to Exercises (Sections )

Only one of the statements in part(a) is true. Which one is it?

University of Illinois at Chicago Department of Computer Science. Final Examination. CS 151 Mathematical Foundations of Computer Science Fall 2012

GENERAL MATHEMATICS 11

CS103 Handout 09 Fall 2012 October 19, 2012 Problem Set 4

Proposition logic and argument. CISC2100, Spring 2017 X.Zhang

Where are my glasses?

Transcription:

MTH 164 Practice Exam 2 Spring 2008 Dr. Garcia-Puente Name Section MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Decide whether or not the following is a statement. 1) Not all flowers are roses. A) Statement B) Not a statement 1) 2) My favorite baseball team will win the pennant. A) Not a statement B) Statement 2) Decide whether the statement is compound. 3) If it rains, we won't play soccer. A) Not compound B) Compound 3) 4) The sign read "Not for sale". A) Compound B) Not compound 4) Write a negation for the statement. 5) No fifth graders play soccer. A) No fifth grader does not play soccer. B) At least one fifth grader plays soccer. C) All fifth graders play soccer. D) Not all fifth graders play soccer. 5) 6) Some people don't like walking. A) Some people like walking. B) Some people don't like driving. C) Nobody likes walking. D) Everyone likes walking. 6) Write a negation of the inequality. Do not use a slash symbol. 7) x -54 A) x 54 B) x -54 C) x < 54 D) x < -54 7) 1

Convert the symbolic compound statement into words. 8) p represents the statement "Her name is Lisa." q represents the statement "She lives in Chicago." Translate the following compound statement into words: p q 8) A) If her name is Lisa, she lives in Chicago. B) Her name is Lisa and she lives in Chicago. C) Her name is Lisa and she doesn't live in Chicago. D) Her name is Lisa or she lives in Chicago. 9) p represents the statement : "Students are happy." q represents the statement: "Teachers are happy." Translate the following compound statement into words: ~(p ~q) 9) A) Students are not happy or teachers are not happy. B) It is not the case that students are happy or teachers are not happy. C) Students are not happy and teachers are not happy. D) It is not the case that students are happy and teachers are not happy. Let p represent the statement, "Jim plays football", and let q represent the statement "Michael plays basketball". Convert the compound statement into symbols. 10) Jim does not play football or Michael plays basketball. 10) A) p q B) ~(p q) C) p q D) ~p q 11) Jim does not play football or Michael does not play basketball. A) ~(p q) B) p q C) ~p ~q D) ~p ~q 11) Decide whether the statement is true or false. 12) All whole numbers are real numbers. 12) 13) There exists a rational number that is an integer. 13) 2

Let p represent a true statement and let q represent a false statement. Find the truth value of the given compound statement. 14) ~p q 14) 15) [(~p ~q) ~q] 15) Let p represent a true statement, while q and r represent false statements. Find the truth value of the compound statement. 16) (p ~q) r 16) 17) ~[(~p q) r] 17) Let p represent 7 < 8, q represent 2 < 5 < 6, and r represent 3 < 2. Decide whether the statement is true or false. 18) ~p q 18) 19) ~(~p ~q) (~r ~q) 19) Construct a truth table for the statement. 20) ~r ~s A) r s (~r ~s) F F F C) r s (~r ~s) B) r s (~r ~s) D) r s (~r ~s) 20) 3

21) ~((w s) t) A) w s t ~((w s) t) T T T T F T F F B) w s t ~((w s) t) T T T F T F T F F F F 21) Use De Morgan's laws to write the negation of the statement. 22) 8 + 4 = 12 and 10-2 8 A) 8 + 4 12 and 10-2 = 8 B) 8 + 4 12 or 10-2 = 8 C) 8 + 4 = 12 and 10-2 = 8 D) 8 + 4 = 12 or 10-2 8 22) 23) Cats are lazy or dogs aren't friendly. A) Cats are lazy and dogs are friendly. B) Cats aren't lazy or dogs aren't friendly. C) Cats aren't lazy and dogs are friendly. D) Cats aren't lazy or dogs are friendly. 23) TRUE/FALSE. Write 'T' if the statement is true and 'F' if the statement is false. Decide whether the statement is true or false. 24) For every real number x, x < 5 and x > 4. 24) 25) For no real number y, y < 17 and y > 19. 25) MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Rewrite the statement using the if...then connective. Rearrange the wording or words as necessary. 26) I'll leave when he arrives. A) I'll leave when he arrives. B) If I leave, then he will leave. C) If he arrives, then I'll leave. D) If I will leave, then he'll arrive. 26) 4

Write the compound statement in words. Let r = "The puppy is trained." p = "The puppy behaves well." q = "His owners are happy." 27) (r p) q A) If the puppy is trained and the puppy behaves well, then his owners are happy. B) The puppy is trained and the puppy behaves well if his owners are happy. C) If the puppy is trained, then the puppy behaves well and his owners are happy. D) If the puppy is trained or the puppy behaves well, then his owners are happy. 27) Write the compound statement in symbols. Let r = "The food is good." p = "I eat too much." q = "I'll exercise." 28) If the food is good and I eat too much, then I'll exercise. A) (r p) q B) p (r q) C) r (p q) D) r (p q) 28) 29) I'll exercise if I don't eat too much. A) ~p q B) ~p q C) ~p q D) ~(p q) 29) Given p is true, q is true, and r is false, find the truth value of the statement. 30) ~q (p r) 30) 31) (~p ~q) (p ~r) 31) Construct a truth table for the statement. 32) (p q) (~p q) A) p q (p q) (~p q) F F F C) p q (p q) (~p q) B) p q (p q) (~p q) F F F D) p q (p q) (~p q) 32) 5

33) ~(p q) ~(p q) A) p q ~(p q) ~(p q) C) p q ~(p q) ~(p q) B) p q ~(p q) ~(p q) D) p q ~(p q) ~(p q) 33) Write the negation of the conditional. Use the fact that the negation of p q is p ~q. 34) If you can't take the heat, stay out of the kitchen. A) You can take the heat and stay out of the kitchen. B) You can take the heat and do not stay of of the kitchen. C) You can't take the heat and do not stay out of the kitchen. D) You can take the heat but stay out of the kitchen. 34) Write an equivalent statement that does not use the if... then connective. Use the fact that p q is equivalent to ~p v q. 35) If you can't win the tournament, then you don't bother playing. 35) A) You can't win the tournament and you do bother playing. B) You can't win the tournament so you don't bother playing. C) You can win the tournament or you do bother playing. D) You can win the tournament or you don't bother playing. True or false? 36) When using a truth table, the statement q p is equivalent to p q. 36) SHORT ANSWER. Write the word or phrase that best completes each statement or answers the question. Write a logical statement representing the following circuit. Simplify when possible. 37) 37) 6

38) 38) Draw a circuit representing the following statement as it is given. Simplify if possible. 39) [(p ~r) q] (q ~r) 39) 40) ~p [(q r) ~p] 40) MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Use an Euler diagram to determine whether the argument is valid or invalid. 41) Not all that glitters is gold. My ring glitters. My ring is not gold. 41) 42) All cats like fish. Henry does not like fish. Henry is not a cat. 42) The argument has a true conclusion. Identify the argument as valid or invalid. 43) 14 is less than 14. 7 is less than 14. 14 is less than 7. 43) 7

44) All dogs have fur. All cats have fur. A cat is not a dog. 44) Use a truth table to determine whether the argument is valid. 45) p q q p 45) 46) ~q ~p p ~q 46) ~q Determine whether the argument is valid or invalid. 47) If I were your friend and you were my soul mate, then I'd never stop liking you. I've stopped liking you. Therefore, I am not your friend or you were not my soul mate. 47) 48) If you are infected with the measles, then it can be transmitted. The results are grave and it cannot be transmitted. Therefore, if the results are not grave, then you are infected with the measles 48) Use the method of writing each premise in symbols in order to write a conclusion that yields a valid argument. 49) Smiling people are happy. Alert people are not happy. Careful drivers are alert. Careless drivers 49) have accidents. A) People who smile have accidents. B) Careful drivers have accidents. C) Careful drivers are happy. D) People who smile are alert. 50) Hard workers sweat. Sweat brings on a chill. Anyone who doesn't have a cold never felt a chill. Anyone who works doesn't have a cold. A) Hard workers don't go to work. B) Anyone who sweats works hard. C) Hard workers don't get colds. D) Anyone who has a cold works hard. 50) 8