Slot machines A healthy way to learn about connectives!

Slides:

Advertisements

Similar presentations

The Important Thing About By. The Important Thing About ******** The important thing about ***** is *****. It is true s/he can *****, *****, and *****.

Advertisements

-.Internet Safety Game.- Adams Middle School 2010.

Computer Science and Software Engineering University of Wisconsin - Platteville Note 5. Testing Yan Shi Lecture Notes for SE 3730 / CS 5730.

Software Testing Logic Coverage. Introduction to Software Testing (Ch 3) © Ammann & Offutt 2 Logic Coverage Four Structures for Modeling Software Graphs.

Tutorial 1: Logic Peter Poon. Self Introduction You can call me Peter Office: SHB117 Office hour:

Introduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt

Logic ChAPTER 3 1. Truth Tables and Validity of Arguments

Using your brain… Click on the heart to start the game!

Snick  snack CPSC 121: Models of Computation 2009 Winter Term 1 Propositional Logic: Conditionals and Logical Equivalence Steve Wolfman, based on notes.

Introduction to Software Testing Chapter 3.1 Logic Coverage Paul Ammann & Jeff Offutt.

Introduction to Software Testing Chapter 8.2

Propositional Logic Lecture 1: Sep 2. Content 1.Mathematical proof (what and why) 2.Logic, basic operators 3.Using simple operators to construct any operator.

CSE115/ENGR160 Discrete Mathematics 01/20/11 Ming-Hsuan Yang UC Merced 1.

“A friend in need is a friend indeed ”. Agree or disagree A friend is a person who keeps secrets A true friend is someone who ignores your problems Friendship.

HOW MANY SHAPES do you see?

3.2 – Truth Tables and Equivalent Statements

TRUTH TABLES. Introduction Statements have truth values They are either true or false but not both Statements may be simple or compound Compound statements.

Gambling Quiz. Gambling Quiz At what age are young people allowed to buy a national lottery ticket?

Chapter 1 The Logic of Compound Statements. Section 1.1 Logical Form and Logical Equivalence.

Today’s Agenda  Quick Review  Finish Graph-Based Testing  Predicate Testing Software Testing and Maintenance 1.

Probabilistic graphical models. Graphical models are a marriage between probability theory and graph theory (Michael Jordan, 1998) A compact representation.

Conditional Statements CS 2312, Discrete Structures II Poorvi L. Vora, GW.

Introduction to Software Testing Chapter 8.1 Logic Coverage Paul Ammann & Jeff Offutt

Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.

States of Matter Edition Name that State $100 $100 $300 $200 $400 $500 $100 $300 $200 $400 $500 $100 $300 $200 $400 $500 $100 $300 $200 $400 $500 $100.

CSNB143 – Discrete Structure LOGIC. Learning Outcomes Student should be able to know what is it means by statement. Students should be able to identify.

Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt

Shapes and Angle Rules 80 + ? = = 180.

Boolean Logic. Boolean Operators (T/F) xyx AND y FFF FTF TFF TTT xyx OR y FFF FTT TFT TTT xNOT x FT TF.

Introduction to Software Testing Chapter 3.1, 3.2 Logic Coverage Paul Ammann & Jeff Offutt

Chapter 7 Logic, Sets, and Counting

PHIL 120: Third meeting I. I. What to know for Test 1 (in general terms). II. II. Symbolizing compound sentences (cont’d) a. a. Paying attention to English.

Warmup Answer the following True/False questions in your head: I have brown hair AND I am wearing glasses I am male OR I am wearing sneakers I am NOT male.

Chapter 7 Logic, Sets, and Counting Section 1 Logic.

© 2010 Pearson Prentice Hall. All rights reserved. 1 §3.4, Truth Tables for the Conditional and the Biconditional.

Logical Form and Logical Equivalence Lecture 1 Section 1.1 Wed, Jan 12, 2005.

CS520: Steinberg 1 Lecture 16 CS 520: Introduction to Artificial Intelligence Prof. Louis Steinberg Lecture 16: Uncertainty.

Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt

Conditional Statements

Introduction to Software Testing Chapter 3.6 Disjunctive Normal Form Criteria Paul Ammann & Jeff Offutt

Introduction to Software Testing Chapter 3.1 Logic Coverage Paul Ammann & Jeff Offutt.

Naming Shapes Identifying Shapes Describing Shapes 5¢5¢5¢5¢ 5¢5¢5¢5¢ 5¢5¢5¢5¢ 10¢ 10¢ 10¢ 10¢ 10¢ 10¢ 25¢ 25¢ 25¢ 25¢ 25¢ 25¢ 50¢ 50¢ 50¢ 50¢ 50¢ 50¢

A: A: double “4” A: “34” 4.

This is Not a Book About …. Author: Illustrator: Class: Date:

MATH 110 Sec 12-1 Lecture: Intro to Counting Introduction to Counting: Just how many are there?

Sum of Arithmetic Sequences. Definitions Sequence Series.

Solving Equations Using Logs. True or False? 1.Log 4 = log Log 15 = log 3 x log 5 3.Log 4 = log 8 – log 2 4.Log 64 = 2 log 8 5.Log 64 = 8 log 2.

Introduction to Discrete Mathematics Lecture 1: Sep 6 AB C a = qb+r gcd(a,b) = gcd(b,r)

Introduction to Software Testing Chapter 8.2

Special Triangles Review

Standard and Expanded Form

Rule Exercises Status of the Ball Definitions and Rule 15

Rule Exercises Status of the Ball Definitions and Rule 15

Factors, multiple, primes: Factors from prime factors

Review Operation Bingo

Gambling Quiz Gambling Quiz.

Factors, multiple, primes: Prime factors

Here are four triangles. What do all of these triangles have in common

Word Word Word Word Word Picture Definition Historical Significance

Straight line graphs: Horizontal and vertical lines

Factors, multiple, primes: Multiples

Fractions: Simplifies to a unit fraction?

Straight line graphs: Horizontal and vertical lines

  Homework 6 (June 20) Material covered: Slides

Standard Form: Multiplying powers of 10

Standard form: In standard form?

Coordinates: Naming 2D coordinates – quadrant 1

LOGICAL EQUIVALENCES - DISCRETE MATHEMATICS.

Presentation transcript:

Slot machines A healthy way to learn about connectives!

Definitions C = You got all the same color S = You got all the same shape C ∨ S = You got all the same color OR shape W = You win Rule of the game: W if and only if C ∨ S

C = False; S = False; C ∨ S = False

C = False; S = True; C ∨ S = True

W = True!!!

C = False; S = False; C ∨ S = False

Sorry! W = False.

C = True; S = True; C ∨ S = True

W = True!!!

C = True; S = False; C ∨ S = True

W = True!!!

CS C ∨ S W TTTT TFTT FTTT FFFF

New Rules! C ∧ S = You got all the same color AND shape Rule of the game: W if and only if C ∧ S

CS C ∧ S W TTTT TFFF FTFF FFFF