2006.semester.2

2006.semester.2 - CS202 - DISCRETE MATHEMATICS SEMESTER...

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

View Full Document Right Arrow Icon
* This is a closed book, closed notes examination. * Write your answers on the examination paper in ink or legible pencil. * If your answer cannot be read or understood , or if your answer is vague or confused, it will be marked wrong. * The numbers in parentheses after each question is the number of points allocated to that question. NAME ( Print Legibly. All Capitals ): PLEDGE ( Write Out In Full And Sign ): CS202 - D ISCRETE M ATHEMATICS S EMESTER E XAMINATION 2 F ALL 2006 Time Limit - Seventy Five Minutes
Background image of page 1

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

View Full DocumentRight Arrow Icon
Page 1 Department of Computer Science CS 202 University of Virginia Page score 1. For a non-directed graph G, the vertices are { v 1 , v 2 , v 3 , v 4 , v 5 } and the edges are { e 1 , e 2 , e 3 , e 4 , e 5 }. The edge-endpoint function is: (a) Draw a picture of this graph. (5) (b) List the degree of each vertex. (5) (c) Write the adjacency matrix for the graph. (5) (d) Is there a Hamiltonian cycle for this graph? If so, give it. If not, explain why not. (5) Edge Endpoints e 1 { v 1 , v 2 } e 2 { v 2 , v 3 } e 3 { v 4 , v 5 } e 4 { v 5 , v 1 } e 5 { v 4 , v 2 }
Background image of page 2
Page 2
Background image of page 3

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

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

Page1 / 6

2006.semester.2 - CS202 - DISCRETE MATHEMATICS SEMESTER...

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

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