MAST20004 Probability

MAST20004 Probability

Semester 2, 2024

Assignment 3: Questions

Due 4 pm, Wednesday 18 September

Important instructions:

(1) This assignment contains 4 questions, two of which will be randomly selected to be marked. Each marked question is worth 10 points and each unmarked question with substantial working is worth 1 point.

(2) To complete this assignment, you need to write your solutions into the blank answer spaces following each question in this assignment PDF.

• If you have a printer (or can access one), then you must print out the assignment template and handwrite your solutions into the answer spaces.

• If you do not have a printer but you can figure out how to annotate a PDF using an iPad/Android tablet/Graphics tablet or using Adobe Acrobat, then annotate your answers directly onto the assignment PDF and save a copy for submission.

Failing both of these methods, you may handwrite your answers as normal on blank paper and then scan for submission.

Scan your assignment to a PDF file using your mobile phone (we recommend Cam - Scanner App), then upload by going to the Assignments menu on Canvas and submit the PDF to the GradeScope tool by first selecting your PDF file and then clicking on ‘Upload PDF’.

(3) A poor presentation penalty of 10% of the total available marks will apply unless your submitted assignment meets all of the following requirements:

• it is a single pdf with all pages in correct template order and the correct way up, and with any blank pages with additional working added only at the end of the template pages;

• has all pages clearly readable;

• has all pages cropped to the A4 borders of the original page and is imaged from directly above to avoid excessive ’keystoning’.

These requirements are easy to meet if you use a scanning app on your phone and take some care with your submission - please review it before submitting to double check you have satisfied all of the above requirements.

(4) Late submission within 20 hours after the deadline will be penalised by 5% of the to-tal available marks for every hour or part thereof after the deadline. After that, the Gradescope submission channel will be closed, and your submission will no longer be accepted. You are strongly encouraged to submit the assignment a few days before the deadline just in case of unexpected technical issues. If you are facing a rather excep-tional/extreme situation that prevents you from submitting on time, please complete the assignment extension request form. that is available on Canvas.

(5) Working and reasoning must be given to obtain full credit. Clarity, neatness, and style. count.

Q1. Let X be a random variable with PDF

(a) Put Y1 = X3 . Derive the CDF and PDF of Y1.

(b) Put Y2 = X2 . Derive the CDF and PDF of Y2.

(c) Put Y3 = min{X, 1}. Derive the CDF and PDF of Y3.

(d) Let U ∼ Unif (0, 1). Explain theoretically how to generate a realisation of the RV X from U.

(e) Put U = runif (1000). Using your answer from part (d), write an R code to simulate 1000 realisations of X from U.

Q2. Let (X, Y ) be a discrete random vector with joint PMF

(a) Sketch the region for which pX,Y (i, j) > 0 (with horizontal i-axis and vertical j-axis).

(b) Compute the marginal PMF of X.

(c) Compute the marginal PMF of Y .

(d) Determine the conditional PMF of X given Y = j.

(e) Are X and Y independent? Explain.

(f) Compute the PMF of the random variable V := Y − X.

Q3. Let (X, Y ) be a continuous random vector with joint PDF

where C > 0 is a constant.

(a) Sketch the region for which fX,Y (x, y) > 0 (with horizontal x-axis and vertical y-axis).

(b) Find the value of C.

(c) Find the marginal PDFs of X and Y .

(d) Are X and Y independent? Explain.

Q4. Let X and Y be random variables on a common probability space (Ω, P). Determine whether each of the following statements is true or false. If it is true, give a proof or an explanation by quoting basic properties or facts from the lecture slides/tutorials; if it is false, give a counterexample or an explanation.

(a) If X   −X, then E(X) = 0.

(b) If X  exp(λ) and Y = b Xc , then E(Y ) = e −λ/(1 − e −λ ).

(c) If X  exp(λ) and Y = max{X, 10}, then the distribution FY satisfies the mem-oryless property.

(d) If X is a random variable with P(X ≥ 0) = 1 and E

资源下载链接为: https://pan.quark.cn/s/f989b9092fc5 今天给大家分享一个关于C#自定义字符串替换方法的实例,希望能对大家有所帮助。具体介绍如下: 之前我遇到了一个算法题,题目要求将一个字符串中的某些片段替换为指定的新字符串片段。例如,对于源字符串“abcdeabcdfbcdefg”,需要将其中的“cde”替换为“12345”,最终得到的结果字符串是“ab12345abcdfb12345fg”,即从“abcdeabcdfbcdefg”变为“ab12345abcdfb12345fg”。 经过分析,我发现不能直接使用C#自带的string.Replace方法来实现这个功能。于是,我决定自定义一个方法来完成这个任务。这个方法的参数包括:原始字符串originalString、需要被替换的字符串片段strToBeReplaced以及用于替换的新字符串片段newString。 在实现过程中,我首先遍历原始字符串,查找需要被替换的字符串片段strToBeReplaced出现的位置。找到后,就将其替换为新字符串片段newString。需要注意的是,在替换过程中,要确保替换操作不会影响后续的查找和替换,避免遗漏或重复替换的情况发生。 以下是实现代码的大概逻辑: 初始化一个空的字符串result,用于存储最终替换后的结果。 使用IndexOf方法在原始字符串中查找strToBeReplaced的位置。 如果找到了,就将originalString中从开头到strToBeReplaced出现位置之前的部分,以及newString拼接到result中,然后将originalString的查找范围更新为strToBeReplaced之后的部分。 如果没有找到,就直接将剩余的originalString拼接到result中。 重复上述步骤,直到originalStr
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值