 22M:150 Introduction to Discrete Mathematics  Fall 2009 10:30A - 11:20A MWF 218 MLH  Instructor: Dr. Isabel Darcy Office:B1H MLH Phone: 335- 0778 Email:

Slides:



Advertisements
Similar presentations
Based on Rosen, Discrete Mathematics & Its Applications, 5e (c) Michael P. Frank Modified by (c) Haluk Bingöl 1/18 Module #0 - Overview.
Advertisements

Induction and recursion
Welcome to MAT 142 TTh. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday 10:30 am – 11:30 am Wednesday 11:45 am – 12:45.
CSE116 Introduction to Computer Science II
Exploring the Internet Instructor: Michael Krolak.
Welcome to MAT 170 MWF 9:40 SLN Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 9:15 am – 10: 15 am Tuesday and Thursday.
A Tromino Simulation by Andre Berthiaume
Statistical Methods in Computer Science Course Introduction Ido Dagan.
Welcome to MAT 142 MWF 7:40 SLN Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 9:15 am – 10: 15 am Tuesday and Thursday.
CS3381 Des & Anal of Alg ( SemA) City Univ of HK / Dept of CS / Helena Wong 0. Course Introduction - 1 CS3381 Design and Analysis of Algorithms.
Module #1 - Logic Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank. Modified By Mingwu Chen 1 Module.
Course Introduction Computer Science Department CS141:Computer Programming 1 Fall 2014 Dr. Hamid Al-Hamadi.
Welcome to MAT 142. Basic Course Information Instructor Office Office Hours Beth Jones PSA 725 Tuesday and Thursday 10:30 am – 11:30 am Wednesday 9:40.
COURSE NAME : PATIENT ASSESSMENT 111 COURSE CODE: EMS (351) DAY: SUNDAY, MONDAY (Theory) TIME : 1:2 pm / 2:3 pm PRACTICAL DAY: TUESDAY TIME.
CS143: Programming in C++ Instructor: Dr. Yan Shi Office: 210 Ullrich Phone: Office Hour:
WX 365 Satellite and Radar Weather Interpretation Dr. Brad Muller.
IB 429 ANSC 466 ANTH 442 Animal Behavior MWF 3-3: Roger Adams Lab 1 hand out: course syllabus.
CS 2210 (22C:019) Discrete Structures Logic and Proof Spring 2015 Sukumar Ghosh.
Discrete Mathematics I 暨南大学 信息科学技术学院 计算机科学系 黄 战 副教授 离散数学 I (全英)
CS 103 Discrete Structures Lecture 01 Introduction to the Course
CS 390 Introduction to Theoretical Computer Science.
Discrete mathematics Kwon, Taekyoung Courtesy of Dr. Michael P. Frank University of Florida.
Korea Advanced Institute of Science and Technology, Dept. of EECS, Div. of CS, Information Systems Lab. 1/10 CS204 Course Overview Prof.
Course Guide CS 285 Discrete Mathematics Dr. Eng. Manal Farrag Prince Sultan University, College for Women
Discrete Mathematics 이재원 School of Information Technology
Discrete Mathematics CS204 Spring CS204 Discrete Mathematics Instructor: Professor Chin-Wan Chung (Office: Rm 3406, Tel:3537) 1.Lecture 1)Time:
Welcome to CMPSC 360!. Today Introductions Student Information Sheets, Autobiography What is Discrete Math? Syllabus Highlights
Introduction COMP283 – Discrete Structures. JOOHWI LEE Dr. Lee or Mr. Lee ABD Student working with Dr. Styner
CompSci 102 Discrete Math for Computer Science March 1, 2012 Prof. Rodger Slides modified from Rosen.
CS 1813 Discrete Mathematics, Univ Oklahoma Copyright © 2000 by Rex Page 1 PSP Calculations least squares size, least squares time confidence interval.
CS 1813 Discrete Mathematics, Univ Oklahoma Copyright © 2000 by Rex Page 1 Lecture 2 CS 1813 – Discrete Mathematics Proofs Propositions and Calculuses.
TESSELLATIONS A Tessellation (or Tiling) is a repeating pattern of figures that covers a plane without any gaps or overlaps.
MA125 – Sections 105/107 Calculus I Dr. Audi Byrne As you enter, please feel to introduce yourself to a couple other people in the class. Pick up a syllabus.
22C:19 Discrete Structures Logic and Proof Fall 2014 Sukumar Ghosh.
Dr. Michael Featherstone Project Management - ime380.
Instructor: Robert Hiromoto Office: CAES Room 258 Phone: (CAES) Class hours: W 7:00pm - 9:45pm (Idaho Falls) Classroom:
Mathematical Induction
Accounting – F ’13 Accountancy I Department of Accountancy University of Notre Dame.
Senior Seminar in Mathematics Math 495 Course Syllabus Class Periods: 2:30pm-3:45pm TR Classroom: Thompson Hall 303 Instructor: Mei Q. Chen, Thompson Hall.
Chapter 5. Section 5.1 Climbing an Infinite Ladder Suppose we have an infinite ladder: 1.We can reach the first rung of the ladder. 2.If we can reach.
Introduction to Structures CSLU 1100.Lo3 Fall 2007 Cameron McInally Fordham University.
Discrete mathematics Kwon, Tae-kyoung
CS143: Programming in C++ Fall 2012 Section 3, 5 and 6 Instructor: Dr. Lisa M. Landgraf 211 Ullrich Phone: ZIMBRA Appointments.
Introduction to Criminology Crim Opening Day.
CS 2210:0001 Discrete Structures Logic and Proof
22446: Microprocessors Introduction
Welcome to MAT 170 MWF 8:40 SLN
Attic Perfect 1001 Hensley St. Suite A Richmond, CA Phone:
CS 201 – Data Structures and Discrete Mathematics I
CLP 6527, Measurement, Design and Statistics I
Senior Seminar in Mathematics Math 495 Course Syllabus
Do a Simpler Question, Find a Pattern!
Lecture 16 CS 1813 – Discrete Mathematics
Quizzes CS 1813 – Discrete Mathematics
Induction and recursion
GHY Global Climate Change
What you need to know about this course!
Seminar CSCE 481 Dr. Scott Schaefer.
Lecture 1 CS 1813 – Discrete Mathematics
Welcome to MAT 142.
Welcome to MAT 170 MWF.
Introduction to Programming I
CS 250, Discrete Structures, Fall 2014 Nitesh Saxena
Administrative Issues
Advanced Web Development
EDU 210: Children’s Literature
Introduction Lecture 1 Wed, Jan 17, 2007.
CS 250, Discrete Structures, Fall 2015 Nitesh Saxena
Booking your accommodated exams online
Presentation transcript:

 22M:150 Introduction to Discrete Mathematics  Fall :30A - 11:20A MWF 218 MLH  Instructor: Dr. Isabel Darcy Office:B1H MLH Phone: idarcy AT math.uiowa.edu THIS WEEK'S Office Hours: M 12:10-1:00pm, T 1:00 - 1:50pm, Th 2:30 - 3:20pm, F: 2:30 - 3pm, and by appointment. Course WWW site: SES/150/FALL09/150.htmlhttp:// SES/150/FALL09/150.html 1

2016/1/12 (c) , Michael P. Frank 2 So, what’s this class about? What are “discrete structures” anyway?  “Discrete” - Composed of distinct, separable parts. (Opposite of continuous.) discrete:continuous :: digital:analog  “Structures” - objects built up from simpler objects according to a definite pattern.  “Discrete Mathematics” - The study of discrete, mathematical objects and structures. From: MI112A & MI112B Discrete Mathematics, Jen-Liang Cheng Ph.D.

CS 1813 Discrete Mathematics, Univ Oklahoma Copyright © 2000 by Rex Page 3 Tiling with Dominos a mathematical proof – just for practice checkerboard with two missing corners Problem  cover board with dominos  no overlapping dominos  no dominos outside board Dominos – size matches board One domino covers how many red squares? How many squares on board? So, how many dominos will it take? 31 dominos cover how many red squares? How many red squares are there? TILT Yikes! What’s wrong here? Adapted from Singh, Fermat’s Enigma, Walker & Co,