CSCI 2200 Foundations of Computer Science (FoCS) Solutions for Homework 7
|
|
- Deirdre McDowell
- 5 years ago
- Views:
Transcription
1 CSCI 00 Foundations of Computer Science (FoCS) Solutions for Homework 7 Homework Problems. [0 POINTS] Problem.4(e)-(f) [or F7 Problem.7(e)-(f)]: In each case, count. (e) The number of orders in which a traveling salesman can visit the 50 states. Solution: In this problem, since order does matter, we are counting the number of k- orderings or k-permutations, where k = 50 and the number of elements we are ordering is n = 50. Therefore, we can calculate q as the number of k-orderings as q = n! (n k)! = 50! = 50! 0! This is a very large number! If you happen to have used a calculator for this, the answer is (yikes). (f) The number of poker hands with a card in every suit. Solution: A poker hand consists of exactly five cards. The problem requires four cards to be in the four different suits. This implies that two cards will be of the same suit; in this case, there are ways to select the two cards. For the other suits, there are ways to select each card. Finally, we multiply the by 4, one for each suit: q = 4 ( )( )( )( ) = 4!!( )! (!!( )! ) = 85, 44. [0 POINTS] Problem.8(b) [this problem is not in the F7 textbook]: What is the coefficient of x in the expansion of: (b) ( x) Solution: We need to find the () i ( x) i term that produces the x term. Here, i =. From the Binomial Theorem, the x term is then () i ( x) i = () ( ) x =!!! (7)( 8)x = 40x The coefficient of x in the expansion of ( x) is 40.. [8 POINTS] Problem 4.8 [or F7 Problem 4.5]: Sets A, B, C have sizes,, 4. What are the min and max for A B C? Solution: 4 A B C 9
2 4. [8 POINTS] Problem 4.9(a) [this problem is not in the F7 textbook]: Consider the binary strings consisting of 0 bits. (a) How many contain fewer s than 0 s? Solution: Overall, there are 0 = 04 binary strings consisting of 0 bits. We must find x, the number of 0-bit binary strings containing fewer s than 0 s. There are at least two approaches here: i. Observe that the answer will be symmetric with the number of 0-bit binary strings containing fewer 0 s than s. Therefore, first calculate the number of 0-bit binary strings with the same number of 0 s and s as ( 0) 5 = 0! 5!5! = 5. Then, based on symmetry, x = 04 5 = 8. ii. Observe that to have fewer s than 0 s, a 0-bit binary string must contain n 0 s, where n takes on values {, 7, 8, 9, 0}. Therefore, we can calculate x = = = [0 POINTS] Problem 4.9(f)-(g) [or F7 Problem 4.(f)-(g)]: In each case, count the number of objects/arrangements of the given type: (f) US Social Security numbers (see Problem. [or F7 Problem.5]) with digits in strictly increasing order. Solution: This problem is essentially asking you to count x as the number of 9-digit sequences (i.e., leading zeroes are fine) in which each subsequent digit going from left to right increases. This is actually a rather small set of values: {04578, 04579, 04589, , 04789, 05789, , , , 45789} The number of sequences is therefore x = 0. (g) US Social Security numbers with digits in non-decreasing order. Solution: This problem is asking you to count y as the number of 9-digit sequences (i.e., leading zeroes are fine) in which each subsequent digit going from left to right does not decrease. A good way to tackle this problem is to come up with a simpler representation. In this case, use delimiters between each digit, in order from 0 up to 9. Let each represent a digit, and each represent a change from digit n to digit n. There will always be exactly 9 characters (because we require a 9-digit sequence) and exactly 9 delimiters, for an overall total of 8 characters. As an example, represents the 9-digit sequence Given the above representation, we need to count the number of ways we can place 9 delimiters before/among/after 9 digits. To accomplish this, we need to choose 9 spots out of 8. Therefore, y = ( 8 9 ) = 48, 0.
3 . [ POINTS] Problem 4. [or F7 Problem 4.]: Use inclusion-exclusion to count the integer solutions to x x x = 0 where x 0, x 8, and 0 x 5. Solution: Start by adjusting the ranges of x and x to be non-negative integers, so let y = x with 0 y, y = x with 0 y, and simply y = x with 0 y 5. From this, we use inclusion-exclusion to count the integer solutions of y y y = 0. This is a k-subset with repetition problem. From Chapter, we can make use of n k Q(n, k) = k More specifically, we start by counting the number of solutions with y, y, y 0; here, with n = 0 and k =, we have n k Q(n, k) = Q(0, ) = = = k Next (the exclusion part), let S be the set of solutions that violate the upper bound constraint on y. Therefore, S contains solutions to y y y = 0 with y. Similarly, let S be the set of solutions with y 7, and let S be the set of solutions with y. Given these sets, the number of solutions that satisfy y y y = 0 is Using inclusion-exclusion, we have Q(0, ) S S S S S S = S S S S S S S S S S S S To obtain S, observe that solutions to y y y = 0 with y are solutions to z y y = 7, where z = y and z 0. Therefore, S = Q(7, ) = ( 9 ) =. Using a similar approach, S = Q(, ) = ( 5) = 05 and S = Q(4, ) = ( ) = 5. To determine S S, we observe that this intersection contains solutions with both y and y 7. Therefore, S S = Q(0, ) = ( ) =. Similarly, S S = Q( 9, ) = 0 and S S = Q(, ) = 0. Finally, the cardinality of the intersection of all three, i.e., S S S = Q(, ) = 0. Putting this all together yields S S S = = 55 Therefore, our answer is 55 = 7.
4 7. [0 POINTS] Problem 4.50(a)-(b) [or F7 Problem 4.4(a)-(b)]: 8 distinguishable dice are rolled. How many outcomes are there? Solution: First, given 8 dice, there are 8 =, 79, possible outcomes. (a) How many outcomes do not contain a? How many do not contain a or? Solution: To determine how many outcomes do not contain a, each die roll has 5 possible outcomes. Therefore, with 8 dice, we have 5 8 = 90, 5 possible outcomes that do not contain a. Similarly, to determine how many outcomes do not contain a or a, each die roll has 4 possible outcomes. Therefore, with 8 dice, we have 4 8 = 5, 5 possible outcomes that do not contain a or a. (b) How many outcomes contain all numbers? [Hint: Inclusion-exclusion.] Solution: As noted above, with 8 dice, there are 8 =, 79, possible outcomes. Exclude from this the 5 8 = 90, 5 outcomes that do not contain a, the 5 8 = 90, 5 outcomes that do not contain a, etc. More specifically, we exclude 5 8 =, 4, 750 outcomes here. Next, we include (i.e., add back) the 4 8 = 5, 5 outcomes that do not contain a or a, since these were excluded twice in the previous step. To do this for each pair, we add back ( ) 4 8 = 98, 040. Continuing this pattern, we have our answer x calculated as x = =, 79,, 4, , 040, = 9, [ POINTS] Problem 5.7(a)-(c) [this problem is not in the F7 textbook]: Randomly roll two dice. Compute the probabilities to roll: (a) One six Solution: Overall, there are = possible outcomes. Of these, 0 outcomes contain exactly one die roll of. Note we do not count a pair of sixes here. Therefore, the probability of rolling a on either die is 0 = (b) A sum of Solution: Of the = possible outcomes, 5 outcomes that yield a sum of. Therefore, the probability of rolling a sum of on a pair of dice is 5 = (c) A sum that is a multiple of Solution: In this problem, we are looking for dice roll sums in set S = {,, 9, }. Of the = possible outcomes, there are 5 4 = outcomes that yield a sum in set S. Therefore, the probability of rolling a sum that is a multiple of three on a pair of dice is = 0.. 4
5 9. [0 POINTS] Problem 5.7(a)-(b) [this problem is not in the F7 textbook]: Draw two cards randomly from a 5-card deck. Compute the probabilities: (a) The first is a K and the second a picture-card (i.e., A, K, Q, J). Solution: For the first card drawn, the probability of drawing a K is P[first is K] = 4 5 = For the second card drawn, the probability of drawing a picture-card is P[second is picture-card first is K] = 5 5 = Combining these two as a product, we have P[answer] = = 5 = 0.0 (b) At least one card is a picture-card (i.e., A, K, Q, J). Solution: Start with all possible ways to select two cards, i.e., 5 5 = 5. Next, determine all possible ways to select no picture-cards. Note that we have 5 = non-picture-cards. Here, all possible ways to select two non-picture-cards is 5 = 0. Therefore, the probability of drawing two cards with at least one card being a picturecard is = = [0 POINTS] Problem.(a)-(b) [this problem is not in the F7 textbook]: One in 0 men are colorblind and one in 400 women are colorblind. There are an equal number of men and women. You select a person at random. (a) What is the probability that the person is colorblind? Solution: Given that there are an equal number of men and women, we select each with probability, which we then multiply and combine as follows: = = 800 = 0.05 (b) The person is colorblind. What is the probability that the person is male? Solution: Here, we are calculating P[person is male person is colorblind]. Using the conditional probability equation with A representing person is male and B representing person is colorblind, we have P[A B] = P[A B] P[B] First, P[A B] = = And from (a), P[B] = 800 = Then, we have P[A B] = P[A B] P[B] = = 0 =
6 CMMMMMMMMMMMMMMMMMMMFFFFFFFFFFFFFFFFFFFC
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability. Preliminary Concepts, Formulas, and Terminology
MAT104: Fundamentals of Mathematics II Summary of Counting Techniques and Probability Preliminary Concepts, Formulas, and Terminology Meanings of Basic Arithmetic Operations in Mathematics Addition: Generally
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationChapter 1. Probability
Chapter 1. Probability 1.1 Basic Concepts Scientific method a. For a given problem, we define measures that explains the problem well. b. Data is collected with observation and the measures are calculated.
More informationHonors Precalculus Chapter 9 Summary Basic Combinatorics
Honors Precalculus Chapter 9 Summary Basic Combinatorics A. Factorial: n! means 0! = Why? B. Counting principle: 1. How many different ways can a license plate be formed a) if 7 letters are used and each
More informationNovember 6, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 6, 2013 Last Time Crystallographic notation Groups Crystallographic notation The first symbol is always a p, which indicates that the pattern
More informationNovember 8, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 8, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Crystallographic notation The first symbol
More informationBlock 1 - Sets and Basic Combinatorics. Main Topics in Block 1:
Block 1 - Sets and Basic Combinatorics Main Topics in Block 1: A short revision of some set theory Sets and subsets. Venn diagrams to represent sets. Describing sets using rules of inclusion. Set operations.
More informationSection 6.1 #16. Question: What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit?
Section 6.1 #16 What is the probability that a five-card poker hand contains a flush, that is, five cards of the same suit? page 1 Section 6.1 #38 Two events E 1 and E 2 are called independent if p(e 1
More informationCounting in Algorithms
Counting Counting in Algorithms How many comparisons are needed to sort n numbers? How many steps to compute the GCD of two numbers? How many steps to factor an integer? Counting in Games How many different
More informationProbability Theory. Mohamed I. Riffi. Islamic University of Gaza
Probability Theory Mohamed I. Riffi Islamic University of Gaza Table of contents 1. Chapter 1 Probability Properties of probability Counting techniques 1 Chapter 1 Probability Probability Theorem P(φ)
More informationDISCUSSION #8 FRIDAY MAY 25 TH Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics
DISCUSSION #8 FRIDAY MAY 25 TH 2007 Sophie Engle (Teacher Assistant) ECS20: Discrete Mathematics 2 Homework 8 Hints and Examples 3 Section 5.4 Binomial Coefficients Binomial Theorem 4 Example: j j n n
More informationCS1802 Week 3: Counting Next Week : QUIZ 1 (30 min)
CS1802 Discrete Structures Recitation Fall 2018 September 25-26, 2018 CS1802 Week 3: Counting Next Week : QUIZ 1 (30 min) Permutations and Combinations i. Evaluate the following expressions. 1. P(10, 4)
More informationTheory of Probability - Brett Bernstein
Theory of Probability - Brett Bernstein Lecture 3 Finishing Basic Probability Review Exercises 1. Model flipping two fair coins using a sample space and a probability measure. Compute the probability of
More information8.2 Union, Intersection, and Complement of Events; Odds
8.2 Union, Intersection, and Complement of Events; Odds Since we defined an event as a subset of a sample space it is natural to consider set operations like union, intersection or complement in the context
More informationWeek 3 Classical Probability, Part I
Week 3 Classical Probability, Part I Week 3 Objectives Proper understanding of common statistical practices such as confidence intervals and hypothesis testing requires some familiarity with probability
More informationCompound Probability. Set Theory. Basic Definitions
Compound Probability Set Theory A probability measure P is a function that maps subsets of the state space Ω to numbers in the interval [0, 1]. In order to study these functions, we need to know some basic
More informationMutually Exclusive Events
Mutually Exclusive Events Suppose you are rolling a six-sided die. What is the probability that you roll an odd number and you roll a 2? Can these both occur at the same time? Why or why not? Mutually
More informationSection Summary. Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning
Section 7.1 Section Summary Finite Probability Probabilities of Complements and Unions of Events Probabilistic Reasoning Probability of an Event Pierre-Simon Laplace (1749-1827) We first study Pierre-Simon
More informationProbability. Ms. Weinstein Probability & Statistics
Probability Ms. Weinstein Probability & Statistics Definitions Sample Space The sample space, S, of a random phenomenon is the set of all possible outcomes. Event An event is a set of outcomes of a random
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Week 6 Lecture Notes Discrete Probability Note Binomial coefficients are written horizontally. The symbol ~ is used to mean approximately equal. Introduction and
More informationDiscrete Structures Lecture Permutations and Combinations
Introduction Good morning. Many counting problems can be solved by finding the number of ways to arrange a specified number of distinct elements of a set of a particular size, where the order of these
More informationFundamental. If one event can occur m ways and another event can occur n ways, then the number of ways both events can occur is:.
12.1 The Fundamental Counting Principle and Permutations Objectives 1. Use the fundamental counting principle to count the number of ways an event can happen. 2. Use the permutations to count the number
More informationDef: The intersection of A and B is the set of all elements common to both set A and set B
Def: Sample Space the set of all possible outcomes Def: Element an item in the set Ex: The number "3" is an element of the "rolling a die" sample space Main concept write in Interactive Notebook Intersection:
More informationLISTING THE WAYS. getting a total of 7 spots? possible ways for 2 dice to fall: then you win. But if you roll. 1 q 1 w 1 e 1 r 1 t 1 y
LISTING THE WAYS A pair of dice are to be thrown getting a total of 7 spots? There are What is the chance of possible ways for 2 dice to fall: 1 q 1 w 1 e 1 r 1 t 1 y 2 q 2 w 2 e 2 r 2 t 2 y 3 q 3 w 3
More informationCSE 21 Mathematics for Algorithm and System Analysis
CSE 21 Mathematics for Algorithm and System Analysis Unit 1: Basic Count and List Section 3: Set CSE21: Lecture 3 1 Reminder Piazza forum address: http://piazza.com/ucsd/summer2013/cse21/hom e Notes on
More informationMAT3707. Tutorial letter 202/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/202/1/2017
MAT3707/0//07 Tutorial letter 0//07 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Semester Department of Mathematical Sciences SOLUTIONS TO ASSIGNMENT 0 BARCODE Define tomorrow university of south africa
More informationCS100: DISCRETE STRUCTURES. Lecture 8 Counting - CH6
CS100: DISCRETE STRUCTURES Lecture 8 Counting - CH6 Lecture Overview 2 6.1 The Basics of Counting: THE PRODUCT RULE THE SUM RULE THE SUBTRACTION RULE THE DIVISION RULE 6.2 The Pigeonhole Principle. 6.3
More informationThe study of probability is concerned with the likelihood of events occurring. Many situations can be analyzed using a simplified model of probability
The study of probability is concerned with the likelihood of events occurring Like combinatorics, the origins of probability theory can be traced back to the study of gambling games Still a popular branch
More information2. Nine points are distributed around a circle in such a way that when all ( )
1. How many circles in the plane contain at least three of the points (0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2), (2, 0), (2, 1), (2, 2)? Solution: There are ( ) 9 3 = 8 three element subsets, all
More informationLecture 2: Sum rule, partition method, difference method, bijection method, product rules
Lecture 2: Sum rule, partition method, difference method, bijection method, product rules References: Relevant parts of chapter 15 of the Math for CS book. Discrete Structures II (Summer 2018) Rutgers
More informationChapter 2. Permutations and Combinations
2. Permutations and Combinations Chapter 2. Permutations and Combinations In this chapter, we define sets and count the objects in them. Example Let S be the set of students in this classroom today. Find
More informationIt is important that you show your work. The total value of this test is 220 points.
June 27, 2001 Your name It is important that you show your work. The total value of this test is 220 points. 1. (10 points) Use the Euclidean algorithm to solve the decanting problem for decanters of sizes
More informationCS 237 Fall 2018, Homework SOLUTION
0//08 hw03.solution.lenka CS 37 Fall 08, Homework 03 -- SOLUTION Due date: PDF file due Thursday September 7th @ :59PM (0% off if up to 4 hours late) in GradeScope General Instructions Please complete
More informationCIS 2033 Lecture 6, Spring 2017
CIS 2033 Lecture 6, Spring 2017 Instructor: David Dobor February 2, 2017 In this lecture, we introduce the basic principle of counting, use it to count subsets, permutations, combinations, and partitions,
More informationPROBABILITY. 1. Introduction. Candidates should able to:
PROBABILITY Candidates should able to: evaluate probabilities in simple cases by means of enumeration of equiprobable elementary events (e.g for the total score when two fair dice are thrown), or by calculation
More informationUnit Nine Precalculus Practice Test Probability & Statistics. Name: Period: Date: NON-CALCULATOR SECTION
Name: Period: Date: NON-CALCULATOR SECTION Vocabulary: Define each word and give an example. 1. discrete mathematics 2. dependent outcomes 3. series Short Answer: 4. Describe when to use a combination.
More informationReading 14 : Counting
CS/Math 240: Introduction to Discrete Mathematics Fall 2015 Instructors: Beck Hasti, Gautam Prakriya Reading 14 : Counting In this reading we discuss counting. Often, we are interested in the cardinality
More informationSection Introduction to Sets
Section 1.1 - Introduction to Sets Definition: A set is a well-defined collection of objects usually denoted by uppercase letters. Definition: The elements, or members, of a set are denoted by lowercase
More informationPrinciple of Inclusion-Exclusion Notes
Principle of Inclusion-Exclusion Notes The Principle of Inclusion-Exclusion (often abbreviated PIE is the following general formula used for finding the cardinality of a union of finite sets. Theorem 0.1.
More informationIntroductory Probability
Introductory Probability Combinations Nicholas Nguyen nicholas.nguyen@uky.edu Department of Mathematics UK Agenda Assigning Objects to Identical Positions Denitions Committee Card Hands Coin Toss Counts
More informationThe probability set-up
CHAPTER 2 The probability set-up 2.1. Introduction and basic theory We will have a sample space, denoted S (sometimes Ω) that consists of all possible outcomes. For example, if we roll two dice, the sample
More informationRosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples
Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples Section 6.1 An Introduction to Discrete Probability Page references correspond to locations of Extra Examples icons in the textbook.
More informationLecture 6 Probability
Lecture 6 Probability Example: When you toss a coin, there are only two possible outcomes, heads and tails. What if we toss a coin two times? Figure below shows the results of tossing a coin 5000 times
More informationNovember 11, Chapter 8: Probability: The Mathematics of Chance
Chapter 8: Probability: The Mathematics of Chance November 11, 2013 Last Time Probability Models and Rules Discrete Probability Models Equally Likely Outcomes Probability Rules Probability Rules Rule 1.
More informationEECS 203 Spring 2016 Lecture 15 Page 1 of 6
EECS 203 Spring 2016 Lecture 15 Page 1 of 6 Counting We ve been working on counting for the last two lectures. We re going to continue on counting and probability for about 1.5 more lectures (including
More informationProblem Set 2. Counting
Problem Set 2. Counting 1. (Blitzstein: 1, Q3 Fred is planning to go out to dinner each night of a certain week, Monday through Friday, with each dinner being at one of his favorite ten restaurants. i
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
More 9.-9.3 Practice Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Answer the question. ) In how many ways can you answer the questions on
More information3 The multiplication rule/miscellaneous counting problems
Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1 Suppose P (A 0, P (B 05 (a If A and B are independent, what is P (A B? What is P (A B? (b If A and B are disjoint, what is
More informationChapter 3: Elements of Chance: Probability Methods
Chapter 3: Elements of Chance: Methods Department of Mathematics Izmir University of Economics Week 3-4 2014-2015 Introduction In this chapter we will focus on the definitions of random experiment, outcome,
More informationPermutations and Combinations
Permutations and Combinations Introduction Permutations and combinations refer to number of ways of selecting a number of distinct objects from a set of distinct objects. Permutations are ordered selections;
More informationTopics to be covered
Basic Counting 1 Topics to be covered Sum rule, product rule, generalized product rule Permutations, combinations Binomial coefficients, combinatorial proof Inclusion-exclusion principle Pigeon Hole Principle
More informationDiscrete Structures for Computer Science
Discrete Structures for Computer Science William Garrison bill@cs.pitt.edu 6311 Sennott Square Lecture #23: Discrete Probability Based on materials developed by Dr. Adam Lee The study of probability is
More informationCSE 312: Foundations of Computing II Quiz Section #2: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions)
CSE 31: Foundations of Computing II Quiz Section #: Inclusion-Exclusion, Pigeonhole, Introduction to Probability (solutions) Review: Main Theorems and Concepts Binomial Theorem: x, y R, n N: (x + y) n
More informationGrade 6 Math Circles Fall Oct 14/15 Probability
1 Faculty of Mathematics Waterloo, Ontario Centre for Education in Mathematics and Computing Grade 6 Math Circles Fall 2014 - Oct 14/15 Probability Probability is the likelihood of an event occurring.
More informationFoundations of Computing Discrete Mathematics Solutions to exercises for week 12
Foundations of Computing Discrete Mathematics Solutions to exercises for week 12 Agata Murawska (agmu@itu.dk) November 13, 2013 Exercise (6.1.2). A multiple-choice test contains 10 questions. There are
More informationClass XII Chapter 13 Probability Maths. Exercise 13.1
Exercise 13.1 Question 1: Given that E and F are events such that P(E) = 0.6, P(F) = 0.3 and P(E F) = 0.2, find P (E F) and P(F E). It is given that P(E) = 0.6, P(F) = 0.3, and P(E F) = 0.2 Question 2:
More informationINDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2
INDEPENDENT AND DEPENDENT EVENTS UNIT 6: PROBABILITY DAY 2 WARM UP Students in a mathematics class pick a card from a standard deck of 52 cards, record the suit, and return the card to the deck. The results
More informationThe probability set-up
CHAPTER The probability set-up.1. Introduction and basic theory We will have a sample space, denoted S sometimes Ω that consists of all possible outcomes. For example, if we roll two dice, the sample space
More information3 The multiplication rule/miscellaneous counting problems
Practice for Exam 1 1 Axioms of probability, disjoint and independent events 1. Suppose P (A) = 0.4, P (B) = 0.5. (a) If A and B are independent, what is P (A B)? What is P (A B)? (b) If A and B are disjoint,
More informationFinal Exam, Math 6105
Final Exam, Math 6105 SWIM, June 29, 2006 Your name Throughout this test you must show your work. 1. Base 5 arithmetic (a) Construct the addition and multiplication table for the base five digits. (b)
More informationCSC/MATA67 Tutorial, Week 12
CSC/MATA67 Tutorial, Week 12 November 23, 2017 1 More counting problems A class consists of 15 students of whom 5 are prefects. Q: How many committees of 8 can be formed if each consists of a) exactly
More informationRaise your hand if you rode a bus within the past month. Record the number of raised hands.
166 CHAPTER 3 PROBABILITY TOPICS Raise your hand if you rode a bus within the past month. Record the number of raised hands. Raise your hand if you answered "yes" to BOTH of the first two questions. Record
More informationAlgebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations
Algebra 2 Notes Section 10.1: Apply the Counting Principle and Permutations Objective(s): Vocabulary: I. Fundamental Counting Principle: Two Events: Three or more Events: II. Permutation: (top of p. 684)
More informationCSC/MTH 231 Discrete Structures II Spring, Homework 5
CSC/MTH 231 Discrete Structures II Spring, 2010 Homework 5 Name 1. A six sided die D (with sides numbered 1, 2, 3, 4, 5, 6) is thrown once. a. What is the probability that a 3 is thrown? b. What is the
More information1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building?
1. An office building contains 27 floors and has 37 offices on each floor. How many offices are in the building? 2. A particular brand of shirt comes in 12 colors, has a male version and a female version,
More informationExam III Review Problems
c Kathryn Bollinger and Benjamin Aurispa, November 10, 2011 1 Exam III Review Problems Fall 2011 Note: Not every topic is covered in this review. Please also take a look at the previous Week-in-Reviews
More information4.3 Finding Probability Using Sets
4.3 Finding Probability Using ets When rolling a die with sides numbered from 1 to 20, if event A is the event that a number divisible by 5 is rolled: a) What is the sample space,? b) What is the event
More informationSTAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes
STAT 430/510 Probability Lecture 3: Space and Event; Sample Spaces with Equally Likely Outcomes Pengyuan (Penelope) Wang May 25, 2011 Review We have discussed counting techniques in Chapter 1. (Principle
More informationMULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question.
Study Guide for Test III (MATH 1630) Name MULTIPLE CHOICE. Choose the one alternative that best completes the statement or answers the question. Find the number of subsets of the set. 1) {x x is an even
More informationn r for the number. (n r)!r!
Throughout we use both the notations ( ) n r and C n n! r for the number (n r)!r! 1 Ten points are distributed around a circle How many triangles have all three of their vertices in this 10-element set?
More informationMath 1313 Section 6.2 Definition of Probability
Math 1313 Section 6.2 Definition of Probability Probability is a measure of the likelihood that an event occurs. For example, if there is a 20% chance of rain tomorrow, that means that the probability
More informationMat 344F challenge set #2 Solutions
Mat 344F challenge set #2 Solutions. Put two balls into box, one ball into box 2 and three balls into box 3. The remaining 4 balls can now be distributed in any way among the three remaining boxes. This
More informationMathematics 'A' level Module MS1: Statistics 1. Probability. The aims of this lesson are to enable you to. calculate and understand probability
Mathematics 'A' level Module MS1: Statistics 1 Lesson Three Aims The aims of this lesson are to enable you to calculate and understand probability apply the laws of probability in a variety of situations
More informationMultiple Choice Questions for Review
Review Questions Multiple Choice Questions for Review 1. Suppose there are 12 students, among whom are three students, M, B, C (a Math Major, a Biology Major, a Computer Science Major. We want to send
More information4.1 Sample Spaces and Events
4.1 Sample Spaces and Events An experiment is an activity that has observable results. Examples: Tossing a coin, rolling dice, picking marbles out of a jar, etc. The result of an experiment is called an
More informationToday s Topics. Next week: Conditional Probability
Today s Topics 2 Last time: Combinations Permutations Group Assignment TODAY: Probability! Sample Spaces and Event Spaces Axioms of Probability Lots of Examples Next week: Conditional Probability Sets
More informationAnswer each of the following problems. Make sure to show your work.
Answer each of the following problems. Make sure to show your work. 1. A board game requires each player to roll a die. The player with the highest number wins. If a player wants to calculate his or her
More informationRandomized Algorithms
Presentation for use with the textbook, Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015 Randomized Algorithms Randomized Algorithms 1 Applications: Simple Algorithms and
More informationSolutions to Problem Set 7
Massachusetts Institute of Technology 6.4J/8.6J, Fall 5: Mathematics for Computer Science November 9 Prof. Albert R. Meyer and Prof. Ronitt Rubinfeld revised November 3, 5, 3 minutes Solutions to Problem
More informationMATH 215 DISCRETE MATHEMATICS INSTRUCTOR: P. WENG
MATH DISCRETE MATHEMATICS INSTRUCTOR: P. WENG Counting and Probability Suggested Problems Basic Counting Skills, Inclusion-Exclusion, and Complement. (a An office building contains 7 floors and has 7 offices
More informationIntroduction to Mathematical Reasoning, Saylor 111
Here s a game I like plying with students I ll write a positive integer on the board that comes from a set S You can propose other numbers, and I tell you if your proposed number comes from the set Eventually
More informationProbability MAT230. Fall Discrete Mathematics. MAT230 (Discrete Math) Probability Fall / 37
Probability MAT230 Discrete Mathematics Fall 2018 MAT230 (Discrete Math) Probability Fall 2018 1 / 37 Outline 1 Discrete Probability 2 Sum and Product Rules for Probability 3 Expected Value MAT230 (Discrete
More informationCombinatorics: The Fine Art of Counting
Combinatorics: The Fine Art of Counting Lecture Notes Counting 101 Note to improve the readability of these lecture notes, we will assume that multiplication takes precedence over division, i.e. A / B*C
More informationDiscrete mathematics
Discrete mathematics Petr Kovář petr.kovar@vsb.cz VŠB Technical University of Ostrava DiM 470-2301/02, Winter term 2018/2019 About this file This file is meant to be a guideline for the lecturer. Many
More informationUnit 9: Probability Assignments
Unit 9: Probability Assignments #1: Basic Probability In each of exercises 1 & 2, find the probability that the spinner shown would land on (a) red, (b) yellow, (c) blue. 1. 2. Y B B Y B R Y Y B R 3. Suppose
More informationProbability and Counting Techniques
Probability and Counting Techniques Diana Pell (Multiplication Principle) Suppose that a task consists of t choices performed consecutively. Suppose that choice 1 can be performed in m 1 ways; for each
More informationWhat is counting? (how many ways of doing things) how many possible ways to choose 4 people from 10?
Chapter 5. Counting 5.1 The Basic of Counting What is counting? (how many ways of doing things) combinations: how many possible ways to choose 4 people from 10? how many license plates that start with
More information5 Elementary Probability Theory
5 Elementary Probability Theory 5.1 What is Probability? The Basics We begin by defining some terms. Random Experiment: any activity with a random (unpredictable) result that can be measured. Trial: one
More information2. Combinatorics: the systematic study of counting. The Basic Principle of Counting (BPC)
2. Combinatorics: the systematic study of counting The Basic Principle of Counting (BPC) Suppose r experiments will be performed. The 1st has n 1 possible outcomes, for each of these outcomes there are
More informationRANDOM EXPERIMENTS AND EVENTS
Random Experiments and Events 18 RANDOM EXPERIMENTS AND EVENTS In day-to-day life we see that before commencement of a cricket match two captains go for a toss. Tossing of a coin is an activity and getting
More informationProbability and Randomness. Day 1
Probability and Randomness Day 1 Randomness and Probability The mathematics of chance is called. The probability of any outcome of a chance process is a number between that describes the proportion of
More informationCHAPTER 2 PROBABILITY. 2.1 Sample Space. 2.2 Events
CHAPTER 2 PROBABILITY 2.1 Sample Space A probability model consists of the sample space and the way to assign probabilities. Sample space & sample point The sample space S, is the set of all possible outcomes
More informationProbability: Terminology and Examples Spring January 1, / 22
Probability: Terminology and Examples 18.05 Spring 2014 January 1, 2017 1 / 22 Board Question Deck of 52 cards 13 ranks: 2, 3,..., 9, 10, J, Q, K, A 4 suits:,,,, Poker hands Consists of 5 cards A one-pair
More informationCISC-102 Fall 2017 Week 8
Week 8 Page! of! 34 Playing cards. CISC-02 Fall 207 Week 8 Some of the following examples make use of the standard 52 deck of playing cards as shown below. There are 4 suits (clubs, spades, hearts, diamonds)
More informationChapter 5: Probability: What are the Chances? Section 5.2 Probability Rules
+ Chapter 5: Probability: What are the Chances? Section 5.2 + Two-Way Tables and Probability When finding probabilities involving two events, a two-way table can display the sample space in a way that
More information50 Counting Questions
50 Counting Questions Prob-Stats (Math 3350) Fall 2012 Formulas and Notation Permutations: P (n, k) = n!, the number of ordered ways to permute n objects into (n k)! k bins. Combinations: ( ) n k = n!,
More informationJong C. Park Computer Science Division, KAIST
Jong C. Park Computer Science Division, KAIST Today s Topics Basic Principles Permutations and Combinations Algorithms for Generating Permutations Generalized Permutations and Combinations Binomial Coefficients
More informationIn how many ways can the letters of SEA be arranged? In how many ways can the letters of SEE be arranged?
-Pick up Quiz Review Handout by door -Turn to Packet p. 5-6 In how many ways can the letters of SEA be arranged? In how many ways can the letters of SEE be arranged? - Take Out Yesterday s Notes we ll
More informationSection 6.5 Conditional Probability
Section 6.5 Conditional Probability Example 1: An urn contains 5 green marbles and 7 black marbles. Two marbles are drawn in succession and without replacement from the urn. a) What is the probability
More informationChapter 3: Probability (Part 1)
Chapter 3: Probability (Part 1) 3.1: Basic Concepts of Probability and Counting Types of Probability There are at least three different types of probability Subjective Probability is found through people
More information