Search Course Outline
6 course outlines found
1
MATHS 326
: Combinatorics2025 Semester One (1253)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 254, or 250 and a B+ or higher in COMPSCI 225
2
MATHS 326
: Combinatorics2024 Semester One (1243)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 254, or 250 and a B+ or higher in COMPSCI 225
3
MATHS 326
: Combinatorics2023 Semester One (1233)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 250 or 254, and a B+ or higher in COMPSCI 225
4
MATHS 326
: Combinatorics2022 Semester One (1223)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 254 or 255, or MATHS 250 and a B+ or higher in COMPSCI 225
5
MATHS 326
: Combinatorics2021 Semester One (1213)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 254 or 255, or MATHS 250 and a B+ or higher in COMPSCI 225, or a B+ or higher in both COMPSCI 225 and MATHS 208
6
MATHS 326
: Combinatorics2020 Semester One (1203)
Combinatorics is a branch of mathematics that studies collections of objects that satisfy specified criteria. An important part of combinatorics is graph theory, which is now connected to other disciplines including bioinformatics, electrical engineering, molecular chemistry and social science. The use of combinatorics in solving counting and construction problems is covered using topics that include algorithmic graph theory, codes and incidence structures, and combinatorial complexity.
Prerequisite: MATHS 254 or 255, or COMPSCI 225 and a B+ or higher in MATHS 208, or COMPSCI 225 and MATHS 250