Exam1 - AMS 301, Summer 2009 1 / 2 AMS 301 Finite...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: AMS 301, Summer 2009 1 / 2 AMS 301 Finite Mathematical Structures Ning SUN Exam 1: Jul 30 2009, 6:00-7:00pm Write all your answers on the answer sheet, using the backs of pages if needed. This exam is CLOSED BOOK. Please show all your work to get the full credit. Choose any FIVE of the seven questions. 1. True or False. If true, give a short proof. If false, give a counterexample. a) The edges of a planar graph can be colored by at most 5 colors. b) For every bipartite graph G, its complement must also be bipartite. c) For every connected graph G, the DFS tree on G and the BFS tree on G have the same number of edges. 2. Are there 2 graphs isomorphic? Give the isomorphism or explain why none exists. 3. A school is trying to schedule practice times for its various teams (football, basketball, fencing, academic, math, dance, etc.). Assume that each team practices for exactly one hour a week, and that the school must remain open while teams are practicing. Some students participate in more than one the school must remain open while teams are practicing....
View Full Document

This note was uploaded on 08/30/2010 for the course AMS 301 taught by Professor Arkin during the Spring '08 term at SUNY Stony Brook.

Page1 / 2

Exam1 - AMS 301, Summer 2009 1 / 2 AMS 301 Finite...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online