# Lecture Notes for CMSC 250 - Discrete Structures with Plane at Maryland (UMD)

## Notes Information

 Material Type: Class Note Professor: Plane Class: CMSC 250 - Discrete Structures Subject: Computer Science University: University of Maryland Term: -- Keywords: CombinationsSimilaritiesVice PresidentSample SpaceProbabilitiesThe PresidentAddition RuleConditionalInfinite SetsPropositional

## Sample Document Text

1 Counting Elements in a List . How many integers in the list from 1 to 10? . How many integers in the list from m to n? (assuming m <= n) How many in a list divisible by something: . How many positive three digit integers are there? - (this means only the ones that require 3 digits) - 999 - 100 + 1 = 900 . How many three digit integers are divisible by 5? - think about the definition of divisible by x | y « \$ k ?Z, y = kx and then count the k's that work 100, 101, 102, 103, 104, 105, 106,. 994, 995, 996, 997, 998, 999 20*5 21*5 . 199*5 - count the integers between 20 and 199 - 199 - 20 + 1 = 180 2 Probability likelihood of a specific event . Sample Space = set of all possible outcomes . Event = subset of sample space . Equal Probability Formula: - Given a finite sample space S where all outcomes are equally likely - Select an event E from the sample space S - The probability of event E from sample space S: )( )()( Sn EnEP = Flipping Two ...

## Related Documents

Combinations Notes
Combinations Notes
Combinations Notes
Combinations Notes
Conditional Notes
Explanation Quiz
Somatic Mutations Notes
Somatic Mutations Notes
Presentation Methods Notes
Class Intervals Notes
Best Wishes Notes
Random Samples Notes
Visual Analytics Notes
Cognitive Models Notes