Winter Term, 2013
Mathematics 238 - Discrete Mathematics
Instructor: Shane Bauman
Office: BA303E (Bricker Academic)
E-mail: [email protected]
Office Hours: Mon, Wed 2:30-4:30, available Tues/Thurs by appointment
All communication by e-mail only. I teach more
Good Algorithms and NP-Completeness
An algorithm is a finite set of precise instructions for solving a
problem.
An algorithm takes an input x. Let
binary encoding of x.
denote the length of the
An algorithm is called polytime (polynomial-time or good) if
MA238 Assignment #2 Due at the beginning of class on Friday, March 22
You may discuss these problems with anyone, but you must write up the solutions independently. At
the end of your assignment please list all the people that you consulted. Please sign y
NAME:
[3 marks]
[4 marks]
[3 marks]
Student ID:
MA238 Winter 2013 - Quiz 2
Total marks is 17. Answer all questions in the spaces provided. Calculators are not permitted.
1. (a) Represent the following graph G by an adjacency matrix. List the vertices in a