FIN312: The median, mode, and mean are basic statistical functions for data analytics. In this question, you will implement: Mathematics and Programming for FinTech Assignment, SUSS, Singapore

1) The median, mode, and mean are basic statistical functions for data analytics. In this question, you will implement them in pure Python code without importing any packages.

The following notations are used:

• v is a non-empty “list of numbers”
• vm is a non-empty “list of numbers” OR “list of non-empty lists of numbers” where the sub-lists have equal lengths.

a) Create a function median(v) which returns the median of v
b) Create a function mode (v) that returns a list containing the modes of v. Note that it is possible to have more than one mode, hence we return a list.
c) Create a function mean(vm, axis=None) which returns the mean of vm. The return value depends on the value of the axis as follows:

• 0: returns the mean down the rows
• 1: returns the mean across the columns
• None: return the mean of all the entries in vm

d) Show the result of your code running against these test cases:

• median(v), modes(v) and mean(v) for

v = [i for j in (range(1180, 2022, k)
for k in (3, 5, 7)) for i in j]

• mean(vm), mean(vm, 0) and mean(vm, 1) for

vm = [[11, 12, 13, 14, 15, 16, 17, 18],
[21, 22, 23, 24, 25, 26, 27, 28],
…
[91, 92, 93, 94, 95, 96, 97, 98]]

2) In Dice Game, you must run across a 140m bridge before it collapses. You are given two 6- sided dices with these numbers on their faces:

• -8, -7, 1, 2, 7, 8 on the first dice
• -7, -2, 1, 3, 7, 7 on the second dice

At every move, you throw the two dice simultaneously to obtain a score of X which is the product of the top faces of the two dice. You are then required to run forward X meters across the bridge. If unfortunately, X is negative, you need to run backward X meters. You can only make 3 moves before the bridge collapses.

For example, if you throw (8, 7), (2, -2) and (-7, -7), you will have run a total of 101m (since 8 x 7 + 2 x (-2) + (-7) x (-7) = 56 – 4 + 49 = 101). Sadly, this means you will still be on the bridge when it collapses.]

You are not allowed to import any packages in this question unless stated otherwise.

a) List the unique scores X you can get per move in ascending order.
b) Code a function pmf(x) that returns P(X = x). Compute to 6 decimal places the values.

• P(X = -21)
  P(X = -14)
  P(X = 14)
  P(X = 50)

c) Code a function cdf(x) that returns P(X x). Compute to 6 significant figures the values

• P(X<-21)
• P(X<-14)
• P(X< 14)
• P(X < 50)

d) What is the probability of you crossing the bridge successfully? Explain your reasoning clearly. Give your answer correct to 6 significant figures.

e) Draw and label (using a legend) the step graphs of pmf(x) and cdf(x) for an integer x such that -70< x < 70.