{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lec13 - Discrete Computation Structures CSE 2353 Bhanu...

Info icon This preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Discrete Computation Structures CSE 2353 Bhanu Kapoor, PhD Department of Computer Science & Engineering Southern Methodist University, Dallas, TX [email protected] , 214-336-4973 October 08, 2009 Embrey 129, SMU, Dallas, Texas Lecture 13 1
Image of page 1

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Lecture 13 Agenda Counting Learn the basic counting principles Explore the pigeonhole principle Learn about permutations, combinations Binomial Coefficients, Algorithms , Discrete Probability 2
Image of page 2
Basic Counting Principles 3
Image of page 3

Info icon This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
Basic Counting Principles There are three boxes containing books The first box contains There are three boxes containing books. The first box contains 15 mathematics books by different authors, the second box contains 12 chemistry books by different authors, and the third box contains 10 computer science books by different authors. A student wants to take a book from one of the three boxes. In how many ways can the student do this? 4
Image of page 4