University of Galway

Course Module Information

Course Modules

Semester 1 | Credits: 5

This course deals with elementary enumeration, permutations, combinations, and graphs including eulerian and hamiltonian graphs.

Learning Outcomes
  1. Distinguish between orderings (permutations) and subsets (combinations).
  2. Count the size of unions and intersections of sets and solve elementary recurrences.
  3. Define and apply Binomial and multinomial coefficients to enumeration problems.
  4. Use tree graphs for enumeration.
  5. Use trees to write algebraic expressions in Polish and Reverse Polish notation.
  6. Define the notion of graph, eulerian, hamiltonian, bipartite and tree graphs.
  7. Define the notion of graph colourings and applications to scheduling problems.
Assessments
  • Written Assessment (80%)
  • Continuous Assessment (20%)
Teachers
Reading List
  1. ""Discrete Mathematics in the Schaum Outline series Discrete Mathematics; "" by N. L Biggs (OUP)
The above information outlines module MA204: "Discrete Mathematics" and is valid from 2015 onwards.
Note: Module offerings and details may be subject to change.