{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

L14_IntroProbability

# L14_IntroProbability - COMP170 Discrete Mathematical Tools...

This preview shows pages 1–10. Sign up to view the full content.

1-1 COMP170 Discrete Mathematical Tools for Computer Science Discrete Math for Computer Science K. Bogart, C. Stein and R.L. Drysdale Section 5.1, pp. 213-221 Intro to Probability Version 2.0: Last updated, May 13, 2007 Slides c 2005 by M. J. Golin and G. Trippen

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

View Full Document
2-1 Introduction to Probability Why Study Probability? Complementary Probabilities Probability Spaces and Distributions Probability and Hashing The Uniform Probability Distribution
3-1 Why Study Probability?

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

View Full Document
3-2 Why Study Probability? In Computer Science we often deal with random events . Some involve randomness imposed from the outside, e.g., networking, when requests from computers on the network enter the network at “random” time. Some involve randomness that we introduce, e.g., hashing , which is a techinique often used to compactly store information in a computer for later quick retrieval.
3-3 Why Study Probability? In Computer Science we often deal with random events . Some involve randomness imposed from the outside, e.g., networking, when requests from computers on the network enter the network at “random” time. Some involve randomness that we introduce, e.g., hashing , which is a techinique often used to compactly store information in a computer for later quick retrieval. Studying the performance of computer systems in the presence of these types of randomness, requires understanding random- ness, which is the study of probability .

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

View Full Document
4-1 Hashing
4-2 Hashing Imagine a company with one hundred employees. There’s not enough room in the main office to give each one a mailbox. So, instead, they have one mailbox for each letter of the alphabet. When a letter arrived, it gets put into the box corresponding to the recipients surname. This is an example of a Hash Function .

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

View Full Document
4-3 Hashing Imagine a company with one hundred employees. There’s not enough room in the main office to give each one a mailbox. So, instead, they have one mailbox for each letter of the alphabet. When a letter arrived, it gets put into the box corresponding to the recipients surname. This is an example of a Hash Function . Hashing is a very common programming tool that permits con- cise storage of data with quick lookups. The general idea is that we have a set of records that need to be stored. Each record is addressed using its key , e.g., name or ID number.
4-4 Hashing Imagine a company with one hundred employees. There’s not enough room in the main office to give each one a mailbox. So, instead, they have one mailbox for each letter of the alphabet. When a letter arrived, it gets put into the box corresponding to the recipients surname. This is an example of a Hash Function . Hashing is a very common programming tool that permits con- cise storage of data with quick lookups. The general idea is that we have a set of records that need to be stored. Each record is addressed using its key , e.g., name or ID number.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 168

L14_IntroProbability - COMP170 Discrete Mathematical Tools...

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

View Full Document
Ask a homework question - tutors are online