Discrete Structures Class Meeting 1. Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems.

Slides:



Advertisements
Similar presentations
Af2 Introduction. What’s the course about? Discrete Mathematics The mathematics that underpins computer science and other sciences as well.
Advertisements

CSE 311 Foundations of Computing I Spring 2013 Lecture 1 Propositional Logic.
CSE 311 Foundations of Computing I Autumn 2011 Lecture 1 Propositional Logic.
Syllabus Every Week: 2 Hourly Exams +Final - as noted on Syllabus
Discrete Mathematics Math 6A Instructor: M. Welling.
Mathematical Induction Assume that we are given an infinite supply of stamps of two different denominations, 3 cents and and 5 cents. Prove using mathematical.
Adapted from Discrete Math
IB Math Studies – Topic 3. IB Course Guide Description.
Discrete Mathematics Goals of a Discrete Mathematics Learn how to think mathematically 1. Mathematical Reasoning Foundation for discussions of methods.
Aim: How do we solve truth tables?
Propositions and Truth Tables
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Section 1.5 Implications. Implication Statements If Cara has a piano lesson, then it is Friday. If it is raining, then I need to remember my umbrella.
Copyright © 2014, 2010, 2007 Pearson Education, Inc. Section 3.3, Slide Logic The Study of What’s True or False or Somewhere in Between.
Discrete Maths 2. Propositional Logic Objective
CSE 311 Foundations of Computing I Autumn 2012 Lecture 1 Propositional Logic 1.
CSCI 115 Chapter 2 Logic. CSCI 115 §2.1 Propositions and Logical Operations.
MATH 213 A – Discrete Mathematics for Computer Science Dr. (Mr.) Bancroft.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
© by Kenneth H. Rosen, Discrete Mathematics & its Applications, Sixth Edition, Mc Graw-Hill, 2007 Ch.1 (Part 1): The Foundations: Logic and Proofs Introduction.
Mathematical Structures A collection of objects with operations defined on them and the accompanying properties form a mathematical structure or system.
BY: MISS FARAH ADIBAH ADNAN IMK. CHAPTER OUTLINE: PART III 1.3 ELEMENTARY LOGIC INTRODUCTION PROPOSITION COMPOUND STATEMENTS LOGICAL.
(CSC 102) Lecture 3 Discrete Structures. Previous Lecture Summary Logical Equivalences. De Morgan’s laws. Tautologies and Contradictions. Laws of Logic.
Fall 2002CMSC Discrete Structures1 Let’s get started with... Logic !
Logical Form and Logical Equivalence Lecture 2 Section 1.1 Fri, Jan 19, 2007.
COS 150 Discrete Structures Assoc. Prof. Svetla Boytcheva Fall semester 2014.
Lesson 2-3 Conditional Statements. 5-Minute Check on Lesson 2-2 Transparency 2-3 Use the following statements to write a compound statement for each conjunction.
Discrete Structures – CS Text Discrete Mathematics and Its Applications Kenneth H. Rosen (7 th Edition) Chapter 1 The Foundations: Logic and Proofs.
Lecture 4. CONDITIONAL STATEMENTS: Consider the statement: "If you earn an A in Math, then I'll buy you a computer." This statement is made up of two.
1 CMSC 250 Discrete Structures CMSC 250 Lecture 1.
CS 381 DISCRETE STRUCTURES Gongjun Yan Aug 25, November 2015Introduction & Propositional Logic 1.
September1999 CMSC 203 / 0201 Fall 2002 Week #1 – 28/30 August 2002 Prof. Marie desJardins.
Section 2-1 Conditional Statements. Conditional statements Have two parts: 1. Hypothesis (p) 2. Conclusion (q)
Conditional Statements
 Outside across from the word: › write the symbol for conditional: p -> q  INSIDE: › How to write the statement : If p, then q. › Example : If an angle.
1/10/ Math/CSE 1019N: Discrete Mathematics for Computer Science Winter 2007 Suprakash Datta Office: CSEB 3043 Phone:
Venn Diagrams Truth Sets & Valid Arguments Truth Sets & Valid Arguments Truth Tables Implications Truth Tables Implications Truth Tables Converse, Inverse,
UMBC CMSC 203, Section Fall CMSC 203, Section 0401 Discrete Structures Fall 2004 Matt Gaston
Mathematics for Comter I Lecture 2: Logic (1) Basic definitions Logical operators Translating English sentences.
: Solve using mental math. 1.3x = –18 ANSWER –6 ANSWER –10 2. b + 21 = Simplify the expression 3 ( x + 2 ) – 4x + 1. ANSWER –x + 7.
Lesson 2-1 Conditional Statements 1 Lesson 2-3 Conditional Statements.
1 Georgia Tech, IIC, GVU, 2006 MAGIC Lab Rossignac Lecture 01: Boolean Logic Sections 1.1 and 1.2 Jarek Rossignac.
DAY 8 Using Identity and Inverse to Write Equivalent Expressions.
Section 2.2 Homework Quiz Question Put the following Conditional Statement into If Then Form: All birds have feathers.
Simple Logic.
Chapter 1 Propositional Logic
2. The Logic of Compound Statements Summary
DISCRETE MATHEMATICS CHAPTER I.
CSNB 143 Discrete Mathematical Structures
6/20/2018 Arab Open University Faculty of Computer Studies M131 - Discrete Mathematics 6/20/2018.
Logic.
MATH 245 Spring 2009 This is mathematics for computer science
CPCS222 Discrete Structures I
Ch.1 (Part 1): The Foundations: Logic and Proofs
CSE 2353 – September 4th 2002 Logic.
Mathematics for Computing
CMSC Discrete Structures
Chapter 8 Logic Topics
CSCI 3310 Mathematical Foundation of Computer Science
CS 220: Discrete Structures and their Applications
(1.4) An Introduction to Logic
Discrete Mathematics and Its Applications Kenneth H
Discrete Mathematics Lecture 2: Propositional Logic
Symbolic Logic 2/25/2019 rd.
CSE 321 Discrete Structures
MAT 3100 Introduction to Proof
Cs Discrete Mathematics
Truth Tables for the Conditional and Biconditional
Logic and Reasoning.
Truth Tables for Conditional and Biconditional Statements
Presentation transcript:

Discrete Structures Class Meeting 1

Outline of Today Information sheet Questionnaire Quiz 0 Learning mathematics – Reading math – Solving problems

Learning Discrete Structures Reading the book Checking other sources Solving problems Counting Inquiry-based learning Conversation – BTW, What is a mathematical structure?

Propositions and Operators What’s an operator How many unary operators? – Names? How many binary operators? – Names?

Fundamental Ideas Threads through the course: Operators Functions Counting What comes next: order and standard order Structures: sets with operators and functions Sameness: when are two structures “the same”?

Homework Section 1.1: 2,4,6,8,10,12,18,24,28,30,32, 38,48 Section 1.2: 4,6,8,10,12,16,18

Glossary Proposition Conjunction – and Disjunction – or Conditional – implication, if-then Converse Inverse Contrapositive Equivalent Biconditional – if and only if Tautology Contradiction