September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins.

Slides:



Advertisements
Similar presentations
The Pigeon hole problem
Advertisements

22C:19 Discrete Math Counting Fall 2011 Sukumar Ghosh.
Lecture 4 4.1,4.2 Counting. 4.1 Counting Two Important Principles: Product Rule and Sum Rule. Product Rule: Assume we need to perform procedure 1 AND.
Recursively Defined Functions
The Pigeonhole Principle
after UCI ICS/Math 6A, Summer Counting-1 Counting: Product and Sum Rules Product Rule: Assuming a)We need to.
Week #10 – 28/30 October and 1 November 2002 Prof. Marie desJardins
Counting and Probability The outcome of a random process is sure to occur, but impossible to predict. Examples: fair coin tossing, rolling a pair of dice,
Copyright © Zeph Grunschlag, Counting Techniques Zeph Grunschlag.
CSE115/ENGR160 Discrete Mathematics 04/10/12
1 Copyright M.R.K. Krishna Rao 2003 Chapter 5. Discrete Probability Everything you have learned about counting constitutes the basis for computing the.
Recursive Definitions Rosen, 3.4 Recursive (or inductive) Definitions Sometimes easier to define an object in terms of itself. This process is called.
September1999 CMSC 203 / 0201 Fall 2002 Week #11 – 4/6/8 November 2002 Prof. Marie desJardins.
CS100 : Discrete Structures
Combinatorics 3/15 and 3/ Counting A restaurant offers the following menu: Main CourseVegetablesBeverage BeefPotatoesMilk HamGreen BeansCoffee.
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
Chapter The Basics of Counting 5.2 The Pigeonhole Principle
1 Lecture 3 (part 2) Functions – Pigeonhole Principle Reading: Epp Chp 7.4.
Week #7 – 7/9/11 October 2002 Prof. Marie desJardins
9.3 Addition Rule. The basic rule underlying the calculation of the number of elements in a union or difference or intersection is the addition rule.
Fall 2002CMSC Discrete Structures1 One, two, three, we’re… Counting.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
The Basics of Counting Section 6.1.
September1999 CMSC 203 / 0201 Fall 2002 Week #9 – 21/23/25 October 2002 Prof. Marie desJardins.
September1999 CMSC 203 / 0201 Fall 2002 Week #13 – 18/20/22 November 2002 Prof. Marie desJardins.
Discrete Structures Counting (Ch. 6)
Unit VI Discrete Structures Permutations and Combinations SE (Comp.Engg.)
Counting.
September1999 CMSC 203 / 0201 Fall 2002 Week #15 – 2/4/6 December 2002 Prof. Marie desJardins.
September1999 CMSC 203 / 0201 Fall 2002 Week #14 – 25/27 November 2002 Prof. Marie desJardins clip art courtesy of
1 Chapter 2 Pigeonhole Principle. 2 Summary Pigeonhole principle –simple form Pigeonhole principle –strong form Ramsey’s theorem.
1 The Pigeonhole Principle CS 202 Epp section 7.3.
2/24/20161 One, two, three, we’re… Counting. 2/24/20162 Basic Counting Principles Counting problems are of the following kind: “How many different 8-letter.
Introduction Suppose that a password on a computer system consists of 6, 7, or 8 characters. Each of these characters must be a digit or a letter of the.
Section 7.1. Probability of an Event We first define these key terms: An experiment is a procedure that yields one of a given set of possible outcomes.
Section Basic Counting Principles: The Product Rule The Product Rule: A procedure can be broken down into a sequence of two tasks. There are n 1.
1 The Pigeonhole Principle CS 202 Epp section ??? Aaron Bloomfield.
3/7/20161 Now it’s time to look at… Discrete Probability.
CS 104: Discrete Mathematics
Pigeonhole Principle – Page 1CPTR311 – Discrete Structures CPTR311 Discrete Structures Pigeonhole Principle Reading: Kolman, Section 3.3.
Discrete Mathematics. Exercises Exercise 1:  There are 18 Computer Science (CS) majors and 325 Business Administration (BA) majors at a college.
ICS 253: Discrete Structures I Counting and Applications King Fahd University of Petroleum & Minerals Information & Computer Science Department.
Section The Product Rule  Example: How many different license plates can be made if each plate contains a sequence of three uppercase English letters.
COUNTING Discrete Math Team KS MATEMATIKA DISKRIT (DISCRETE MATHEMATICS ) 1.
Principle of Inclusion and Exclusion
Now it’s time to look at…
The Pigeonhole Principle
CSC 321: Data Structures Fall 2015 Counting and problem solving
ICS 253: Discrete Structures I
Copyright © Zeph Grunschlag,
Discrete Structures for Computer Science
COCS DISCRETE STRUCTURES
9. Counting and Probability 1 Summary
Copyright © Zeph Grunschlag,
CS 2210 Discrete Structures Counting
Recursively Defined Functions
CS100: Discrete structures
Mathematics for Computer Science MIT 6.042J/18.062J
Week #5 – 23/25/27 September 2002 Prof. Marie desJardins
Week #3 – 9/11/13 September 2002 Prof. Marie desJardins
Week #6 – 30 September / 2/4 October 2002 Prof. Marie desJardins
The Pigeonhole Principle
Now it’s time to look at…
Week #2 – 4/6 September 2002 Prof. Marie desJardins
Basic Counting Lecture 9: Nov 5, 6.
Counting Elements of Disjoint Sets: The Addition Rule
The Pigeon hole problem
Representations of Integers
Now it’s time to look at…
Presentation transcript:

September1999 CMSC 203 / 0201 Fall 2002 Week #8 – 14/16 October 2002 Prof. Marie desJardins

September1999 October 1999 TOPICS  Counting  Inclusion-exclusion  Tree diagrams  Pigeonhole principle

September1999 MON 10/14 COUNTING BASICS (4.1)

September1999 October 1999 Concepts/Vocabulary  Counting  Sum rule |A 1  A 2  …  A m | = |A 1 | + … + |A m | for disjoint A i  Product rule |A 1 x A 2 x … x A m | = |A 1 |  |A 2 | …  |A m |  Inclusion-exclusion |A 1  A 2 | = |A 1 | + |A 2 | - |A 1  A 2 |  Tree diagrams

September1999 October 1999 Examples  Exercise 4.1.3: A multiple-choice test contains 10 questions. There are four possible answers for each question.  (a) How many ways can a student answer the questions on the test if every question is answered?  (b) How many ways can a student answer the questions on the test if the student can leave answers blank?

September1999 October 1999 Examples II  How many bit strings of length 8 are there?  How many bit strings of length 8 or less are there?  How many bit strings of length 8 or more are there? ☺  Exercise : How many bit strings with length not exceeding n, where n is a positive integer?  How many such strings consisting entirely of 1s?  How many functions are there from A  B where |A| = m and |B| = n?  How many 1-to-1 functions are there?

September1999 October 1999 Examples III  In how many ways can six elements a 1 …a 6 be placed into an array if:  (a) a 1 and a 2 must be in adjacent positions (not necessarily in that order)  (b) a 1 and a 2 must not be in adjacent positions  (c) a 1 must have a lower index than a 6  (Analogous to Exercise )  Exercise : Use a tree diagram to find the number of ways that the World Series can occur (four games out of seven wins the series)

September1999 WED 10/16 PIGEONHOLE PRINCIPLE (3.5) ** HOMEWORK #5 DUE **

September1999 October 1999 Concepts / Vocabulary  Pigeonhole Principle  If k+1 or more objects are in k boxes, at least one box has two or more objects  Generalized pigeonhole principle  If N objects are in k boxes, one box has at least  N/k  objects

September1999 October 1999 Examples  Exercise 4.2.4: A bowl contains 10 red balls and 10 blue balls. A woman selects balls at random without looking at them.  (a) How many balls must she select to be sure of having at least three balls of the same color?  (b) How many balls must she select to be sure of having at lets three blue balls?  Exercise 4.2.9: How many students, each of whom comes from one of the 50 states, must be enrolled in a university to guarantee that there are at lets 100 who come from the same state?

September1999 October 1999 Examples II  Example (page 248): Assume that in a group of six people, each pair of individuals consists of two friends or two enemies. Show that there are either three mutual friends or three mutual enemies in the group.  Exercise : A computer network consists of six computers. Each computer is directly connected to zero or more of the other computers. Show that there are at least two computers in the network that are directly connected to the same number of other computers.

September1999 FRI 10/11 ** NO CLASS **