Math 442 Exams
Midterm, Tuesday 5th February 11.00-12.30,
Location MATX
1100
The midterm will cover chapters 1, 2, part of 4.
(Homeworks 1-4.) It is a closed-book exam: no books, notes, or
calculators
may be
used.
The topics covered are: Konigsburg bridge problem,
Knight's tour, sprouts, dice walks, parse trees, alkanes, people at a
party, complement, isomorphic, subgraphs, matrix representations, types
of graphs, Eulerian graphs, Hamiltonian graphs, planarity,
contractible, homeomorphic.
Extra office hour: Monday February 4th 3-4pm.
Practice questions: 1.4, 1.5, 1.20, 2.20, 2.33, 4.4 (justify your
answer). Answers are in the back of the book.
Some study hints:
- This is a Math Majors course, which means the exam will be about
50% proofs 50% calculation. You will be expected to prove results like
on the homework, or in class.
- To study efficiently make sure you know the definitions, the
algorithms/methods for computing things, the formulas for things, and
results/proof methods we use most often. Perhaps write them in your own
words, or explain them to a friend.
- Do the lecture examples, practice questions and old homeworks
again without looking at the answers.
- Go through the posted homework solutions to gain another point of
view on solving the questions.
- In the exam: If you
get stuck on a problem in the exam then write down relevant definitions
accurately. This will help to inspire you and pick up points for
working. If you use a result from class say "From the result in
class..." then state the result so the grader knows this isn't made up.
Final exam, Wednesday 24th April 12.00-14.30,
Location MATH 203
The final will cover the whole course. (Homeworks 1-11.) It is a
closed-book
exam: no books, notes, or calculators may be used.
The topis covered are: Konigsburg bridge problem,
Knight's tour, sprouts, dice walks, parse trees, alkanes, people at a
party, complement, isomorphic, subgraphs, matrix representations, types
of graphs, Eulerian graphs, Hamiltonian graphs, planarity,
contractible, homeomorphic, polyhedra, colouring, chromatic
number, chromatic poynomial, face colouring, edge colouring, chromatic
index, scheduling, trees, Prufer sequences, BFS, DFS, shortest/longest
path, minimal spanning trees, travelling saleman problem,
digraphs, network flows, max flow-min cut, critical path
analysis, latin squares.
Office hours: Monday April 22nd 10.30am-12pm.
Practice questions: 1.37, 1.48, 2.15, 2.36, 2.42, 3.9, 4.26, 5.7,
5.9, 6.20. Answers are in the back of the book.
Some study hints:
- This is a Math Majors course, which means the exam will be about
50% proofs 50% calculation. You will be expected to prove results like
on the homework, or in class.
- To study efficiently make sure you know the definitions, the
algorithms/methods for computing things, the formulas for things, and
results/proof methods we use most often. Perhaps write them in your own
words, or explain them to a friend.
- Do the lecture examples, practice questions and old homeworks
again without looking at the answers.
- Go through the posted homework solutions to gain another point of
view on solving the questions.
- In the exam: If you
get
stuck on a problem in the exam then write down relevant definitions
accurately. This will help to inspire you and pick up points for
working. If you use a result from class say "From the result in
class..." then state the result so the grader knows this isn't made up.
Back to
course
home page.