Latest Module Specifications
Current Academic Year 2025 - 2026
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Description Introduction to probability: discrete sample spaces; axioms; addition and multiplication laws; conditional probability and independence; reliability of systems; Bayes’ theorem. Discrete random variables and distributions: Bernoulli, hypergeometric, binomial, geometric and Poisson; expectation and variance; memoryless property; binomial approximation to the hypergeometric; Poisson approximation to the binomial. Continuous random variables and distributions: uniform, exponential and normal; expectation and variance; memoryless property of the exponential distribution. Modelling and simulation of stochastic systems, including small-scale computational simulations to approximate probabilities, validate analytic results, and estimate performance measures. Summarising and visualising statistical data using appropriate statistical computing tools. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Learning Outcomes 1. Explain and apply the axioms and fundamental laws of probability, including conditional probability, independence, and Bayes’ theorem. 2. Formulate and analyse discrete probabilistic models, including hypergeometric, binomial, geometric, and Poisson distributions; compute associated probabilities, expectations, and variances; and apply binomial and Poisson approximations where appropriate. 3. Formulate and analyse continuous probabilistic models, including the uniform, exponential, and normal distributions; compute associated probabilities, expectations, and variances. 4. Explain properties such as memorylessness where applicable. 5. Analyse simple reliability models involving independent component failures. 6. Model and simulate stochastic systems, using computational tools to approximate probabilities, validate analytical results, and estimate performance measures. 7. Use statistical computing tools (e.g., R) to summarise, analyse, and visualise data, including calculation of summary statistics and graphical representations. 8. Select and justify appropriate probabilistic models for problems arising in computing contexts. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
All module information is indicative and subject to change. For further information,students are advised to refer to the University's Marks and Standards and Programme Specific Regulations at: http://www.dcu.ie/registry/examinations/index.shtml |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Indicative Content and Learning Activities
Indicative Syllabus Summarising and visualising statistical data using appropriate statistical computing tools; descriptive statistics; graphical representations. Discrete sample spaces; axioms of probability; addition and multiplication laws; conditional probability and independence; law of total probability; Bayes’ theorem; reliability of systems with independent components. Bernoulli, hypergeometric, binomial, geometric, exponential, and Poisson distributions; expectation and variance; memoryless property of the geometric distribution; binomial approximation to the hypergeometric; Poisson approximation to the binomial. Uniform, exponential, and normal distributions; expectation and variance; memoryless property of the exponential distribution. Basic simulation of stochastic systems; computational estimation of probabilities; validation of analytical results via simulation. | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Indicative Reading List Books:
Articles: None | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
Other Resources None | ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||