MA12005: Statistics and data science 1A
[Page last updated: 23 October 2023]
Academic Year: | 2023/24 |
Owning Department/School: | Department of Mathematical Sciences |
Credits: | 15 [equivalent to 30 CATS credits] |
Notional Study Hours: | 300 |
Level: | Certificate (FHEQ level 4) |
Period: |
|
Assessment Summary: | CWRG 20%, CWSI 40%, EXCB 40% |
Assessment Detail: |
|
Supplementary Assessment: |
|
Requisites: | |
Learning Outcomes: |
By the end of the unit, you will be able to:
|
Synopsis: | You will develop core skills in statistics and computer programming with an emphasis on data science. You will develop a solid foundation in probability theory that will facilitate further study in probability and statistics. You will learn Python programming and sustainable software engineering for mathematics, include the design and analysis of algorithms and with examples from data science. You will also develop the ability to reason logically and to read and write mathematics well. |
Content: | Probability & Statistics:
Sample space, events as sets, unions, and intersections. Axioms and laws of probability. Equally likely events. Sampling methods: with or without ordering and replacement. Conditional probability. Partition theorem. Bayes' theorem. Independence of events. Bernoulli trials. Discrete random variables (RVs). Probability mass function (PMF). Bernoulli, Geometric, Binomial and Poisson distributions. Joint and marginal discrete distributions. Definition of continuous random variables (RVs), cumulative distribution functions (CDFs) and probability density functions (PDFs). Some common continuous distributions including uniform, exponential and normal. Independence of RVs (including joint distribution as a product of marginals). Expectation of RVs. Properties of expectation. Expectation of product of independent RVs. Variance and properties. Standard deviation. Moments, covariance, correlation. Sums of independent random variables. Key application: Random walks. Statement of the law of large numbers.
Programming & Data Science:
Introduction to programming and programming paradigms. From specification through algorithms to implementation. Building elements: preconditions and postconditions; basic data types; variables, identifiers and scope; arrays and strings. Control structures: conditionals; loops. Correctness issues when programming with loops. Functions and subroutines: iteration and recursion. Understanding and analysing algorithms. Common design patterns such as recursion, divide-and-conquer, and dynamic programming.
Foundations:
Study skills for mathematicians, including how to think and write logically, how to work with definitions, theorems and proofs, and techniques of proof, including construction, contradiction, and induction. |
Course availability: |
MA12005 is Compulsory on the following courses:Department of Mathematical Sciences
|
Notes:
|