Honours Applied Mathematics (B. Sc.)

Please note: Due to the ongoing transition to the new course catalogue, the program and course information displayed below may be temporarily unavailable or outdated. In particular, details about whether a course will be offered in an upcoming term may be inaccurate. Official course scheduling information for Fall 2025 will be available on Minerva during the first week of May. We appreciate your patience and understanding during this transition.


Applied Mathematics Honours (B.Sc.) (63 credits)

Offered by: Mathematics and Statistics聽(Faculty of Science)
Degree: Bachelor of Science
Program credit weight: 63

Program Description

The B.Sc.; Honours in Applied Mathematics provides an in-depth training, at the honours level, in 鈥渄iscrete鈥 or 鈥渃ontinuous鈥 applied mathematics. It gives the foundations and necessary tools to explore some areas such as numerical analysis, continuous and discrete optimization, graph theory, discrete probability. The program also provides the background required to pursue interdisciplinary research at the interface between mathematics and other fields such as biology, physiology, and the biomedical sciences. This program may be completed with a minimum of 60 credits or a maximum of 63 credits.

Students may complete this program with a minimum of 60 credits or a maximum of 63 credits depending if they are exempt from 惭础罢贬听222 Calculus 3..

Degree Requirements 鈥 B.Sc.

This program is offered as part of a Bachelor of Science (B.Sc.) degree.

To graduate, students must satisfy both their program requirements and their degree requirements.

  • The program requirements (i.e., the specific courses that make up this program) are listed under the Course Tab (above).
  • The degree requirements鈥攊ncluding the mandatory Foundation program, appropriate degree structure, and any additional components鈥攁re outlined on the .

Students are responsible for ensuring that this program fits within the overall structure of their degree and that all degree requirements are met. Consult the Degree Planning Guide on the SOUSA website for additional guidance.

Program Prerequisites

The minimum requirement for entry into the Honours program is that the student has completed with high standing the following courses below or their equivalents:

Course Title Credits
MATH 133Linear Algebra and Geometry.3

Linear Algebra and Geometry.

Terms offered: Summer 2025, Fall 2025, Winter 2026

Systems of linear equations, matrices, inverses, determinants; geometric vectors in three dimensions, dot product, cross product, lines and planes; introduction to vector spaces, linear dependence and independence, bases. Linear transformations. Eigenvalues and diagonalization.

MATH 150Calculus A.4

Calculus A.

Terms offered: this course is not currently offered.

Functions, limits and continuity, differentiation, L'Hospital's rule, applications, Taylor polynomials, parametric curves, functions of several variables.

MATH 151Calculus B.4

Calculus B.

Terms offered: this course is not currently offered.

Integration, methods and applications, infinite sequences and series, power series, arc length and curvature, multiple integration.

In particular, 惭础罢贬听150 Calculus A./惭础罢贬听151 Calculus B. and 惭础罢贬听140 Calculus 1./惭础罢贬听222 Calculus 3. are considered equivalent.

Students who have not completed an equivalent of 惭础罢贬听222 Calculus 3. on entering the program must consult an academic adviser and take 惭础罢贬听222 Calculus 3. as a required course in the first semester, increasing the total number of program credits from 60 to 63. Students who have successfully completed 惭础罢贬听150 Calculus A./惭础罢贬听151 Calculus B. are not required to take 惭础罢贬听222 Calculus 3..

Note: 颁翱惭笔听202 Foundations of Programming.鈥攐r an equivalent introduction to computer programming course鈥攊s a program prerequisite. U0 students may take 颁翱惭笔听202 Foundations of Programming. as a Freshman Science course; new U1 students should take it as an elective in their first semester.

Students who transfer to Honours in Applied Mathematics from other programs will have credits for previous courses assigned, as appropriate, by the Department.

To be awarded the Honours degree, the student must have, at time of graduation, a CGPA of at least 3.00 in the required and complementary Mathematics courses of the program, as well as an overall CGPA of at least 3.00.

Required Courses (36-39 credits)

Course Title Credits
COMP 250Introduction to Computer Science. 13

Introduction to Computer Science.

Terms offered: Fall 2025, Winter 2026

Mathematical tools (binary numbers, induction,recurrence relations, asymptotic complexity,establishing correctness of programs). Datastructures (arrays, stacks, queues, linked lists,trees, binary trees, binary search trees, heaps,hash tables). Recursive and non-recursivealgorithms (searching and sorting, tree andgraph traversal). Abstract data types. Objectoriented programming in Java (classes andobjects, interfaces, inheritance). Selected topics.

COMP 252Honours Algorithms and Data Structures.3

Honours Algorithms and Data Structures.

Terms offered: Winter 2026

The design and analysis of data structures and algorithms. The description of various computational problems and the algorithms that can be used to solve them, along with their associated data structures. Proving the correctness of algorithms and determining their computational complexity.

MATH 222Calculus 3. 23

Calculus 3.

Terms offered: Summer 2025, Fall 2025, Winter 2026

Taylor series, Taylor's theorem in one and several variables. Review of vector geometry. Partial differentiation, directional derivative. Extreme of functions of 2 or 3 variables. Parametric curves and arc length. Polar and spherical coordinates. Multiple integrals.

MATH 247Honours Applied Linear Algebra. 33

Honours Applied Linear Algebra.

Terms offered: Winter 2026

Matrix algebra, determinants, systems of linear equations. Abstract vector spaces, inner product spaces, Fourier series. Linear transformations and their matrix representations. Eigenvalues and eigenvectors, diagonalizable and defective matrices, positive definite and semidefinite matrices. Quadratic and Hermitian forms, generalized eigenvalue problems, simultaneous reduction of quadratic forms. Applications.

MATH 251Honours Algebra 2. 33

Honours Algebra 2.

Terms offered: Winter 2026

Linear equations over a field. Introduction to vector spaces. Linear maps and their matrix representation. Determinants. Canonical forms. Duality. Bilinear and quadratic forms. Real and complex inner product spaces. Diagonalization of self-adjoint operators.

MATH 255Honours Analysis 2.3

Honours Analysis 2.

Terms offered: Winter 2026

Basic point-set topology, metric spaces: open and closed sets, normed and Banach spaces, H脙露lder and Minkowski inequalities, sequential compactness, Heine-Borel, Banach Fixed Point theorem. Riemann-(Stieltjes) integral, Fundamental Theorem of Calculus, Taylor's theorem. Uniform convergence. Infinite series, convergence tests, power series. Elementary functions.

MATH 325Honours Ordinary Differential Equations.3

Honours Ordinary Differential Equations.

Terms offered: Winter 2026

First and second order equations, linear equations, series solutions, Frobenius method, introduction to numerical methods and to linear systems, Laplace transforms, applications.

MATH 350Honours Discrete Mathematics .3

Honours Discrete Mathematics .

Terms offered: Fall 2025

Discrete mathematics. Graph Theory: matching theory, connectivity, planarity, and colouring; graph minors and extremal graph theory. Combinatorics: combinatorial methods, enumerative and algebraic combinatorics, discrete probability.

MATH 356Honours Probability.3

Honours Probability.

Terms offered: Fall 2025

Sample space, probability axioms, combinatorial probability. Conditional probability, Bayes' Theorem. Distribution theory with special reference to the Binomial, Poisson, and Normal distributions. Expectations, moments, moment generating functions, uni-variate transformations. Random vectors, independence, correlation, multivariate transformations. Conditional distributions, conditional expectation.Modes of stochastic convergence, laws of large numbers, Central Limit Theorem.

MATH 357Honours Statistics.3

Honours Statistics.

Terms offered: Winter 2026

Sampling distributions. Point estimation. Minimum variance unbiased estimators, sufficiency, and completeness. Confidence intervals. Hypothesis tests, Neyman-Pearson Lemma, uniformly most powerful tests. Likelihood ratio tests for normal samples. Asymptotic sampling distributions and inference.

MATH 358Honours Advanced Calculus.3

Honours Advanced Calculus.

Terms offered: Winter 2026

Point-set topology in Euclidean space; continuity and differentiability of functions in several variables. Implicit and inverse function theorems. Vector fields, divergent and curl operations. Rigorous treatment of multiple integrals: volume and surface area; and Fubini鈥檚 theorem. Line and surface integrals, conservative vector fields. Green's theorem, Stokes鈥 theorem and the divergence theorem.

MATH 376Honours Nonlinear Dynamics.3

Honours Nonlinear Dynamics.

Terms offered: Fall 2025

This course consists of the lectures of MATH 326, but will be assessed at the honours level.

MATH 470Honours Research Project.3

Honours Research Project.

Terms offered: Summer 2025, Fall 2025, Winter 2026

The project will contain a significant research component that requires substantial independent work consisting of a written report and oral examination or presentation.

MATH 475Honours Partial Differential Equations.3

Honours Partial Differential Equations.

Terms offered: Fall 2025

First order partial differential equations, geometric theory, classification of second order linear equations, Sturm-Liouville problems, orthogonal functions and Fourier series, eigenfunction expansions, separation of variables for heat, wave and Laplace equations, Green's function methods, uniqueness theorems.

1

Students with limited programming experience should take 颁翱惭笔听202 Foundations of Programming. or 颁翱惭笔听204 Computer Programming for Life Sciences. or 颁翱惭笔听208 Computer Programming for Physical Sciences and Engineering . or equivalent before 颁翱惭笔听250 Introduction to Computer Science..

2

Students who have successfully completed 惭础罢贬听150 Calculus A./惭础罢贬听151 Calculus B. or an equivalent of 惭础罢贬听222 Calculus 3. on entering the program are not required to take 惭础罢贬听222 Calculus 3..

3

Students select either 惭础罢贬听251 Honours Algebra 2. or 惭础罢贬听247 Honours Applied Linear Algebra., but not both.

Complementary Courses (24 credits)

3 credits selected from:

Course Title Credits
MATH 242Analysis 1.3

Analysis 1.

Terms offered: Fall 2025

A rigorous presentation of sequences and of real numbers and basic properties of continuous and differentiable functions on the real line.

MATH 254Honours Analysis 1. 13

Honours Analysis 1.

Terms offered: Fall 2025

Properties of R. Cauchy and monotone sequences, Bolzano- Weierstrass theorem. Limits, limsup, liminf of functions. Pointwise, uniform continuity: Intermediate Value theorem. Inverse and monotone functions. Differentiation: Mean Value theorem, L'Hospital's rule, Taylor's Theorem.

聽3 credits selected from:

Course Title Credits
MATH 235Algebra 1.3

Algebra 1.

Terms offered: Fall 2025

Sets, functions and relations. Methods of proof. Complex numbers. Divisibility theory for integers and modular arithmetic. Divisibility theory for polynomials. Rings, ideals and quotient rings. Fields and construction of fields from polynomial rings. Groups, subgroups and cosets; homomorphisms and quotient groups.

MATH 245Honours Algebra 1. 13

Honours Algebra 1.

Terms offered: Fall 2025

Honours level: Sets, functions, and relations. Methods of proof. Complex numbers. Divisibility theory for integers and modular arithmetic. Divisibility theory for polynomials. In-depth study of rings, ideals, and quotient rings; fields and construction of fields from polynomial rings; groups, subgroups, and cosets, homomorphisms, and quotient groups.

1

It is strongly recommended that students take both 惭础罢贬听245 Honours Algebra 1. and 惭础罢贬听254 Honours Analysis 1..听

Advising Notes:

Students interested in continuous applied mathematics are urged to choose these as part of their Complementary Courses:聽惭础罢贬听454 Honours Analysis 3.,听惭础罢贬听455 Honours Analysis 4.听补苍诲听惭础罢贬听478 Computational Methods in Applied Mathematics ., and are advised to choose additional courses from聽惭础罢贬听387 Honours Numerical Analysis.,听惭础罢贬听397 Honours Matrix Numerical Analysis.,听惭础罢贬听555 Fluid Dynamics.鈥,听惭础罢贬听574 Dynamical Systems.,听惭础罢贬听578 Numerical Analysis 1.,听惭础罢贬听579 Numerical Differential Equations.,听惭础罢贬听580 Advanced Partial Differential Equations 1 .,听惭础罢贬听581 Advanced Partial Differential Equations 2 .

Students interested in discrete applied mathematics are advised to choose from these as part of their Complementary Courses:聽颁翱惭笔听362 Honours Algorithm Design.,惭础罢贬听456 Honours Algebra 3.,听惭础罢贬听457 Honours Algebra 4.,听惭础罢贬听517 Honours Linear Optimization.,听惭础罢贬听547 Stochastic Processes.,听惭础罢贬听550 Combinatorics.,听惭础罢贬听552 Combinatorial Optimization..

3 credits selected from:

Course Title Credits
MATH 249Honours Complex Variables.3

Honours Complex Variables.

Terms offered: Winter 2026

Functions of a complex variable; Cauchy-Riemann equations; Cauchy's theorem and consequences. Taylor and Laurent expansions. Residue calculus; evaluation of real integrals; integral representation of special functions; the complex inversion integral. Conformal mapping; Schwarz-Christoffel transformation; Poisson's integral formulas; applications. Additional topics if time permits: homotopy of paths and simple connectivity, Riemann sphere, rudiments of analytic continuation.

MATH 466Honours Complex Analysis.3

Honours Complex Analysis.

Terms offered: this course is not currently offered.

Functions of a complex variable, Cauchy-Riemann equations, Cauchy's theorem and its consequences. Uniform convergence on compacta. Taylor and Laurent series, open mapping theorem, Rouch茅's theorem and the argument principle. Calculus of residues. Fractional linear transformations and conformal mappings.

3 credits selected from:

Course Title Credits
MATH 387Honours Numerical Analysis.3

Honours Numerical Analysis.

Terms offered: Winter 2026

Error analysis. Numerical solutions of equations by iteration. Interpolation. Numerical differentiation and integration. Introduction to numerical solutions of differential equations.

MATH 397Honours Matrix Numerical Analysis.3

Honours Matrix Numerical Analysis.

Terms offered: this course is not currently offered.

The course consists of the lectures of MATH 327 plus additional work involving theoretical assignments and/or a project. The final examination for this course may be different from that of MATH 327.

0-6 credits from the following courses for which no Honours equivalent exists:

Course Title Credits
MATH 204Principles of Statistics 2.3

Principles of Statistics 2.

Terms offered: Winter 2026

The concept of degrees of freedom and the analysis of variability. Planning of experiments. Experimental designs. Polynomial and multiple regressions. Statistical computer packages (no previous computing experience is needed). General statistical procedures requiring few assumptions about the probability model.

MATH 208Introduction to Statistical Computing.3

Introduction to Statistical Computing.

Terms offered: Fall 2025

Basic data management. Data visualization. Exploratory data analysis and descriptive statistics. Writing functions. Simulation and parallel computing. Communication data and documenting code for reproducible research.

MATH 308Fundamentals of Statistical Learning.3

Fundamentals of Statistical Learning.

Terms offered: Winter 2026

Theory and application of various techniques for the exploration and analysis of multivariate data: principal component analysis, correspondence analysis, and other visualization and dimensionality reduction techniques; supervised and unsupervised learning; linear discriminant analysis, and clustering techniques. Data applications using appropriate software.

MATH 329Theory of Interest.3

Theory of Interest.

Terms offered: Winter 2026

Simple and compound interest, annuities certain, amortization schedules, bonds, depreciation.

MATH 338History and Philosophy of Mathematics.3

History and Philosophy of Mathematics.

Terms offered: Fall 2025

Egyptian, Babylonian, Greek, Indian and Arab contributions to mathematics are studied together with some modern developments they give rise to, for example, the problem of trisecting the angle. European mathematics from the Renaissance to the 18th century is discussed, culminating in the discovery of the infinitesimal and integral calculus by Newton and Leibnitz. Demonstration of how mathematics was done in past centuries, and involves the practice of mathematics, including detailed calculations, arguments based on geometric reasoning, and proofs.

MATH 430Mathematical Finance.3

Mathematical Finance.

Terms offered: this course is not currently offered.

Introduction to concepts of price and hedge derivative securities. The following concepts will be studied in both concrete and continuous time: filtrations, martingales, the change of measure technique, hedging, pricing, absence of arbitrage opportunities and the Fundamental Theorem of Asset Pricing.

MATH 451Introduction to General Topology.3

Introduction to General Topology.

Terms offered: Winter 2026

This course is an introduction to point set topology. Topics include basic set theory and logic, topological spaces, separation axioms, continuity, connectedness, compactness, Tychonoff Theorem, metric spaces, and Baire spaces.

MATH 462Machine Learning .3

Machine Learning .

Terms offered: this course is not currently offered.

Introduction to supervised learning: decision trees, nearest neighbors, linear models, neural networks. Probabilistic learning: logistic regression, Bayesian methods, naive Bayes. Classification with linear models and convex losses. Unsupervised learning: PCA, k-means, encoders, and decoders. Statistical learning theory: PAC learning and VC dimension. Training models with gradient descent and stochastic gradient descent. Deep neural networks. Selected topics chosen from: generative models, feature representation learning, computer vision.

MATH 478Computational Methods in Applied Mathematics .3

Computational Methods in Applied Mathematics .

Terms offered: this course is not currently offered.

Solution to initial value problems: Linear, Nonlinear Finite Difference Methods: accuracy and stability, Lax equivalence theorem, CFL and von Neumann conditions, Fourier analysis: diffusion, dissipation, dispersion, and spectral methods. Solution of large sparse linear systems: iterative methods, preconditioning, incomplete LU, multigrid, Krylov subspaces, conjugate gradient method. Applications to, e.g., weighted least squares, duality, constrained minimization, calculus of variation, inverse problems, regularization, level set methods, Navier-Stokes equations

0-12 credits selected from:

Course Title Credits
COMP 362Honours Algorithm Design.3

Honours Algorithm Design.

Terms offered: this course is not currently offered.

Basic algorithmic techniques, their applications and limitations. Problem complexity, how to deal with problems for which no efficient solutions are known.

MATH 352Problem Seminar.1

Problem Seminar.

Terms offered: this course is not currently offered.

Seminar in Mathematical Problem Solving. The problems considered will be of the type that occur in the Putnam competition and in other similar mathematical competitions.

MATH 365Honours Groups, Tilings and Algorithms.3

Honours Groups, Tilings and Algorithms.

Terms offered: Winter 2026

Transformation groups of the plane. Inversions and Moebius transformations. The hyperbolic plane. Tilings in dimension 2 and 3. Group presentations and Cayley graphs. Free groups and Schreier's theorem. Coxeter groups. Dehn's Word and Conjugacy Problems. Undecidability of the Word Problem for semigroups. Regular languages and automatic groups. Automaticity of Coxeter groups.

MATH 377Honours Number Theory.3

Honours Number Theory.

Terms offered: this course is not currently offered.

This course consists of the lectures of MATH 346, but will be assessed at the honours level.

MATH 398Honours Euclidean Geometry .3

Honours Euclidean Geometry .

Terms offered: Fall 2025

Honours level: points and lines in a triangle. Quadrilaterals. Angles in a circle. Circumscribed and inscribed circles. Congruent and similar triangles. Area. Power of a point with respect to a circle. Ceva鈥檚 theorem. Isometries. Homothety. Inversion.

MATH 454Honours Analysis 3. 13

Honours Analysis 3.

Terms offered: Fall 2025

Measure theory: sigma-algebras, Lebesgue measure in R^n and integration, L^1 functions, Fatou's lemma, monotone and dominated convergence theorem, Egorov鈥檚 theorem, Lusin's theorem, Fubini-Tonelli theorem, differentiation of the integral, differentiability of functions of bounded variation, absolutely continuous functions, fundamental theorem of calculus.

MATH 455Honours Analysis 4.3

Honours Analysis 4.

Terms offered: Winter 2026

Review of point-set topology: topological spaces, dense sets, completeness, compactness, connectedness and path-connectedness, separability, Baire category theorem, Arzela-Ascoli theorem, Stone-Weierstrass theorem..Functional analysis: L^p spaces, linear functionals and dual spaces, Hilbert spaces, Riesz representation theorems. Fourier series and transform, Riemann-Lebesgue Lemma,Fourier inversion formula, Plancherel theorem, Parseval鈥檚 identity, Poisson summation formula.

MATH 456Honours Algebra 3.3

Honours Algebra 3.

Terms offered: Fall 2025

Groups, quotient groups and the isomorphism theorems. Group actions. Groups of prime order and the class equation. Sylow's theorems. Simplicity of the alternating group. Semidirect products. Principal ideal domains and unique factorization domains. Modules over a ring. Finitely generated modules over a principal ideal domain with applications to canonical forms.

MATH 457Honours Algebra 4.3

Honours Algebra 4.

Terms offered: Winter 2026

Representations of finite groups. Maschke's theorem. Schur's lemma. Characters, their orthogonality, and character tables. Field extensions. Finite and cyclotomic fields. Galois extensions and Galois groups. The fundamental theorem of Galois theory. Solvability by radicals.

MATH 458Honours Differential Geometry.3

Honours Differential Geometry.

Terms offered: Winter 2026

In addition to the topics of MATH 320, topics in the global theory of plane and space curves, and in the global theory of surfaces are presented. These include: total curvature and the Fary-Milnor theorem on knotted curves, abstract surfaces as 2-d manifolds, the Euler characteristic, the Gauss-Bonnet theorem for surfaces.

MATH 462Machine Learning .3

Machine Learning .

Terms offered: this course is not currently offered.

Introduction to supervised learning: decision trees, nearest neighbors, linear models, neural networks. Probabilistic learning: logistic regression, Bayesian methods, naive Bayes. Classification with linear models and convex losses. Unsupervised learning: PCA, k-means, encoders, and decoders. Statistical learning theory: PAC learning and VC dimension. Training models with gradient descent and stochastic gradient descent. Deep neural networks. Selected topics chosen from: generative models, feature representation learning, computer vision.

MATH 480Honours Independent Study.3

Honours Independent Study.

Terms offered: Summer 2025, Fall 2025, Winter 2026

Reading projects permitting independent study under the guidance of a staff member specializing in a subject where no appropriate course is available. Arrangements must be made with an instructor and the Chair before registration.

MATH 488Honours Set Theory.3

Honours Set Theory.

Terms offered: this course is not currently offered.

Axioms of set theory, ordinal and cardinal arithmetic, consequences of the axiom of choice, models of set theory, constructible sets and the continuum hypothesis, introduction to independence proofs.

1

Not open to students who have taken MATH 354.

All MATH 500-level courses.

Other courses with the permission of the Department.

Follow us on

Back to top