- ES Español

- EN English

5.17. Probability Calculation (Mandatory)
- Semester: 3rd Sem. Credits: 3
- Hour of this course: Theory: 2 hours; Practice: 2 hours;
- Syllabus:
- htmlonly

Español

English - Prerrequisites:
- BMA102 Differential Calculus (1st Sem) itemize
5.17.1. Justification ↑ Back to top
Probability and statistics are fundamental in computer science for algorithm analysis, system modeling, decision-making under uncertainty, and data analysis. This course integrates probability theory with statistical methods, focusing on computational applications such as algorithm analysis, machine learning, system modeling, and data science.
5.17.2. Generales Goals ↑ Back to top
- Understand the fundamentals of probability and statistical inference.
- Apply probability distributions and statistical methods to solve computing problems.
- Develop skills for modeling stochastic systems and performing data inference.
5.17.3. Contribution to Outcomes ↑ Back to top
- AG-C07) Computing Knowledge: Applies knowledge of mathematics, science, and computing. (Familiarity)
5.17.4. Content ↑ Back to top
5.17.4.1. Probability Fundamentals (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Probability spaces and axioms
- Event operations: union, intersection, complement
- Counting techniques: permutations and combinations
- Conditional probability and independence
- Bayes' theorem and applications
Learning Outcomes
- Define sample spaces and apply probability axioms. [Familiarity]
- Use counting techniques to calculate probabilities. [Usage]
- Apply Bayes' theorem in classification problems. [Assessment]
5.17.4.2. Discrete Random Variables (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Discrete random variables
- Probability mass function (PMF) and cumulative distribution function (CDF)
- Expectation, variance, and moments
- Distributions: Bernoulli, Binomial, Geometric, Poisson
- Applications in computational system modeling
Learning Outcomes
- Define and characterize discrete random variables. [Familiarity]
- Calculate expectation and variance for different distributions. [Usage]
- Apply discrete distributions in network and system modeling. [Assessment]
5.17.4.3. Continuous Random Variables (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Continuous random variables
- Probability density function (PDF) and CDF
- Transformations of random variables
- Distributions: Uniform, Exponential, Normal
- Applications in system simulation and queuing theory
Learning Outcomes
- Differentiate between discrete and continuous variables. [Familiarity]
- Calculate probabilities using density functions. [Usage]
- Model service times and arrival times using continuous distributions. [Assessment]
5.17.4.4. Multivariate Distributions and Dependence (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Joint and marginal distributions
- Conditional distributions
- Covariance and correlation
- Independence of random variables
- Applications in multidimensional data analysis
Learning Outcomes
- Calculate joint and marginal distributions. [Familiarity]
- Measure dependence using covariance and correlation. [Usage]
- Analyze relationships between variables in datasets. [Assessment]
5.17.4.5. Limit Theorems and Approximations (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Law of Large Numbers
- Central Limit Theorem
- Moments and generating functions
- Probabilistic inequalities (Chernoff, Markov, Chebyshev)
- Applications in big data and algorithm analysis
Learning Outcomes
- State and interpret limit theorems. [Familiarity]
- Apply CLT in distribution approximations. [Usage]
- Use inequalities in algorithm bound analysis. [Assessment]
5.17.4.6. Bayesian Inference (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Ross, 2014; Devore, 2016)
Topics
- Bayesian updating with discrete/continuous priors
- Maximum A Posteriori (MAP) estimation
- Bayesian credible intervals
- Conjugate priors
- Applications in Naive Bayes classifiers and ML
Learning Outcomes
- Differentiate between frequentist and Bayesian approaches. [Familiarity]
- Perform Bayesian belief updating. [Usage]
- Implement MAP estimation in machine learning problems. [Assessment]
5.17.4.7. Statistical Inference (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Devore, 2016)
Topics
- Parameter estimation: MLE (Maximum Likelihood Estimation)
- Hypothesis testing: z-test, t-test, chi-square test
- Confidence intervals
- Bootstrapping and resampling methods
- Applications in model validation and data science
Learning Outcomes
- Estimate parameters using maximum likelihood methods. [Familiarity]
- Perform hypothesis testing to validate assumptions. [Usage]
- Construct confidence intervals and apply bootstrapping. [Assessment]
5.17.4.8. Regression and Advanced Applications (6 hours) [Skills AG-C07] ↑ Back to top
Bibliography: (Devore, 2016)
Topics
- Simple linear regression
- Least squares fitting
- Poisson processes
- Monte Carlo simulation
- Introduction to Markov chains
- Applications in prediction and system modeling
Learning Outcomes
- Implement linear regression models. [Familiarity]
- Use Monte Carlo simulation to solve complex problems. [Usage]
- Apply stochastic processes in real system modeling. [Assessment]
5.17.5. Bibliography ↑ Back to top
Ross, S. M. (2014). A First Course in Probability. Pearson.
Devore, J. L. (2016). Probability and Statistics for Engineering and the Sciences. Cengage Learning.