ECE 313: Conflict Final Exam Tuesday, May 13, 2014, 7:00 p.m. 10:00 p.m. Room 241 Everitt Lab

Size: px
Start display at page:

Download "ECE 313: Conflict Final Exam Tuesday, May 13, 2014, 7:00 p.m. 10:00 p.m. Room 241 Everitt Lab"

Transcription

1 University of Illinois Spring 1 ECE 313: Conflict Final Exam Tuesday, May 13, 1, 7: p.m. 1: p.m. Room 1 Everitt Lab 1. [18 points] Consider an experiment in which a fair coin is repeatedly tossed every ten seconds, with the first toss happening ten seconds after time zero. Assume the tosses are independent. (a) ( points) Associated to the k th toss, define a random variable X k that takes the value 1 if the outcome is heads and otherwise. What is the pmf of X k? The distribution of X k is Bernoulli with p =.5, so p xk () = p xk (1) =.5. (b) ( points) What is the name of the random process defined by the infinite sequence of random variables X 1, X,...? The sequence X 1, X,... is a Bernoulli process. (c) (6 points) Find the pmf for the total number of heads that appear in the first 1 minutes. In the first ten minutes, there will be (6 tosses/min) (1 min) = 6 tosses. Let C 6 denote the number of heads that appear in 6 tosses; then C 6 is binomially distributed with pmf p C6 (k) = ( ) 6 k (.5) k (.5) 6 k = ( ) 6 k (.5) 6, k 6. (d) (6 points) Find the pmf for the time it takes until a heads shows for the first time. Since the tosses are conducted every 1 s, the time elapsed until a heads shows up for the first time is T 1 = 1 L 1 [s], where L 1 is a geometric random variable with parameter p =.5. Thus, p T1 (1k) = (.5) k, k = 1,,..... [ points] Let T 1 and T denote two independent exponential random variables with the same parameter, λ. (a) (6 points) Find the pdf of T t = T 1 + T. Since T 1 and T are independent, we can use the convolution formula; thus, f Tt (t) = t λ e λu e λ(t u) du = t λ e λt du = λ te λt ALTERNATIVELY, the sum of r independent exponentially distributed random variables with parameter r has the Erlang distribution with parameters r and λ. The Erlang distribution for r = has pdf λ te λt for t. (b) (6 points) Find the pdf of T s = min{t 1, T }. First we will find the CDF of T s and then we will differentiate to obtain the pdf. From the definition of CDF, we have that F Ts (t) = P {T s t} = P {min{t 1, T } t} = 1 P {min{t 1, T } > t} = 1 P ({T 1 > T } {T > t}) = 1 P {T 1 > t}p {T > t} (by independence of T 1 and T ) = 1 e λt e λt = 1 e λt Differentiating yields f Ts (t) = λe λt for t. That is, T s has the exponential distribution with parameter λ. (c) (6 points) Find the pdf of T p = max{t 1, T }. Similarly to part (b) above, first we will find the CDF of T p and then will differentiate to find its pdf. Again, from the definition of CDF, we have that F Tp (t) = P (T p t) = P (max{t 1, T } t) = P ({{T 1 T } {T t}}). Then, from independence, we have that P ({{T 1 T } {T t}}) = P (T 1 T )P (T t) = (1 e λt )(1 e λt ) = 1 e λt + e λt. Finally, by differentiating, we obtain that f Tp (t) = λ(e λt e λt ).

2 (d) (6 points) Without doing any calculation, determine which is larger, E[T s ] or E[T p ]. Explain your reasoning. Let D = T p T s, so that T p = T s + D. Then P {D > } = 1, because the minimum of two numbers is less than the maximum. So E[D] >. Therefore, E[T p ] = E[T s ] + E[D] > E[T s ]. 3. [ points] At a tennis tournament, Serena is up against an opponent who she never met before. The match is best of five sets, where the one who first wins three sets is the winner. There are three equally likely scenarios for Serena: She is a stronger player and she wins each set with probability 3/. She is a weaker player and she wins each set with probability 1/. She is equally good as her opponent and she wins each set with probability 1/. Given which scenario holds, the outcomes of the sets are mutually independent. (a) (6 points) What is the probability the match ends in three straight sets? P {W W W } = P {LLL} = 1/3 ((1/) 3 + (3/) 3 + (1/) 3 ) = 3/16. So the probability the match ends in three sets is P {W W W, LLL} = 3/8. (b) (6 points) What is the probability Serena loses the match? 1/ by symmetry. (c) (6 points) It turns out that Serena lost the match by 1-3. What was the probability for that to happen? P (lost 1-3) = P {W LLL, LW LL, LLW L} = 3P {W LLL} = ((1/) 3 (3/) + (3/) 3 (1/) + (1/) ) = = 6 56 = 3 18 (d) (6 points) After the match Serena decides to reevaluate herself. Given that she lost by 1-3, what is the conditional probability Serena is a stronger player than her opponent? = [ points] Suppose (X, Y ) is uniformly distributed within the triangular region {(u, v) : v u 1}, i.e., { v u 1 f XY (u, v) = else (a) (6 points) Are X and Y independent? Explain your answer. No, the support of f X,Y is not a product set. (b) (6 points) Suppose we want to estimate Y from X in the way that minimizes the meansquare error (MSE). Find the best unconstrained estimator g (X) and the corresponding MSE. Conditioned on X = u, Y is uniformly distributed on [, u]. Therefore g (u) = E[Y X = u] = u/. The MMSE is E[(Y g (X)) ] = E[Y ] E[g (X) ], where E[Y ] = 1 (1 v)v dv = 1 6, E[X ] = 1 uu du = 1. So MMSE = E[Y ] E[X ]/ = 1.

3 (c) (6 points) Find the best linear estimator L (X) and the corresponding MSE. Since g is linear, it is also the best linear estimator. Therefore L coincides with g and the MSE is also 1. Alternatively, we could use the formulas for L and for the associated MSE. (d) (6 points) Find the correlation coefficient ρ X,Y. By symmetry, σ X = σ Y. And by the general formula, L (X) = µ Y + ρ X,Y σ Y σ X (X µ X ), whereas L (X) = X. Matching the slopes of these two expressions for L yields ρ X,Y = 1/. ALTERNATIVELY, we can calculate Cov(X, Y ), Var(X), and Var(Y ) (which is equal to Var(X)) and use the definition of ρ X,Y. 5. [18 points] Consider a vehicle traveling along a straight road in the direction of increasing mile markers. Suppose that at time zero, the location of the vehicle U is uniformly distributed between zero and one (i.e. between mile marker zero and mile marker one), and suppose the speed of the vehicle V is a constant over time, which is exponentially distributed with parameter λ >, and is independent of U. Thus, the location of the vehicle as a function of time t (measured in hours) is given by X t = U + V t. (a) (6 points) Identify the joint pdf of (U, V ). Be sure to specify the support (i.e. where the joint pdf is not zero.) { λe λv u 1, v f U,V (u, v) = f U (u)f V (v) = else (b) (6 points) Find the mean and variance of X t for a fixed t >. Make your answer as explicit as possible. E[X t ] = E[U] + te[v ] = 1 + t λ, and, since U and V are independent, Var(X t ) = Var(U) + t Var(V ) = t. λ (c) (6 points) Let T be the time the vehicle reaches the one mile marker. Find the CDF of T. Using U + V T = 1 yields T = 1 U V. Clearly F T (t) = for t <. For t, { } { 1 U F T (t) = P t = P V 1 U } V t = P {(U, V ) shaded region} = = 1 e 1 u λ( t ) t 1 u du = e λ( λ 1 t ) 1 u= 1 u t λe λv dvdu = t λ (1 e λ t ) 6. [1 points] Suppose 19 tickets are sold for an airplane flight with 15 seats. Suppose each passenger arrives for the flight with probability p =.75. (a) (7 points) Assuming each passenger arrives independently with probability p, use the central limit theorem (CLT) to express the approximate probability the flight is oversold (i.e. strictly more than 15 passengers arrive for the flight) in terms of the Q function. You do not need to use the continuity correction. Let X denote the number of passengers that arrive for the flight. By the assumptions, X has the binomial distribution with parameters n = 19 and p =.75. Thus E[X] = (19)(.75) = 1 and Var(X) = 19(.75)(.5) = = 36. So using the Gaussian approximation without a continuity correction, { } ( ) X P {X > 15} = P > Q = Q(1)

4 For the continuity correction we would start with P {X 15.5} yielding Q(6.5/6). We could also start with P {X 151}, giving Q(7/6). (b) (7 points) Suppose instead that the 19 passengers consist of 96 pairs of passengers, such that for each pair, both passengers in the pair arrive for the flight with probability p =.75; otherwise neither passenger in the pair arrives for the flight. Assume pairs arrive independently. The number of seats on the plane is still 15. Find the Gaussian approximation for the probability the flight is oversold. If we let Y i denote the number of passengers that arrive from the i th pair, then the total number of passengers that arrive can be written as S = Y Y 96, where the Y s are independent and P {Y i = } = p and P {Y i = } = 1 p. Thus, S has mean 96()p = 1 and variance 96()p(1 p) = 7. (So the effect of pairing gives a larger variance than in part (a).) Thus, { } ( ) S P {S > 15} = P > Q = Q(1/ ) (Slightly different correct answers are possible as for part (a). Another way to solve this part is to focus on the number of pairs of passengers that arrive, with the flight being oversold if more than 75 pairs of passengers arrive.) 7. [ points] Suppose under hypothesis H, the observation X has density f, and under hypothesis H 1, the observation X has density f 1, where the densities are given by f (u) = { 1 u 1 u 1 f 1 (u) = { 1 u u 1 u 1 (a) (6 points) Describe the ML decision rule for deciding which hypothesis is true for observation X. ML decision rule: declare H 1 if X < 1, and declare H otherwise. (b) (6 points) Find p false alarm and p miss for the ML rule. ( p false alarm = P (declare H 1 H is true) = P 1 X 1 ) H = 1. ( p miss = P (declare H H 1 is true) = P X 1 ) H 1 = 1. (c) (6 points) Suppose it is assumed a priori that H is true with probability π and H 1 is true with probability π 1 = 1 π. For what values of π does the MAP decision rule declare H with probability one, no matter which hypothesis is really true? In order for H to be declared with probability one, we need f 1(u) f (u) π π 1 for all u. The maximum of f 1(u) f (u) is (occurs at u = draw a sketch) so we need π π 1, or π 3. (d) (6 points) For the prior distribution π =. and π 1 =.8, find P P ( ) H X <.5 = P (H, X <.5) = P ( X <.5) ( ) H X < = 1 7

5 8. [ points] Suppose X has the pdf: {.5u u f X (u) = else (a) (6 points) Find E[X ]. E[X ] =.5u 3 du = u 8 =. (b) (6 points) Find P ( X = 1), where u is the greatest integer less than or equal to u. P ( X ) = 1) = P (1 X < ) = P (1 X < ) = 1.5u du = u (c) (6 points) Find the cumulative distribution function (CDF) of Y = ln X. The support of Y is (, ln ]. F Y (c) = P {Y c} = P {ln X c} = P {X e c } = e c.5u du = u e c 1 = 1. = ec for c ln, and F Y (c) = 1 for c > ln (d) (6 points) If U is uniformly distributed over the interval [, 1], find a function g such that g(u) has the same distribution as X. c F X (c) = P {X c} =.5u du = u c = c. Let c = u, then c = u, hence g(u) = F 1 (u) = u, for u [3 points] (3 points per answer) In order to discourage guessing, 3 points will be deducted for each incorrect answer (no penalty or gain for blank answers). A net negative score will reduce your total exam score. (a) This part concerns different choices for the joint pdf of random variables X and Y. The constant c stands for a normalizing constant in each part. TRUE FALSE { ce uv u 1, v 1 X and Y are independent if f X,Y (u, v) = else { ce uv u X and Y are independent if f X,Y (u, v) = + v 1 else False,False (b) Suppose X is a continuous type random variable with CDF F X (u). 5

6 TRUE FALSE If b > a, then F X (b) > F X (a). If F X (b) > F X (a), then b > a. F X (α) = 1 for some α with < α <. False, True, True. (c) Let (X, Y ) be uniformly distributed over [, 1] [, 1]. TRUE FALSE The support of Z = X Y is [ 1, 1]. Z = X + Y is uniformly distributed over [, ]. True, False (d) Let X 1, X,... be an infinite sequence of independent Bernoulli random variables all with parameter p (, 1). TRUE FALSE C 1 = 1 k=1 X k has a geometric distribution with parameter p. Let C m = m k=1 X k, then the mean of C m C m 1 is p. X = C 1 C 8, and Y = C 9 C 7 are independent random variables. False, True, False 6

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

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

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu

Course: ESO-209 Home Work: 1 Instructor: Debasis Kundu Home Work: 1 1. Describe the sample space when a coin is tossed (a) once, (b) three times, (c) n times, (d) an infinite number of times. 2. A coin is tossed until for the first time the same result appear

More information

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006

UC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 5 Spring 2006 Review problems UC Berkeley Department of Electrical Engineering and Computer Science EE 6: Probablity and Random Processes Solutions 5 Spring 006 Problem 5. On any given day your golf score is any integer

More information

MAT 271E Probability and Statistics

MAT 271E Probability and Statistics MAT 271E Probability and Statistics Spring 2011 Instructor : Class Meets : Office Hours : Textbook : Supp. Text : İlker Bayram EEB 1103 ibayram@itu.edu.tr 13.30 16.30, Wednesday EEB? 10.00 12.00, Wednesday

More information

ECE 302 Division 2 Exam 2 Solutions, 11/4/2009.

ECE 302 Division 2 Exam 2 Solutions, 11/4/2009. NAME: ECE 32 Division 2 Exam 2 Solutions, /4/29. You will be required to show your student ID during the exam. This is a closed-book exam. A formula sheet is provided. No calculators are allowed. Total

More information

Midterm Exam 1 (Solutions)

Midterm Exam 1 (Solutions) EECS 6 Probability and Random Processes University of California, Berkeley: Spring 07 Kannan Ramchandran February 3, 07 Midterm Exam (Solutions) Last name First name SID Name of student on your left: Name

More information

ECE 302 Division 1 MWF 10:30-11:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding.

ECE 302 Division 1 MWF 10:30-11:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding. NAME: ECE 302 Division MWF 0:30-:20 (Prof. Pollak) Final Exam Solutions, 5/3/2004. Please read the instructions carefully before proceeding. If you are not in Prof. Pollak s section, you may not take this

More information

Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators.

Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators. IE 230 Seat # Closed book and notes. 60 minutes. Cover page and four pages of exam. No calculators. Score Exam #3a, Spring 2002 Schmeiser Closed book and notes. 60 minutes. 1. True or false. (for each,

More information

Math 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) =

Math 151. Rumbos Fall Solutions to Review Problems for Exam 2. Pr(X = 1) = ) = Pr(X = 2) = Pr(X = 3) = p X. (k) = Math 5. Rumbos Fall 07 Solutions to Review Problems for Exam. A bowl contains 5 chips of the same size and shape. Two chips are red and the other three are blue. Draw three chips from the bowl at random,

More information

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172.

ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. ECE 302, Final 3:20-5:20pm Mon. May 1, WTHR 160 or WTHR 172. 1. Enter your name, student ID number, e-mail address, and signature in the space provided on this page, NOW! 2. This is a closed book exam.

More information

Class 26: review for final exam 18.05, Spring 2014

Class 26: review for final exam 18.05, Spring 2014 Probability Class 26: review for final eam 8.05, Spring 204 Counting Sets Inclusion-eclusion principle Rule of product (multiplication rule) Permutation and combinations Basics Outcome, sample space, event

More information

Random variables. DS GA 1002 Probability and Statistics for Data Science.

Random variables. DS GA 1002 Probability and Statistics for Data Science. Random variables DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Motivation Random variables model numerical quantities

More information

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes.

IE 230 Probability & Statistics in Engineering I. Closed book and notes. 60 minutes. Closed book and notes. 60 minutes. A summary table of some univariate continuous distributions is provided. Four Pages. In this version of the Key, I try to be more complete than necessary to receive full

More information

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS

6.041/6.431 Spring 2009 Quiz 1 Wednesday, March 11, 7:30-9:30 PM. SOLUTIONS 6.0/6.3 Spring 009 Quiz Wednesday, March, 7:30-9:30 PM. SOLUTIONS Name: Recitation Instructor: Question Part Score Out of 0 all 0 a 5 b c 5 d 5 e 5 f 5 3 a b c d 5 e 5 f 5 g 5 h 5 Total 00 Write your solutions

More information

1 Basic continuous random variable problems

1 Basic continuous random variable problems Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and

More information

Math 493 Final Exam December 01

Math 493 Final Exam December 01 Math 493 Final Exam December 01 NAME: ID NUMBER: Return your blue book to my office or the Math Department office by Noon on Tuesday 11 th. On all parts after the first show enough work in your exam booklet

More information

Mock Exam - 2 hours - use of basic (non-programmable) calculator is allowed - all exercises carry the same marks - exam is strictly individual

Mock Exam - 2 hours - use of basic (non-programmable) calculator is allowed - all exercises carry the same marks - exam is strictly individual Mock Exam - 2 hours - use of basic (non-programmable) calculator is allowed - all exercises carry the same marks - exam is strictly individual Question 1. Suppose you want to estimate the percentage of

More information

Guidelines for Solving Probability Problems

Guidelines for Solving Probability Problems Guidelines for Solving Probability Problems CS 1538: Introduction to Simulation 1 Steps for Problem Solving Suggested steps for approaching a problem: 1. Identify the distribution What distribution does

More information

STAT/MA 416 Midterm Exam 3 Monday, November 19, Circle the section you are enrolled in:

STAT/MA 416 Midterm Exam 3 Monday, November 19, Circle the section you are enrolled in: STAT/MA 46 Midterm Exam 3 Monday, November 9, 27 Name Purdue student ID ( digits) Circle the section you are enrolled in: STAT/MA 46-- STAT/MA 46-2- 9: AM :5 AM 3: PM 4:5 PM REC 4 UNIV 23. The testing

More information

FINAL EXAM: 3:30-5:30pm

FINAL EXAM: 3:30-5:30pm ECE 30: Probabilistic Methods in Electrical and Computer Engineering Spring 016 Instructor: Prof. A. R. Reibman FINAL EXAM: 3:30-5:30pm Spring 016, MWF 1:30-1:0pm (May 6, 016) This is a closed book exam.

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

Probability Models. 4. What is the definition of the expectation of a discrete random variable?

Probability Models. 4. What is the definition of the expectation of a discrete random variable? 1 Probability Models The list of questions below is provided in order to help you to prepare for the test and exam. It reflects only the theoretical part of the course. You should expect the questions

More information

Problem Solving. Correlation and Covariance. Yi Lu. Problem Solving. Yi Lu ECE 313 2/51

Problem Solving. Correlation and Covariance. Yi Lu. Problem Solving. Yi Lu ECE 313 2/51 Yi Lu Correlation and Covariance Yi Lu ECE 313 2/51 Definition Let X and Y be random variables with finite second moments. the correlation: E[XY ] Yi Lu ECE 313 3/51 Definition Let X and Y be random variables

More information

Lecture 2: Repetition of probability theory and statistics

Lecture 2: Repetition of probability theory and statistics Algorithms for Uncertainty Quantification SS8, IN2345 Tobias Neckel Scientific Computing in Computer Science TUM Lecture 2: Repetition of probability theory and statistics Concept of Building Block: Prerequisites:

More information

HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, , , (extra credit) A fashionable country club has 100 members, 30 of whom are

HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, , , (extra credit) A fashionable country club has 100 members, 30 of whom are HW1 (due 10/6/05): (from textbook) 1.2.3, 1.2.9, 1.2.11, 1.2.12, 1.2.16 (extra credit) A fashionable country club has 100 members, 30 of whom are lawyers. Rumor has it that 25 of the club members are liars

More information

FINAL EXAM: Monday 8-10am

FINAL EXAM: Monday 8-10am ECE 30: Probabilistic Methods in Electrical and Computer Engineering Fall 016 Instructor: Prof. A. R. Reibman FINAL EXAM: Monday 8-10am Fall 016, TTh 3-4:15pm (December 1, 016) This is a closed book exam.

More information

2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y.

2. Variance and Covariance: We will now derive some classic properties of variance and covariance. Assume real-valued random variables X and Y. CS450 Final Review Problems Fall 08 Solutions or worked answers provided Problems -6 are based on the midterm review Identical problems are marked recap] Please consult previous recitations and textbook

More information

Closed book and notes. 120 minutes. Cover page, five pages of exam. No calculators.

Closed book and notes. 120 minutes. Cover page, five pages of exam. No calculators. IE 230 Seat # Closed book and notes. 120 minutes. Cover page, five pages of exam. No calculators. Score Final Exam, Spring 2005 (May 2) Schmeiser Closed book and notes. 120 minutes. Consider an experiment

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015.

EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015. EECS 126 Probability and Random Processes University of California, Berkeley: Spring 2015 Abhay Parekh February 17, 2015 Midterm Exam Last name First name SID Rules. You have 80 mins (5:10pm - 6:30pm)

More information

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages

18.05 Final Exam. Good luck! Name. No calculators. Number of problems 16 concept questions, 16 problems, 21 pages Name No calculators. 18.05 Final Exam Number of problems 16 concept questions, 16 problems, 21 pages Extra paper If you need more space we will provide some blank paper. Indicate clearly that your solution

More information

Final Exam. Math Su10. by Prof. Michael Cap Khoury

Final Exam. Math Su10. by Prof. Michael Cap Khoury Final Exam Math 45-0 Su0 by Prof. Michael Cap Khoury Name: Directions: Please print your name legibly in the box above. You have 0 minutes to complete this exam. You may use any type of conventional calculator,

More information

ECEn 370 Introduction to Probability

ECEn 370 Introduction to Probability ECEn 370 Introduction to Probability Section 001 Midterm Winter, 2014 Instructor Professor Brian Mazzeo Closed Book - You can bring one 8.5 X 11 sheet of handwritten notes on both sides. Graphing or Scientic

More information

MAS108 Probability I

MAS108 Probability I 1 BSc Examination 2008 By Course Units 2:30 pm, Thursday 14 August, 2008 Duration: 2 hours MAS108 Probability I Do not start reading the question paper until you are instructed to by the invigilators.

More information

Chapter 2: Discrete Distributions. 2.1 Random Variables of the Discrete Type

Chapter 2: Discrete Distributions. 2.1 Random Variables of the Discrete Type Chapter 2: Discrete Distributions 2.1 Random Variables of the Discrete Type 2.2 Mathematical Expectation 2.3 Special Mathematical Expectations 2.4 Binomial Distribution 2.5 Negative Binomial Distribution

More information

Lecture 14. More discrete random variables

Lecture 14. More discrete random variables 18.440: Lecture 14 More discrete random variables Scott Sheffield MIT 1 Outline Geometric random variables Negative binomial random variables Problems 2 Outline Geometric random variables Negative binomial

More information

1: PROBABILITY REVIEW

1: PROBABILITY REVIEW 1: PROBABILITY REVIEW Marek Rutkowski School of Mathematics and Statistics University of Sydney Semester 2, 2016 M. Rutkowski (USydney) Slides 1: Probability Review 1 / 56 Outline We will review the following

More information

Algorithms for Uncertainty Quantification

Algorithms for Uncertainty Quantification Algorithms for Uncertainty Quantification Tobias Neckel, Ionuț-Gabriel Farcaș Lehrstuhl Informatik V Summer Semester 2017 Lecture 2: Repetition of probability theory and statistics Example: coin flip Example

More information

Introduction to Probability 2017/18 Supplementary Problems

Introduction to Probability 2017/18 Supplementary Problems Introduction to Probability 2017/18 Supplementary Problems Problem 1: Let A and B denote two events with P(A B) 0. Show that P(A) 0 and P(B) 0. A A B implies P(A) P(A B) 0, hence P(A) 0. Similarly B A

More information

STAT Chapter 5 Continuous Distributions

STAT Chapter 5 Continuous Distributions STAT 270 - Chapter 5 Continuous Distributions June 27, 2012 Shirin Golchi () STAT270 June 27, 2012 1 / 59 Continuous rv s Definition: X is a continuous rv if it takes values in an interval, i.e., range

More information

ECE 313: Hour Exam I

ECE 313: Hour Exam I University of Illinois Fall 07 ECE 3: Hour Exam I Wednesday, October, 07 8:45 p.m. 0:00 p.m.. [6 points] Suppose that a fair coin is independently tossed twice. Define the events: A = { The first toss

More information

Class 8 Review Problems 18.05, Spring 2014

Class 8 Review Problems 18.05, Spring 2014 1 Counting and Probability Class 8 Review Problems 18.05, Spring 2014 1. (a) How many ways can you arrange the letters in the word STATISTICS? (e.g. SSSTTTIIAC counts as one arrangement.) (b) If all arrangements

More information

18.05 Exam 1. Table of normal probabilities: The last page of the exam contains a table of standard normal cdf values.

18.05 Exam 1. Table of normal probabilities: The last page of the exam contains a table of standard normal cdf values. Name 18.05 Exam 1 No books or calculators. You may have one 4 6 notecard with any information you like on it. 6 problems, 8 pages Use the back side of each page if you need more space. Simplifying expressions:

More information

57:022 Principles of Design II Final Exam Solutions - Spring 1997

57:022 Principles of Design II Final Exam Solutions - Spring 1997 57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's

More information

Chapter 2 Random Variables

Chapter 2 Random Variables Stochastic Processes Chapter 2 Random Variables Prof. Jernan Juang Dept. of Engineering Science National Cheng Kung University Prof. Chun-Hung Liu Dept. of Electrical and Computer Eng. National Chiao Tung

More information

STAT 516 Midterm Exam 2 Friday, March 7, 2008

STAT 516 Midterm Exam 2 Friday, March 7, 2008 STAT 516 Midterm Exam 2 Friday, March 7, 2008 Name Purdue student ID (10 digits) 1. The testing booklet contains 8 questions. 2. Permitted Texas Instruments calculators: BA-35 BA II Plus BA II Plus Professional

More information

Probability and Statistics Concepts

Probability and Statistics Concepts University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each

More information

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1

IEOR 3106: Introduction to Operations Research: Stochastic Models. Professor Whitt. SOLUTIONS to Homework Assignment 1 IEOR 3106: Introduction to Operations Research: Stochastic Models Professor Whitt SOLUTIONS to Homework Assignment 1 Probability Review: Read Chapters 1 and 2 in the textbook, Introduction to Probability

More information

Random variable X is a mapping that maps each outcome s in the sample space to a unique real number x, x. X s. Real Line

Random variable X is a mapping that maps each outcome s in the sample space to a unique real number x, x. X s. Real Line Random Variable Random variable is a mapping that maps each outcome s in the sample space to a unique real number,. s s : outcome Sample Space Real Line Eamples Toss a coin. Define the random variable

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

STAT 414: Introduction to Probability Theory

STAT 414: Introduction to Probability Theory STAT 414: Introduction to Probability Theory Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical Exercises

More information

STAT2201. Analysis of Engineering & Scientific Data. Unit 3

STAT2201. Analysis of Engineering & Scientific Data. Unit 3 STAT2201 Analysis of Engineering & Scientific Data Unit 3 Slava Vaisman The University of Queensland School of Mathematics and Physics What we learned in Unit 2 (1) We defined a sample space of a random

More information

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) HIGHER CERTIFICATE IN STATISTICS, 1996

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY (formerly the Examinations of the Institute of Statisticians) HIGHER CERTIFICATE IN STATISTICS, 1996 EXAMINATIONS OF THE ROAL STATISTICAL SOCIET (formerly the Examinations of the Institute of Statisticians) HIGHER CERTIFICATE IN STATISTICS, 996 Paper I : Statistical Theory Time Allowed: Three Hours Candidates

More information

ECE 302: Probabilistic Methods in Engineering

ECE 302: Probabilistic Methods in Engineering Purdue University School of Electrical and Computer Engineering ECE 32: Probabilistic Methods in Engineering Fall 28 - Final Exam SOLUTION Monday, December 5, 28 Prof. Sanghavi s Section Score: Name: No

More information

This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam.

This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided with the exam. Probability and Statistics FS 2017 Session Exam 22.08.2017 Time Limit: 180 Minutes Name: Student ID: This exam contains 13 pages (including this cover page) and 10 questions. A Formulae sheet is provided

More information

Chapter 2: Random Variables

Chapter 2: Random Variables ECE54: Stochastic Signals and Systems Fall 28 Lecture 2 - September 3, 28 Dr. Salim El Rouayheb Scribe: Peiwen Tian, Lu Liu, Ghadir Ayache Chapter 2: Random Variables Example. Tossing a fair coin twice:

More information

MATH Solutions to Probability Exercises

MATH Solutions to Probability Exercises MATH 5 9 MATH 5 9 Problem. Suppose we flip a fair coin once and observe either T for tails or H for heads. Let X denote the random variable that equals when we observe tails and equals when we observe

More information

1 Presessional Probability

1 Presessional Probability 1 Presessional Probability Probability theory is essential for the development of mathematical models in finance, because of the randomness nature of price fluctuations in the markets. This presessional

More information

Statistics 100A Homework 5 Solutions

Statistics 100A Homework 5 Solutions Chapter 5 Statistics 1A Homework 5 Solutions Ryan Rosario 1. Let X be a random variable with probability density function a What is the value of c? fx { c1 x 1 < x < 1 otherwise We know that for fx to

More information

Random Processes. DS GA 1002 Probability and Statistics for Data Science.

Random Processes. DS GA 1002 Probability and Statistics for Data Science. Random Processes DS GA 1002 Probability and Statistics for Data Science http://www.cims.nyu.edu/~cfgranda/pages/dsga1002_fall17 Carlos Fernandez-Granda Aim Modeling quantities that evolve in time (or space)

More information

1 Basic continuous random variable problems

1 Basic continuous random variable problems Name M362K Final Here are problems concerning material from Chapters 5 and 6. To review the other chapters, look over previous practice sheets for the two exams, previous quizzes, previous homeworks and

More information

Covariance and Correlation Class 7, Jeremy Orloff and Jonathan Bloom

Covariance and Correlation Class 7, Jeremy Orloff and Jonathan Bloom 1 Learning Goals Covariance and Correlation Class 7, 18.05 Jerem Orloff and Jonathan Bloom 1. Understand the meaning of covariance and correlation. 2. Be able to compute the covariance and correlation

More information

ECE313 Summer Problem Set 7. Reading: Cond. Prob., Law of total prob., Hypothesis testinng Quiz Date: Tuesday, July 3

ECE313 Summer Problem Set 7. Reading: Cond. Prob., Law of total prob., Hypothesis testinng Quiz Date: Tuesday, July 3 ECE313 Summer 2012 Problem Set 7 Reading: Cond. Prob., Law of total prob., Hypothesis testinng Quiz Date: Tuesday, July 3 Note: It is very important that you solve the problems first and check the solutions

More information

Discrete Distributions

Discrete Distributions A simplest example of random experiment is a coin-tossing, formally called Bernoulli trial. It happens to be the case that many useful distributions are built upon this simplest form of experiment, whose

More information

Part 3: Parametric Models

Part 3: Parametric Models Part 3: Parametric Models Matthew Sperrin and Juhyun Park August 19, 2008 1 Introduction There are three main objectives to this section: 1. To introduce the concepts of probability and random variables.

More information

. Find E(V ) and var(v ).

. Find E(V ) and var(v ). Math 6382/6383: Probability Models and Mathematical Statistics Sample Preliminary Exam Questions 1. A person tosses a fair coin until she obtains 2 heads in a row. She then tosses a fair die the same number

More information

Discrete Random Variable Practice

Discrete Random Variable Practice IB Math High Level Year Discrete Probability Distributions - MarkScheme Discrete Random Variable Practice. A biased die with four faces is used in a game. A player pays 0 counters to roll the die. The

More information

Probability and Distributions

Probability and Distributions Probability and Distributions What is a statistical model? A statistical model is a set of assumptions by which the hypothetical population distribution of data is inferred. It is typically postulated

More information

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014.

EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014. EECS 126 Probability and Random Processes University of California, Berkeley: Fall 2014 Kannan Ramchandran September 23, 2014 Midterm Exam 1 Last name First name SID Rules. DO NOT open the exam until instructed

More information

ASM Study Manual for Exam P, First Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA Errata

ASM Study Manual for Exam P, First Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA Errata ASM Study Manual for Exam P, First Edition By Dr. Krzysztof M. Ostaszewski, FSA, CFA, MAAA (krzysio@krzysio.net) Errata Effective July 5, 3, only the latest edition of this manual will have its errata

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

Tutorial 1 : Probabilities

Tutorial 1 : Probabilities Lund University ETSN01 Advanced Telecommunication Tutorial 1 : Probabilities Author: Antonio Franco Emma Fitzgerald Tutor: Farnaz Moradi January 11, 2016 Contents I Before you start 3 II Exercises 3 1

More information

Exercises with solutions (Set D)

Exercises with solutions (Set D) Exercises with solutions Set D. A fair die is rolled at the same time as a fair coin is tossed. Let A be the number on the upper surface of the die and let B describe the outcome of the coin toss, where

More information

6.041/6.431 Fall 2010 Quiz 2 Solutions

6.041/6.431 Fall 2010 Quiz 2 Solutions 6.04/6.43: Probabilistic Systems Analysis (Fall 200) 6.04/6.43 Fall 200 Quiz 2 Solutions Problem. (80 points) In this problem: (i) X is a (continuous) uniform random variable on [0, 4]. (ii) Y is an exponential

More information

We introduce methods that are useful in:

We introduce methods that are useful in: Instructor: Shengyu Zhang Content Derived Distributions Covariance and Correlation Conditional Expectation and Variance Revisited Transforms Sum of a Random Number of Independent Random Variables more

More information

CME 106: Review Probability theory

CME 106: Review Probability theory : Probability theory Sven Schmit April 3, 2015 1 Overview In the first half of the course, we covered topics from probability theory. The difference between statistics and probability theory is the following:

More information

1.1 Review of Probability Theory

1.1 Review of Probability Theory 1.1 Review of Probability Theory Angela Peace Biomathemtics II MATH 5355 Spring 2017 Lecture notes follow: Allen, Linda JS. An introduction to stochastic processes with applications to biology. CRC Press,

More information

IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008

IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 IEOR 6711: Stochastic Models I SOLUTIONS to the First Midterm Exam, October 7, 2008 Justify your answers; show your work. 1. A sequence of Events. (10 points) Let {B n : n 1} be a sequence of events in

More information

STAT 418: Probability and Stochastic Processes

STAT 418: Probability and Stochastic Processes STAT 418: Probability and Stochastic Processes Spring 2016; Homework Assignments Latest updated on April 29, 2016 HW1 (Due on Jan. 21) Chapter 1 Problems 1, 8, 9, 10, 11, 18, 19, 26, 28, 30 Theoretical

More information

Semester , Example Exam 1

Semester , Example Exam 1 Semester 1 2017, Example Exam 1 1 of 10 Instructions The exam consists of 4 questions, 1-4. Each question has four items, a-d. Within each question: Item (a) carries a weight of 8 marks. Item (b) carries

More information

Notes on Continuous Random Variables

Notes on Continuous Random Variables Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes

More information

Review of Probability. CS1538: Introduction to Simulations

Review of Probability. CS1538: Introduction to Simulations Review of Probability CS1538: Introduction to Simulations Probability and Statistics in Simulation Why do we need probability and statistics in simulation? Needed to validate the simulation model Needed

More information

STAT/MA 416 Answers Homework 6 November 15, 2007 Solutions by Mark Daniel Ward PROBLEMS

STAT/MA 416 Answers Homework 6 November 15, 2007 Solutions by Mark Daniel Ward PROBLEMS STAT/MA 4 Answers Homework November 5, 27 Solutions by Mark Daniel Ward PROBLEMS Chapter Problems 2a. The mass p, corresponds to neither of the first two balls being white, so p, 8 7 4/39. The mass p,

More information

Massachusetts Institute of Technology

Massachusetts Institute of Technology Problem. (0 points) Massachusetts Institute of Technology Final Solutions: December 15, 009 (a) (5 points) We re given that the joint PDF is constant in the shaded region, and since the PDF must integrate

More information

Lecture 8: Continuous random variables, expectation and variance

Lecture 8: Continuous random variables, expectation and variance Lecture 8: Continuous random variables, expectation and variance Lejla Batina Institute for Computing and Information Sciences Digital Security Version: autumn 2013 Lejla Batina Version: autumn 2013 Wiskunde

More information

Conditional distributions (discrete case)

Conditional distributions (discrete case) Conditional distributions (discrete case) The basic idea behind conditional distributions is simple: Suppose (XY) is a jointly-distributed random vector with a discrete joint distribution. Then we can

More information

This exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text.

This exam is closed book and closed notes. (You will have access to a copy of the Table of Common Distributions given in the back of the text. TEST #3 STA 5326 December 4, 214 Name: Please read the following directions. DO NOT TURN THE PAGE UNTIL INSTRUCTED TO DO SO Directions This exam is closed book and closed notes. (You will have access to

More information

Probability Distributions Columns (a) through (d)

Probability Distributions Columns (a) through (d) Discrete Probability Distributions Columns (a) through (d) Probability Mass Distribution Description Notes Notation or Density Function --------------------(PMF or PDF)-------------------- (a) (b) (c)

More information

MATH 151, FINAL EXAM Winter Quarter, 21 March, 2014

MATH 151, FINAL EXAM Winter Quarter, 21 March, 2014 Time: 3 hours, 8:3-11:3 Instructions: MATH 151, FINAL EXAM Winter Quarter, 21 March, 214 (1) Write your name in blue-book provided and sign that you agree to abide by the honor code. (2) The exam consists

More information

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1).

2. Suppose (X, Y ) is a pair of random variables uniformly distributed over the triangle with vertices (0, 0), (2, 0), (2, 1). Name M362K Final Exam Instructions: Show all of your work. You do not have to simplify your answers. No calculators allowed. There is a table of formulae on the last page. 1. Suppose X 1,..., X 1 are independent

More information

ST 371 (V): Families of Discrete Distributions

ST 371 (V): Families of Discrete Distributions ST 371 (V): Families of Discrete Distributions Certain experiments and associated random variables can be grouped into families, where all random variables in the family share a certain structure and a

More information

Practice Exam 1: Long List 18.05, Spring 2014

Practice Exam 1: Long List 18.05, Spring 2014 Practice Eam : Long List 8.05, Spring 204 Counting and Probability. A full house in poker is a hand where three cards share one rank and two cards share another rank. How many ways are there to get a full-house?

More information

Random Variable. Pr(X = a) = Pr(s)

Random Variable. Pr(X = a) = Pr(s) Random Variable Definition A random variable X on a sample space Ω is a real-valued function on Ω; that is, X : Ω R. A discrete random variable is a random variable that takes on only a finite or countably

More information

Archdiocese of Washington Catholic Schools Academic Standards Mathematics

Archdiocese of Washington Catholic Schools Academic Standards Mathematics ALGEBRA 1 Standard 1 Operations with Real Numbers Students simplify and compare expressions. They use rational exponents, and simplify square roots. A1.1.1 A1.1.2 A1.1.3 A1.1.4 A1.1.5 Compare real number

More information

ECE531: Principles of Detection and Estimation Course Introduction

ECE531: Principles of Detection and Estimation Course Introduction ECE531: Principles of Detection and Estimation Course Introduction D. Richard Brown III WPI 22-January-2009 WPI D. Richard Brown III 22-January-2009 1 / 37 Lecture 1 Major Topics 1. Web page. 2. Syllabus

More information

Math 151. Rumbos Fall Solutions to Review Problems for Final Exam

Math 151. Rumbos Fall Solutions to Review Problems for Final Exam Math 5. Rumbos Fall 23 Solutions to Review Problems for Final Exam. Three cards are in a bag. One card is red on both sides. Another card is white on both sides. The third card in red on one side and white

More information

Solution: By Markov inequality: P (X > 100) 0.8. By Chebyshev s inequality: P (X > 100) P ( X 80 > 20) 100/20 2 = The second estimate is better.

Solution: By Markov inequality: P (X > 100) 0.8. By Chebyshev s inequality: P (X > 100) P ( X 80 > 20) 100/20 2 = The second estimate is better. MA 485-1E, Probability (Dr Chernov) Final Exam Wed, Dec 12, 2001 Student s name Be sure to show all your work. Each problem is 4 points. Full credit will be given for 9 problems (36 points). You are welcome

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

18.05 Practice Final Exam

18.05 Practice Final Exam No calculators. 18.05 Practice Final Exam Number of problems 16 concept questions, 16 problems. Simplifying expressions Unless asked to explicitly, you don t need to simplify complicated expressions. For

More information

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100]

HW7 Solutions. f(x) = 0 otherwise. 0 otherwise. The density function looks like this: = 20 if x [10, 90) if x [90, 100] HW7 Solutions. 5 pts.) James Bond James Bond, my favorite hero, has again jumped off a plane. The plane is traveling from from base A to base B, distance km apart. Now suppose the plane takes off from

More information