##### Differences

This shows you the differences between two versions of the page.

 cs-312:hw8 [2014/12/31 15:58]ringger created cs-312:hw8 [2014/12/31 16:22]ringger 2014/12/31 16:22 ringger 2014/12/31 15:58 ringger created 2014/12/31 16:22 ringger 2014/12/31 15:58 ringger created Line 1: Line 1: - __NOTOC__ + = Homework Assignment #8 = - <​big>'''​Homework Assignment #8'''​ + == Objective == == Objective == Line 17: Line 16: Let's define a simple experiment as follows: ​ Roll two dice.  Each sample (outcome) is an ordered pair of die faces. Let's define a simple experiment as follows: ​ Roll two dice.  Each sample (outcome) is an ordered pair of die faces. * How many samples are in the sample space? * How many samples are in the sample space? - Now define a random variable ​<​math>​X​which assigns to each sample the total number of dots on the faces of the two dice.  Also, assume a uniform distribution over samples. + Now define a random variable ​$X$which assigns to each sample the total number of dots on the faces of the two dice.  Also, assume a uniform distribution over samples. - * What is the probability ​<​math>​p(X=7) ​with these fair dice? + * What is the probability ​$p(X=7)$ with these fair dice? * What is the probability of rolling the outcome "snake eyes" (two ones) with these fair dice? * What is the probability of rolling the outcome "snake eyes" (two ones) with these fair dice? - * What is the expected value of our random variable ​<​math>​X ​with respect to this fair distribution?​ + * What is the expected value of our random variable ​$X$ with respect to this fair distribution?​ ===Question 2=== ===Question 2=== Probability Theory: Probability Theory: - Let's define another simple experiment involving rolling two dice as follows: again, each sample (outcome) is an ordered pair of die faces, and we define a random variable ​<​math>​X​which assigns to each sample the total number of dots on the faces of the two dice.  This time assume that the dice are "​loaded"​ (in other words, not fair) and that for each die the probability of rolling a 1 is 1/4, while the other outcomes for each die share the remaining 3/4 probability mass equally. + Let's define another simple experiment involving rolling two dice as follows: again, each sample (outcome) is an ordered pair of die faces, and we define a random variable ​$X$which assigns to each sample the total number of dots on the faces of the two dice.  This time assume that the dice are "​loaded"​ (in other words, not fair) and that for each die the probability of rolling a 1 is 1/4, while the other outcomes for each die share the remaining 3/4 probability mass equally. - * What is the probability ​<​math>​p(X=7) ​with these loaded dice? + * What is the probability ​$p(X=7)$ with these loaded dice? * What is the probability of rolling the outcome "snake eyes" (two ones) with these loaded dice? * What is the probability of rolling the outcome "snake eyes" (two ones) with these loaded dice? - * What is the expected value of our random variable ​<​math>​X ​with respect to this unfair distribution?​ + * What is the expected value of our random variable ​$X$ with respect to this unfair distribution?​ ===Question 3=== ===Question 3=== Recurrence Relations: Recurrence Relations: - Suppose an algorithm has running time described by the following recurrence relation: ​<​math>​T(n) = 3 T(n/4) + n^2​.  Use the theory of recurrence relations to solve this recurrence relation. ​ Come up with the general solution and then place it in an asymptotic order of growth. + Suppose an algorithm has running time described by the following recurrence relation: ​$T(n) = 3 T(n/4) + n^2$.  Use the theory of recurrence relations to solve this recurrence relation. ​ Come up with the general solution and then place it in an asymptotic order of growth.
cs-312/hw8.txt · Last modified: 2014/12/31 16:22 by ringger
Back to top
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "url": "https://wiki.cs.byu.edu/cs-312/hw8?do=diff&rev2%5B0%5D=1420066693&rev2%5B1%5D=1420068129&difftype=sidebyside", "fetch_time": 1601230166000000000, "content_mime_type": "text/html", "warc_filename": "crawl-data/CC-MAIN-2020-40/segments/1600400283990.75/warc/CC-MAIN-20200927152349-20200927182349-00294.warc.gz", "warc_record_offset": 658799016, "warc_record_length": 5099, "token_count": 1043, "char_count": 3924, "score": 3.6875, "int_score": 4, "crawl": "CC-MAIN-2020-40", "snapshot_type": "latest", "language": "en", "language_score": 0.8255584836006165, "file_path": "/sailhome/yjruan/project/latent-lm/data/processed/finemath-4plus/finemath-4plus/train-00063-of-00064.parquet"}