2005.final

# 2005.final - CS202 DISCRETE MATHEMATICS FINAL EXAMINATION...

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

* 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 ): READ THE QUESTION BEFORE YOU ANSWER IT CS202 - D ISCRETE M ATHEMATICS F INAL E XAMINATION F ALL 2005 Time Limit - Three Hours

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

View Full Document
Page 1 Department of Computer Science CS 202 University of Virginia Page score 1. Give an example of English text that is a proposition. (5) 2. Give an example of English text that is not a proposition. (5) 3. Give an example of English text that is a predicate. (5) 4. Give an example of English text that is neither a proposition nor a predicate. (5) 5. Give an example of English text that is a proposition whose formalization would make use of an existential quantifier. (5) 6. Give an example of English text that is a proposition whose formalization would make use of a universal quantifier. (5)
Page 2 Department of Computer Science CS 202 University of Virginia Page score 7. Draw a bipartite graph representation of the cartesian product A x B given A = {a, b, c} and B = {x, y} where the end points of each edge in the graph are a two-tuple from the product. (10)

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 10/10/2009 for the course CS 2102 taught by Professor Knight during the Spring '08 term at UVA.

### Page1 / 9

2005.final - CS202 DISCRETE MATHEMATICS FINAL EXAMINATION...

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

View Full Document
Ask a homework question - tutors are online