lec13 - Discrete Computation Structures CSE 2353 Bhanu...

Info iconThis preview shows pages 1–5. 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 bkapoor@smu.edu , 214-336-4973 October 08, 2009 Embrey 129, SMU, Dallas, Texas Lecture 13 1
Background image of page 1

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

View Full DocumentRight Arrow Icon
Lecture 13 Agenda ± Counting earn the basic counting principles ² Learn the basic counting principles ² Explore the pigeonhole principle ² Learn about permutations, combinations ² Binomial Coefficients, Algorithms , Discrete Probability 2
Background image of page 2
Basic Counting Principles 3
Background image of page 3

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

View Full DocumentRight Arrow Icon
Basic Counting Principles here 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?
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/11/2009 for the course CSE 2353 taught by Professor Bhanukapoor during the Spring '09 term at SMU.

Page1 / 22

lec13 - Discrete Computation Structures CSE 2353 Bhanu...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online