HW Solution 3 Due: July 15

Size: px
Start display at page:

Download "HW Solution 3 Due: July 15"

Transcription

1 ECS 315: Probability and Random Processes 2010/1 HW Solution 3 Due: July 15 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) A part of ONE question will be graded. Of course, you do not know which problem will be selected; so you should work on all of them. (b) Late submission will not be accepted. (c) Write down all the steps that you have done to obtain your answers. You may not get full credit even when your answer is correct without showing how you get your answer. Problem 1. Someone has rolled a fair die twice. You know that one of the rolls turned up a face value of six. What is the probability that the other roll turned up a six as well? Hint: Not 1 6. Take as sample space the set {(i, j) i, j = 1,..., 6}, where i and j denote the outcomes of the first and second rolls. A probability of 1/36 is assigned to each element of the sample space. The event of two sixes is given by A = {(6, 6)} and the event of at least one six is given by B = (1, 6),..., (5, 6), (6, 6), (6, 5),..., (6, 1). Applying the definition of conditional probability gives P (A B) = P (A B)/P (B) = 1/36 11/36. Hence the desired probability is 1/11. [Tijms, 2007, Example 8.1, p. 244] Problem 2. [Gubner, 2006, Q2.60] You have five computer chips, two of which are known to be defective. (a) You test one of the chips; what is the probability that it is defective? (b) Your friend tests two chips at random and reports that one is defective and one is not. Given this information, you test one of the three remaining chips at random; what is the conditional probability that the chip you test is defective? 3-1

2 (a) 2 5. (b) Among the three remaining chips, only one is defective. So, the conditional probability that the chosen chip is defective is 1 3. Problem 3. Prove the following facts about independence between two events: (a) An event with probability 0 or 1 is independent of any event (including itself). (In particular, and Ω are independent of any events.) (b) An event A is independent of itself if and only if P (A) is 0 or 1. (a) Suppose P (A) = 1. Then, 0 P (B \ A) P (A c ) = 0 and hence P (A B) = P (B) P (B \ A) = P (B) = P (B) P (A). Suppose P (A) = 0. Then, 0 P (A B) P (A) = 0 and hence P (A B) = 0 = P (A) P (B). (b) If A is independent of itself, then P (A) = P (A A) = P (A) P (A) which implies P (A) is 0 or 1. (The solutions of x = x 2 are x = 0 or 1.) Problem 4. Suppose A B and A B. If P (A) = 1/3, find P (B). Because A B, we have P (A B) = P (A). The LHS of this equality can be factored into P (A)P (B) by the independence between A and B. Hence, P (A)P (B) = P (A). Because P (A) > 0, we can divide both sides of the equation by P (A) and get P (B) = 1. Problem 5. Show that if A and B are independent events, then so are A and B c, A c and B, and A c and B c. To show that two events C 1 and C 2 are independent, we need to show that P (C 1 C 2 ) = P (C 1 )P (C 2 ). 3-2

3 (a) Note that Because A P (A B c ) = P (A \ B) = P (A) P (A B). B, the last term can be factored in to P (A)P (B) and hence P (A B c ) = P (A) P (A)P (B) = P (A)(1 P (B)) = P (A)P (B c ) (b) By interchanging the role of A and B in the previous part, we have P (A c B) = P (B A c ) = P (B) P (A c ). (c) From set theory, we know that A c B c = (A B) c. Therefore, P (A c B c ) = 1 P (A B) = 1 P (A) P (B) + P (A B). Because A B, we have P (A c B c ) = 1 P (A) P (B) + P (A)P (B) = (1 P (A)) (1 P (B)) = P (A c )P (B c ). Remark: By interchanging the roles of A and A c and/or B and B c, it follows that if any one of the four pairs is independent, then so are the other three. [Gubner, 2006, p.31] Problem 6. Anne and Betty go fishing. Find the conditional probability that Anne catches no fish given that at least one of them catches no fish. Assume they catch fish independently and that each has probability 0 < p < 1 of catching no fish. Let A be the event that Anne catches no fish and B be the event that Betty catches no fish. From the question, we know that A and B are independent. The event at least one of the two women catches nothing can be represented by A B. So we have P (A A B) = P (A (A B)) P (A B) = P (A) P (A) + P (B) P (A) P (B) = p 2p p = p. [Gubner, 2006, Q2.62] Problem 7. In this question, each experiment has equiprobable outcomes. (a) Let Ω = {1, 2, 3, 4}, A 1 = {1, 2}, A 2 = {1, 3}, A 3 = {2, 3}. (i) Determine whether P (A i A j ) = P (A i ) P (A j ) for all i j. (ii) Check whether P (A 1 A 2 A 3 ) = P (A 1 ) P (A 2 ) P (A 3 ). 3-3

4 (iii) Are A 1, A 2, and A 3 independent? (b) Let Ω = {1, 2, 3, 4, 5, 6}, A 1 = {1, 2, 3, 4}, A 2 = A 3 = {4, 5, 6}. (i) Check whether P (A 1 A 2 A 3 ) = P (A 1 ) P (A 2 ) P (A 3 ). (ii) Check whether P (A i A j ) = P (A i ) P (A j ) for all i j. (iii) Are A 1, A 2, and A 3 independent? (a) We have P (A i ) = 1 2 and P (A i A j ) = 1 4. (i) P (A i A j ) = P (A i )P (A j ) for any i j. (ii) A 1 A 2 A 3 =. Hence, P (A 1 A 2 A 3 ) = 0, which is not the same as P (A 1 ) P (A 2 ) P (A 3 ). (iii) No. (b) We have P (A 1 ) = 4 6 = 2 3 and P (A 2) = P (A 3 ) = 3 6 = 1 2. (i) A 1 A 2 A 3 = {4}. Hence, P (A 1 A 2 A 3 ) = 1. 6 P (A 1 ) P (A 2 ) P (A 3 ) = = Hence, P (A 1 A 2 A 3 ) = P (A 1 ) P (A 2 ) P (A 3 ). (ii) P (A 2 A 3 ) = P (A 2 ) = 1 2 P (A 2)P (A 3 ) P (A 1 A 2 ) = p(4) = 1 6 P (A 1)P (A 2 ) P (A 1 A 3 ) = p(4) = 1 6 P (A 1)P (A 3 ) Hence, P (A i A j ) P (A i ) P (A j ) for all i j. (iii) No. Problem 8. Suppose A, B, and C are independent. Show that A Start with expressing B as a disjoint union B = (B C c ) (B C). Then, by intersecting both sides by A, we still have disjoint union: A B = (A B C c ) (A B C). (B C c ). Hence, P (A B) = P (A B C c ) + P (A B C). 3-4

5 Therefore, P (A B C c ) = P (A B) P (A B C). By the independence among A, B, and C, we have P (A B C c ) = P (A)P (B) P (A)P (B)P (C) = P (A) (P (B) P (B C)) = P (A)P (B C c ), where we use the independence property again to get the second-to-last equality. Remarks (a) It is now easy to show that A role of B and C. (B c C). Simply follow the same proof but switch the (b) One of the properties that follows from the fact that A, B, and C are independent is that A (B C). This follow easily from the definition: P (A (B C)) = P (A B C) = P (A) P (B) P (C) = P (A) P (B C). (c) A useful fact that we shall come back to later is that if A C 1, C 2,..., C n, then A n C i. To see this, note that A C i = (A C i ) where the union on the RHS is a disjoint union. Hence, ( ) n n P A C i = P (A C i ) = P (A) P (C i ) = P (A) C i for all disjoint events n P (C i ), where the second equality is obtained by applying the independence between A and C i. Now, applying the fact that the C i are disjoint, we finally get ( ) ( n ) P A C i = P (A) P C i ; that is A n C i. (d) Because we now know that A (B C c ), A conclude, using the previous remark, that A union of B C c, B c C, and B C. (e) Because A (B c C), and A (B C), we can (B C) because B C is a disjoint (B C), we know that A is independent of (B C) c which is B c C c. 3-5

6 (f) Observe that any event involving only B and C will be a union of one or more of B C c, B c C, B C, and B c C c. Because these four event are disjoint and we have shown that A is independent of all these four events, it follow from fact (c) above that A is independent of any event that involves only B and C. Formally, we say that A is independent of any event generated by B and C. Problem 9. Suppose {A} {B 1, B 2, B 1 B 2 }. Show that (a) A (b) A B c 1 B c 2 (c) A c B 1 (d) A (e) A B 1 B c 2 B c 1 B 2 (f) A (B 1 B 2 ) Remark: The question does not say that B 1 B 2. (a) The independence between the two collections gives A result from the previous question to show that A B1. c (b) The independence between the two collections gives A result from the previous question to show that A B2. c (c) The independence between the two collections gives A result from the previous question to show that A c B 1. B 1. B 2. B 1. We can then use the We can then use the We can then use the (d) Note that P (A B 1 B c 2) = P ((A B 1 ) \B 2 ) = P (A B 1 ) P (A B 1 B 2 ) = P (A) P (B 1 ) P (A) P (B 1 B 2 ), where we apply the given conditions that A B 1 and A (B 1 B 2 ). Therefore, P (A B 1 B c 2) = P (A) (P (B 1 ) P (B 1 B 2 )) = P (A) P (B 1 \ B 2 ) = P (A) P (B 1 B c 2). (e) This follows from the previous part by interchanging the role of B 1 and B

7 (f) We first express B 1 B 2 as B 1 B 2 = (B 1 B c 2) (B 1 B 2 ) (B c 1 B 2 ). Note that we have a disjoint union. Observe that we still have disjoint union when we expand A (B 1 B 2 ) as Hence, Remarks: A (B 1 B 2 ) = (A B 1 B c 2) (A B 1 B 2 ) (A B c 1 B 2 ). P (A (B 1 B 2 )) = P (A B 1 B c 2) + P (A B 1 B 2 ) + P (A B c 1 B 2 ). Using the results from the previous parts, we have P (A (B 1 B 2 )) = P (A) P (B 1 B c 2) + P (A) P (B 1 B 2 ) + P (A) P (B c 1 B 2 ) = P (A) (P (B 1 B c 2) + P (B 1 B 2 ) + P (B c 1 B 2 )) = P (A) P (B 1 B 2 ) Observe that the last part can be replaced by applying the fact, which we proved earlier, that if A C i for all disjoint events C 1, C 2,..., C n, then A n C i. (a) Because A (B 1 B 2 ), we know that A is independent of (B 1 B 2 ) c which is B c 1 B c 2. (b) Observe that any event involving only B 1 and B 2 will be a union of one or more of B 1 B c 2, B c 1 B 2, B 1 B 2, and B c 1 B c 2. Because these four event are disjoint and we have shown that A is independent of all these four events, it follow that A is independent of any event that involves only B 1 and B 2. Formally, we say that A is independent of any event generated by B 1 and B 2. Problem 10. A certain binary communication system has a bit-error rate of 0.1; i.e., in transmitting a single bit, the probability of receiving the bit in error is 0.1. To transmit messages, a three-bit repetition code is used. In other words, to send the message 1, 111 is transmitted, and to send the message 0, 000 is transmitted. At the receiver, if two or more 1s are received, the decoder decides that message 1 was sent; otherwise, i.e., if two or more zeros are received, it decides that message 0 was sent. Assuming bit errors occur independently, find the probability that the decoder puts out the wrong message. Let p = 0.1 be the bit error rate. Error event E occurs if there are at least two bit errors. Therefore ( ) ( ) 3 3 P (E) = p 2 (1 p) + p 3 = p 2 (3 2p). 2 3 When p = 0.1, P (E) [Gubner, 2006, Q2.62] 3-7

HW Solution 2 Due: July 10:39AM

HW Solution 2 Due: July 10:39AM ECS 35: Probability and Random Processes 200/ HW Solution 2 Due: July 9 @ 0:39AM Lecturer: Prapun Suksompong, Ph.D. Instructions (a) A part of ONE question will be graded. Of course, you do not know which

More information

HW Solution 3 Due: Sep 11

HW Solution 3 Due: Sep 11 ECS 35: Probability and Random Processes 204/ HW Solution 3 Due: Sep Lecturer: Prapun Suksompong, PhD Instructions (a) ONE part of a question will be graded (5 pt) Of course, you do not know which part

More information

HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session)

HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session) .qxd 1/7/10 9:45 AM Page 28 ECS 315: Probability and Random Processes 2015/1 HW Solution 1 Due: Aug 26, 9:19 AM (in tutorial session) APTER 2 PROBABILITY Lecturer: Prapun Suksompong, Ph.D. S FOR SECTION

More information

Chapter 1: Introduction to Probability Theory

Chapter 1: Introduction to Probability Theory ECE5: Stochastic Signals and Systems Fall 8 Lecture - September 6, 8 Prof. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter : Introduction to Probability Theory Axioms of Probability

More information

HW Solution 1 Due: February 1

HW Solution 1 Due: February 1 .qxd 1/7/10 9:45 AM Page 28 APTER 2 PROBABILITY IES 302: Engineering Statistics 2011/2 HW Solution 1 Due: February 1 Lecturer: Prapun Suksompong, Ph.D. S FOR SECTION 2-1 2-18. In a magnetic storage device,

More information

Exam 1. Problem 1: True or false

Exam 1. Problem 1: True or false Exam 1 Problem 1: True or false We are told that events A and B are conditionally independent, given a third event C, and that P(B C) > 0. For each one of the following statements, decide whether the statement

More information

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018

Mathematical Foundations of Computer Science Lecture Outline October 18, 2018 Mathematical Foundations of Computer Science Lecture Outline October 18, 2018 The Total Probability Theorem. Consider events E and F. Consider a sample point ω E. Observe that ω belongs to either F or

More information

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7

ECS 332: Principles of Communications 2012/1. HW 4 Due: Sep 7 ECS 332: Principles of Communications 2012/1 HW 4 Due: Sep 7 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which part will

More information

Conditional Probability

Conditional Probability Conditional Probability When we obtain additional information about a probability experiment, we want to use the additional information to reassess the probabilities of events given the new information.

More information

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events

Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Lecture 8: Conditional probability I: definition, independence, the tree method, sampling, chain rule for independent events Discrete Structures II (Summer 2018) Rutgers University Instructor: Abhishek

More information

ECS 452: Digital Communication Systems 2015/2. HW 1 Due: Feb 5

ECS 452: Digital Communication Systems 2015/2. HW 1 Due: Feb 5 ECS 452: Digital Communication Systems 2015/2 HW 1 Due: Feb 5 Lecturer: Asst. Prof. Dr. Prapun Suksompong Instructions (a) Must solve all non-optional problems. (5 pt) (i) Write your first name and the

More information

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio

4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio 4 Lecture 4 Notes: Introduction to Probability. Probability Rules. Independence and Conditional Probability. Bayes Theorem. Risk and Odds Ratio Wrong is right. Thelonious Monk 4.1 Three Definitions of

More information

Discrete Random Variable

Discrete Random Variable Discrete Random Variable Outcome of a random experiment need not to be a number. We are generally interested in some measurement or numerical attribute of the outcome, rather than the outcome itself. n

More information

ECE Homework Set 2

ECE Homework Set 2 1 Solve these problems after Lecture #4: Homework Set 2 1. Two dice are tossed; let X be the sum of the numbers appearing. a. Graph the CDF, FX(x), and the pdf, fx(x). b. Use the CDF to find: Pr(7 X 9).

More information

Vina Nguyen HSSP July 6, 2008

Vina Nguyen HSSP July 6, 2008 Vina Nguyen HSSP July 6, 2008 1 Late registration Claroline class server 2 What are the two types of probability? 3 What are the two types of probability? What is a set? 4 What are the two types of probability?

More information

Chapter 5 : Probability. Exercise Sheet. SHilal. 1 P a g e

Chapter 5 : Probability. Exercise Sheet. SHilal. 1 P a g e 1 P a g e experiment ( observing / measuring ) outcomes = results sample space = set of all outcomes events = subset of outcomes If we collect all outcomes we are forming a sample space If we collect some

More information

Assignment 9. Due: July 14, 2017 Instructor: Dr. Mustafa El-Halabi. ! A i. P (A c i ) i=1

Assignment 9. Due: July 14, 2017 Instructor: Dr. Mustafa El-Halabi. ! A i. P (A c i ) i=1 CCE 40: Communication Systems Summer 206-207 Assignment 9 Due: July 4, 207 Instructor: Dr. Mustafa El-Halabi Instructions: You are strongly encouraged to type out your solutions using mathematical mode

More information

Probabilistic models

Probabilistic models Kolmogorov (Andrei Nikolaevich, 1903 1987) put forward an axiomatic system for probability theory. Foundations of the Calculus of Probabilities, published in 1933, immediately became the definitive formulation

More information

EE 229B ERROR CONTROL CODING Spring 2005

EE 229B ERROR CONTROL CODING Spring 2005 EE 229B ERROR CONTROL CODING Spring 2005 Solutions for Homework 1 1. Is there room? Prove or disprove : There is a (12,7) binary linear code with d min = 5. If there were a (12,7) binary linear code with

More information

Properties of Probability

Properties of Probability Econ 325 Notes on Probability 1 By Hiro Kasahara Properties of Probability In statistics, we consider random experiments, experiments for which the outcome is random, i.e., cannot be predicted with certainty.

More information

P (E) = P (A 1 )P (A 2 )... P (A n ).

P (E) = P (A 1 )P (A 2 )... P (A n ). Lecture 9: Conditional probability II: breaking complex events into smaller events, methods to solve probability problems, Bayes rule, law of total probability, Bayes theorem Discrete Structures II (Summer

More information

HW Solution 12 Due: Dec 2, 9:19 AM

HW Solution 12 Due: Dec 2, 9:19 AM ECS 315: Probability and Random Processes 2015/1 HW Solution 12 Due: Dec 2, 9:19 AM Lecturer: Prapun Suksompong, Ph.D. Problem 1. Let X E(3). (a) For each of the following function g(x). Indicate whether

More information

Lecture 3 Probability Basics

Lecture 3 Probability Basics Lecture 3 Probability Basics Thais Paiva STA 111 - Summer 2013 Term II July 3, 2013 Lecture Plan 1 Definitions of probability 2 Rules of probability 3 Conditional probability What is Probability? Probability

More information

Sample Exam #1 Probability and Statistics I

Sample Exam #1 Probability and Statistics I Sample Exam # Probability and Statistics I Instructions. Show all work. No need to simplify answers.. 0 points Jack and Jill, along with four other students chosen from the same class of ten students,

More information

SDS 321: Introduction to Probability and Statistics

SDS 321: Introduction to Probability and Statistics SDS 321: Introduction to Probability and Statistics Lecture 2: Conditional probability Purnamrita Sarkar Department of Statistics and Data Science The University of Texas at Austin www.cs.cmu.edu/ psarkar/teaching

More information

Test One Mathematics Fall 2009

Test One Mathematics Fall 2009 Test One Mathematics 35.2 Fall 29 TO GET FULL CREDIT YOU MUST SHOW ALL WORK! I have neither given nor received aid in the completion of this test. Signature: pts. 2 pts. 3 5 pts. 2 pts. 5 pts. 6(i) pts.

More information

EE376A: Homework #3 Due by 11:59pm Saturday, February 10th, 2018

EE376A: Homework #3 Due by 11:59pm Saturday, February 10th, 2018 Please submit the solutions on Gradescope. EE376A: Homework #3 Due by 11:59pm Saturday, February 10th, 2018 1. Optimal codeword lengths. Although the codeword lengths of an optimal variable length code

More information

Statistics 100A Homework 1 Solutions

Statistics 100A Homework 1 Solutions Problem Statistics 00A Homework Solutions Ryan Rosario Suppose we flip a fair coin 4 times independently. () What is the sample space? By definition, the sample space, denoted as Ω, is the set of all possible

More information

Lecture 1: An introduction to probability theory

Lecture 1: An introduction to probability theory Econ 514: Probability and Statistics Lecture 1: An introduction to probability theory Random Experiments Random experiment: Experiment/phenomenon/action/mechanism with outcome that is not (fully) predictable.

More information

The probability of an event is viewed as a numerical measure of the chance that the event will occur.

The probability of an event is viewed as a numerical measure of the chance that the event will occur. Chapter 5 This chapter introduces probability to quantify randomness. Section 5.1: How Can Probability Quantify Randomness? The probability of an event is viewed as a numerical measure of the chance that

More information

Lecture 3. January 7, () Lecture 3 January 7, / 35

Lecture 3. January 7, () Lecture 3 January 7, / 35 Lecture 3 January 7, 2013 () Lecture 3 January 7, 2013 1 / 35 Outline This week s lecture: Fast review of last week s lecture: Conditional probability. Partition, Partition theorem. Bayes theorem and its

More information

Math 3338: Probability (Fall 2006)

Math 3338: Probability (Fall 2006) Math 3338: Probability (Fall 2006) Jiwen He Section Number: 10853 http://math.uh.edu/ jiwenhe/math3338fall06.html Probability p.1/8 2.2 Axioms, Interpretations, and Properties of Probability Probability

More information

Midterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You:

Midterm 2. Your Exam Room: Name of Person Sitting on Your Left: Name of Person Sitting on Your Right: Name of Person Sitting in Front of You: CS70 Discrete Mathematics and Probability Theory, Fall 2018 Midterm 2 8:00-10:00pm, 31 October Your First Name: SIGN Your Name: Your Last Name: Your SID Number: Your Exam Room: Name of Person Sitting on

More information

1 Variance of a Random Variable

1 Variance of a Random Variable Indian Institute of Technology Bombay Department of Electrical Engineering Handout 14 EE 325 Probability and Random Processes Lecture Notes 9 August 28, 2014 1 Variance of a Random Variable The expectation

More information

Deep Learning for Computer Vision

Deep Learning for Computer Vision Deep Learning for Computer Vision Lecture 3: Probability, Bayes Theorem, and Bayes Classification Peter Belhumeur Computer Science Columbia University Probability Should you play this game? Game: A fair

More information

Intro to Contemporary Math

Intro to Contemporary Math Intro to Contemporary Math Unions and Intersections of Intervals Department of Mathematics UK Announcement You have a homework assignment due next Monday. Mini-exam 2 is next Wednesday. Unions and Intersections

More information

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 7E Probability and Statistics Spring 6 Instructor : Class Meets : Office Hours : Textbook : İlker Bayram EEB 3 ibayram@itu.edu.tr 3.3 6.3, Wednesday EEB 6.., Monday D. B. Bertsekas, J. N. Tsitsiklis,

More information

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability

Lecture Notes 1 Basic Probability. Elements of Probability. Conditional probability. Sequential Calculation of Probability Lecture Notes 1 Basic Probability Set Theory Elements of Probability Conditional probability Sequential Calculation of Probability Total Probability and Bayes Rule Independence Counting EE 178/278A: Basic

More information

Probabilistic models

Probabilistic models Probabilistic models Kolmogorov (Andrei Nikolaevich, 1903 1987) put forward an axiomatic system for probability theory. Foundations of the Calculus of Probabilities, published in 1933, immediately became

More information

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events

LECTURE 1. 1 Introduction. 1.1 Sample spaces and events LECTURE 1 1 Introduction The first part of our adventure is a highly selective review of probability theory, focusing especially on things that are most useful in statistics. 1.1 Sample spaces and events

More information

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding Homework Set # Rates definitions, Channel Coding, Source-Channel coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits

More information

ECE353: Probability and Random Processes. Lecture 2 - Set Theory

ECE353: Probability and Random Processes. Lecture 2 - Set Theory ECE353: Probability and Random Processes Lecture 2 - Set Theory Xiao Fu School of Electrical Engineering and Computer Science Oregon State University E-mail: xiao.fu@oregonstate.edu January 10, 2018 Set

More information

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing Lecture 7 Agenda for the lecture M-ary hypothesis testing and the MAP rule Union bound for reducing M-ary to binary hypothesis testing Introduction of the channel coding problem 7.1 M-ary hypothesis testing

More information

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics?

Lecture 1. Chapter 1. (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 ( ). 1. What is Statistics? Lecture 1 (Part I) Material Covered in This Lecture: Chapter 1, Chapter 2 (2.1 --- 2.6). Chapter 1 1. What is Statistics? 2. Two definitions. (1). Population (2). Sample 3. The objective of statistics.

More information

Sum and Product Rules

Sum and Product Rules Sum and Product Rules Exercise. Consider tossing a coin five times. What is the probability of getting the same result on the first two tosses or the last two tosses? Solution. Let E be the event that

More information

Chapter 01: Probability Theory (Cont d)

Chapter 01: Probability Theory (Cont d) Chapter 01: Probability Theory (Cont d) Section 1.5: Probabilities of Event Intersections Problem (01): When a company receives an order, there is a probability of 0.42 that its value is over $1000. If

More information

6.3 Bernoulli Trials Example Consider the following random experiments

6.3 Bernoulli Trials Example Consider the following random experiments 6.3 Bernoulli Trials Example 6.48. Consider the following random experiments (a) Flip a coin times. We are interested in the number of heads obtained. (b) Of all bits transmitted through a digital transmission

More information

CMPSCI 240: Reasoning about Uncertainty

CMPSCI 240: Reasoning about Uncertainty CMPSCI 240: Reasoning about Uncertainty Lecture 2: Sets and Events Andrew McGregor University of Massachusetts Last Compiled: January 27, 2017 Outline 1 Recap 2 Experiments and Events 3 Probabilistic Models

More information

ECE 302: Chapter 02 Probability Model

ECE 302: Chapter 02 Probability Model ECE 302: Chapter 02 Probability Model Fall 2018 Prof Stanley Chan School of Electrical and Computer Engineering Purdue University 1 / 35 1. Probability Model 2 / 35 What is Probability? It is a number.

More information

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.

Example: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p. Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell

More information

HW Solution 5 Due: Sep 13

HW Solution 5 Due: Sep 13 ECS 315: Probability and Random Processes 01/1 HW Solution 5 Due: Sep 13 Lecturer: Prapun Suksompong, Ph.D. Instructions (a) ONE part of a question will be graded (5 pt). Of course, you do not know which

More information

MATH 3C: MIDTERM 1 REVIEW. 1. Counting

MATH 3C: MIDTERM 1 REVIEW. 1. Counting MATH 3C: MIDTERM REVIEW JOE HUGHES. Counting. Imagine that a sports betting pool is run in the following way: there are 20 teams, 2 weeks, and each week you pick a team to win. However, you can t pick

More information

EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final

EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final EECS 70 Discrete Mathematics and Probability Theory Fall 2015 Walrand/Rao Final PRINT Your Name:, (last) SIGN Your Name: (first) PRINT Your Student ID: CIRCLE your exam room: 220 Hearst 230 Hearst 237

More information

Previous Exam Questions, Chapter 2

Previous Exam Questions, Chapter 2 ECE 302: Probabilistic Methods in Electrical and Computer Engineering Instructor: Prof. A. R. Reibman Previous Exam Questions, Chapter 2 Reibman (compiled September 2018) These form a collection of 36

More information

Lecture 1. ABC of Probability

Lecture 1. ABC of Probability Math 408 - Mathematical Statistics Lecture 1. ABC of Probability January 16, 2013 Konstantin Zuev (USC) Math 408, Lecture 1 January 16, 2013 1 / 9 Agenda Sample Spaces Realizations, Events Axioms of Probability

More information

ORF 245 Fundamentals of Statistics Chapter 5 Probability

ORF 245 Fundamentals of Statistics Chapter 5 Probability ORF 245 Fundamentals of Statistics Chapter 5 Probability Robert Vanderbei Oct 2015 Slides last edited on October 14, 2015 http://www.princeton.edu/ rvdb Sample Spaces (aka Populations) and Events When

More information

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B).

P (A B) P ((B C) A) P (B A) = P (B A) + P (C A) P (A) = P (B A) + P (C A) = Q(A) + Q(B). Lectures 7-8 jacques@ucsdedu 41 Conditional Probability Let (Ω, F, P ) be a probability space Suppose that we have prior information which leads us to conclude that an event A F occurs Based on this information,

More information

Answers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics

Answers and Solutions to (Even Numbered) Suggested Exercises in Sections of Grimaldi s Discrete and Combinatorial Mathematics Answers and Solutions to (Even Numbered) Suggested Exercises in Sections 6.5-6.9 of Grimaldi s Discrete and Combinatorial Mathematics Section 6.5 6.5.2. a. r = = + = c + e. So the error pattern is e =.

More information

CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam

CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam February 13, 2013. Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Giving more

More information

1 Preliminaries Sample Space and Events Interpretation of Probability... 13

1 Preliminaries Sample Space and Events Interpretation of Probability... 13 Summer 2017 UAkron Dept. of Stats [3470 : 461/561] Applied Statistics Ch 2: Probability Contents 1 Preliminaries 3 1.1 Sample Space and Events...........................................................

More information

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39

Entropy. Probability and Computing. Presentation 22. Probability and Computing Presentation 22 Entropy 1/39 Entropy Probability and Computing Presentation 22 Probability and Computing Presentation 22 Entropy 1/39 Introduction Why randomness and information are related? An event that is almost certain to occur

More information

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2013 Vazirani Note 12. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 203 Vazirani Note 2 Random Variables: Distribution and Expectation We will now return once again to the question of how many heads in a typical sequence

More information

Lecture 2: Probability. Readings: Sections Statistical Inference: drawing conclusions about the population based on a sample

Lecture 2: Probability. Readings: Sections Statistical Inference: drawing conclusions about the population based on a sample Lecture 2: Probability Readings: Sections 5.1-5.3 1 Introduction Statistical Inference: drawing conclusions about the population based on a sample Parameter: a number that describes the population a fixed

More information

Conditional Probability

Conditional Probability Chapter 3 Conditional Probability 3.1 Definition of conditional probability In spite of our misgivings, let us persist with the frequency definition of probability. Consider an experiment conducted N times

More information

Probability Theory Review

Probability Theory Review Cogsci 118A: Natural Computation I Lecture 2 (01/07/10) Lecturer: Angela Yu Probability Theory Review Scribe: Joseph Schilz Lecture Summary 1. Set theory: terms and operators In this section, we provide

More information

= 2 5 Note how we need to be somewhat careful with how we define the total number of outcomes in b) and d). We will return to this later.

= 2 5 Note how we need to be somewhat careful with how we define the total number of outcomes in b) and d). We will return to this later. PROBABILITY MATH CIRCLE (ADVANCED /27/203 The likelyhood of something (usually called an event happening is called the probability. Probability (informal: We can calculate probability using a ratio: want

More information

HW 13 Due: Dec 6, 5 PM

HW 13 Due: Dec 6, 5 PM ECS 315: Probability and Random Processes 2016/1 HW 13 Due: Dec 6, 5 PM Lecturer: Prapun Suksompong, Ph.D. Instructions (a) This assignment has 8 pages. (b) (1 pt) Write your first name and the last three

More information

Shannon s noisy-channel theorem

Shannon s noisy-channel theorem Shannon s noisy-channel theorem Information theory Amon Elders Korteweg de Vries Institute for Mathematics University of Amsterdam. Tuesday, 26th of Januari Amon Elders (Korteweg de Vries Institute for

More information

Theoretical Cryptography, Lectures 18-20

Theoretical Cryptography, Lectures 18-20 Theoretical Cryptography, Lectures 18-20 Instructor: Manuel Blum Scribes: Ryan Williams and Yinmeng Zhang March 29, 2006 1 Content of the Lectures These lectures will cover how someone can prove in zero-knowledge

More information

Midterm Exam 1 Solution

Midterm Exam 1 Solution EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2015 Kannan Ramchandran September 22, 2015 Midterm Exam 1 Solution Last name First name SID Name of student on your left:

More information

University of Illinois ECE 313: Final Exam Fall 2014

University of Illinois ECE 313: Final Exam Fall 2014 University of Illinois ECE 313: Final Exam Fall 2014 Monday, December 15, 2014, 7:00 p.m. 10:00 p.m. Sect. B, names A-O, 1013 ECE, names P-Z, 1015 ECE; Section C, names A-L, 1015 ECE; all others 112 Gregory

More information

Entanglement and information

Entanglement and information Ph95a lecture notes for 0/29/0 Entanglement and information Lately we ve spent a lot of time examining properties of entangled states such as ab è 2 0 a b è Ý a 0 b è. We have learned that they exhibit

More information

Discrete Random Variables. Discrete Random Variables

Discrete Random Variables. Discrete Random Variables Random Variables In many situations, we are interested in numbers associated with the outcomes of a random experiment. For example: Testing cars from a production line, we are interested in variables such

More information

ECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220

ECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220 ECE 564/645 - Digital Communications, Spring 08 Midterm Exam # March nd, 7:00-9:00pm Marston 0 Overview The exam consists of four problems for 0 points (ECE 564) or 5 points (ECE 645). The points for each

More information

ECE 302: Probabilistic Methods in Electrical Engineering

ECE 302: Probabilistic Methods in Electrical Engineering ECE 302: Probabilistic Methods in Electrical Engineering Test I : Chapters 1 3 3/22/04, 7:30 PM Print Name: Read every question carefully and solve each problem in a legible and ordered manner. Make sure

More information

ECE 302 Solution to Homework Assignment 4

ECE 302 Solution to Homework Assignment 4 ECE 302 Solution to Assignment 4 February 19, 2007 1 ECE 302 Solution to Homework Assignment 4 Note: To obtain credit for an answer, you must provide adequate justification. Also, if it is possible to

More information

MA : Introductory Probability

MA : Introductory Probability MA 320-001: Introductory Probability David Murrugarra Department of Mathematics, University of Kentucky http://www.math.uky.edu/~dmu228/ma320/ Spring 2017 David Murrugarra (University of Kentucky) MA 320:

More information

CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam

CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam CMPSCI 240: Reasoning Under Uncertainty First Midterm Exam February 1, 201. Start 7:00pm. End 9:00pm. Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each

More information

the time it takes until a radioactive substance undergoes a decay

the time it takes until a radioactive substance undergoes a decay 1 Probabilities 1.1 Experiments with randomness Wewillusethetermexperimentinaverygeneralwaytorefertosomeprocess that produces a random outcome. Examples: (Ask class for some first) Here are some discrete

More information

Probability: Part 1 Naima Hammoud

Probability: Part 1 Naima Hammoud Probability: Part 1 Naima ammoud Feb 7, 2017 Motivation ossing a coin Rolling a die Outcomes: eads or ails Outcomes: 1, 2, 3, 4, 5 or 6 Defining Probability If I toss a coin, there is a 50% chance I will

More information

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)

ECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture) ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling

More information

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities

CS 441 Discrete Mathematics for CS Lecture 19. Probabilities. CS 441 Discrete mathematics for CS. Probabilities CS 441 Discrete Mathematics for CS Lecture 19 Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Experiment: a procedure that yields one of the possible outcomes Sample space: a set of possible outcomes

More information

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom

Probability: Terminology and Examples Class 2, Jeremy Orloff and Jonathan Bloom 1 Learning Goals Probability: Terminology and Examples Class 2, 18.05 Jeremy Orloff and Jonathan Bloom 1. Know the definitions of sample space, event and probability function. 2. Be able to organize a

More information

ORF 245 Fundamentals of Statistics Chapter 1 Probability

ORF 245 Fundamentals of Statistics Chapter 1 Probability ORF 245 Fundamentals of Statistics Chapter 1 Probability Robert Vanderbei Sept 2014 Slides last edited on September 19, 2014 http://www.princeton.edu/ rvdb Course Info Prereqs: Textbook: Three semesters

More information

Information and Entropy. Professor Kevin Gold

Information and Entropy. Professor Kevin Gold Information and Entropy Professor Kevin Gold What s Information? Informally, when I communicate a message to you, that s information. Your grade is 100/100 Information can be encoded as a signal. Words

More information

1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao

1 True/False. Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao Math 10B with Professor Stankova Worksheet, Discussion #9; Thursday, 2/15/2018 GSI name: Roy Zhao 1 True/False 1. True False When we solve a problem one way, it is not useful to try to solve it in a second

More information

Lecture Lecture 5

Lecture Lecture 5 Lecture 4 --- Lecture 5 A. Basic Concepts (4.1-4.2) 1. Experiment: A process of observing a phenomenon that has variation in its outcome. Examples: (E1). Rolling a die, (E2). Drawing a card form a shuffled

More information

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Spring 2016 Rao and Walrand Note 16. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Spring 206 Rao and Walrand Note 6 Random Variables: Distribution and Expectation Example: Coin Flips Recall our setup of a probabilistic experiment as

More information

4. Probability of an event A for equally likely outcomes:

4. Probability of an event A for equally likely outcomes: University of California, Los Angeles Department of Statistics Statistics 110A Instructor: Nicolas Christou Probability Probability: A measure of the chance that something will occur. 1. Random experiment:

More information

Recitation 2: Probability

Recitation 2: Probability Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions

More information

CSC Discrete Math I, Spring Discrete Probability

CSC Discrete Math I, Spring Discrete Probability CSC 125 - Discrete Math I, Spring 2017 Discrete Probability Probability of an Event Pierre-Simon Laplace s classical theory of probability: Definition of terms: An experiment is a procedure that yields

More information

With Question/Answer Animations. Chapter 7

With Question/Answer Animations. Chapter 7 With Question/Answer Animations Chapter 7 Chapter Summary Introduction to Discrete Probability Probability Theory Bayes Theorem Section 7.1 Section Summary Finite Probability Probabilities of Complements

More information

University of California, Berkeley, Statistics 134: Concepts of Probability. Michael Lugo, Spring Exam 1

University of California, Berkeley, Statistics 134: Concepts of Probability. Michael Lugo, Spring Exam 1 University of California, Berkeley, Statistics 134: Concepts of Probability Michael Lugo, Spring 2011 Exam 1 February 16, 2011, 11:10 am - 12:00 noon Name: Solutions Student ID: This exam consists of seven

More information

Solutions to Homework Set #3 Channel and Source coding

Solutions to Homework Set #3 Channel and Source coding Solutions to Homework Set #3 Channel and Source coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits per channel use)

More information

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 71E Probability and Statistics Spring 013 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 1.30, Wednesday EEB 5303 10.00 1.00, Wednesday

More information

COS 341: Discrete Mathematics

COS 341: Discrete Mathematics COS 341: Discrete Mathematics Midterm Exam Fall 2006 Print your name General directions: This exam is due on Monday, November 13 at 4:30pm. Late exams will not be accepted. Exams must be submitted in hard

More information

CS70: Jean Walrand: Lecture 15b.

CS70: Jean Walrand: Lecture 15b. CS70: Jean Walrand: Lecture 15b. Modeling Uncertainty: Probability Space 1. Key Points 2. Random Experiments 3. Probability Space Key Points Uncertainty does not mean nothing is known How to best make

More information

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation

Discrete Mathematics and Probability Theory Fall 2012 Vazirani Note 14. Random Variables: Distribution and Expectation CS 70 Discrete Mathematics and Probability Theory Fall 202 Vazirani Note 4 Random Variables: Distribution and Expectation Random Variables Question: The homeworks of 20 students are collected in, randomly

More information

Digital Circuits ECS 371

Digital Circuits ECS 371 Digital Circuits ECS 371 Dr. Prapun Suksompong prapun@siit.tu.ac.th Lecture 18 Office Hours: BKD 3601-7 Monday 9:00-10:30, 1:30-3:30 Tuesday 10:30-11:30 1 Announcement Reading Assignment: Chapter 7: 7-1,

More information

2.4 Conditional Probability

2.4 Conditional Probability 2.4 Conditional Probability The probabilities assigned to various events depend on what is known about the experimental situation when the assignment is made. Example: Suppose a pair of dice is tossed.

More information