MTH 210 Final: MTH 210 Final Exam 2009 Winter
Document Summary
Vic 608: verify that your paper contains 8 questions on 7 pages, you are allowed an 8 1. 2 11 formula sheet written on both sides: no other aids allowed. Electronic devices such as calculators, cellphones, pagers and ipods: no other aids allowed. Use of scrap paper or additional enclosures is not allowed. If you need more space continue on the back of the page, directing marker where the answer continues with a bold sign. Page 2: show that 2x x2 for every x 4, x n. (you may assume r2 2r + 1 for every r > 2. ) Page 3: let g = (v, e) be a graph of order n. (a) suppose that there is a vertex x v , where the degree of x is d and d n, use the. Mk: for this question l1 and l2 are regular languages, while the languages l3 and l4 are not regular.
