2005.semester.1

2005.semester.1 - 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 1 F ALL 2005 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. By building one or more truth tables, show that the following relation is true: (10) Ø(p Ù q) Ü Øp Ú Øq 2. Write down the power set of the set S = { a, b, c }. (10) 3. Write a predicate using the integer variable x that is true if the value of x is greater than one and less than ten. (10)
Background image of page 2
Page 2 Department of Computer Science CS 202 University of Virginia Page score 4. For the sets A = {red, green, white, black, blue},
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 / 5

2005.semester.1 - 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