Math 442 Exams

Midterm, Tuesday 7th February 14.00-15.30, Location  SWNG 121

The topics covered are:  Konigsburg bridge problem,  Knight's tour, dice walks, sprouts, parse trees, alkanes, people at a party, complement, isomorphic, subgraphs, matrix representations, types of graphs, Eulerian graphs, Hamiltonian graphs and applications, planarity, contractible, homeomorphic.

Extra office hour:  Monday 6th February 4-5pm.

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:

1. 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.
2. 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.
3. Do the lecture examples, practice questions and old homeworks again without looking at the answers.
4. Go through the posted homework solutions to gain another point of view on solving the questions.
5. 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, Monday 24th April 15.30-18.00, Location LSK 201

The topics covered are:  Konigsburg bridge problem,  Knight's tour, dice walks, sprouts, parse trees, alkanes, people at a party, complement, isomorphic, subgraphs, matrix representations, types of graphs, Eulerian graphs, Hamiltonian graphs and applications, planarity, contractible, homeomorphic, polyhedra, dual graph, line graph, colouring, chromatic number, chromatic polynomial, face colouring, edge colouring, chromatic index, scheduling, trees, Prufer sequences, BFS, DFS, shortest path, minimal spanning trees, travelling salesman problem,  digraphs, network flows,  max flow-min cut, longest path.

Office hours: Thursday April 20th 11am-1pm.

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. Plus find the longest distance and path from A to L in Figure 2.37. Answer is Figure 2.38. 

Some study hints:

1. 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.
2. 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.
3. Do the lecture examples, practice questions and old homeworks again without looking at the answers.
4. Go through the posted homework solutions to gain another point of view on solving the questions.
5. 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.