This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: a) Someone at UGA is a grad student, a TA, and a robot. b) No one at UGA is a grad student, a TA, and a robot. c) Everyone at UGA is a grad student and a TA, but not a robot. Csci 2610, Fall 2008 Exam 1 2008.09.10 3 6. (10 points) Use a symbolic proof to derive x(R(x) S(x)) from the premises x(P(x) (Q(x) S(x)) and x(P(x) R(x)). 7. (5 points) What is the result of the following bitwise operations? (0111 1100 0101 0000) (1100 0100) 8. (5 points) Demonstrate that x P(x) is not equivalent to x P(x) by providing a counterexample. The counterexample should consist of a definition and a universe of discourse for the predicate P(x) for which only one of the above statements is true. Csci 2610, Fall 2008 Exam 1 2008.09.10 4 9. (15 points) Prove that if n is odd, then n 2 + n is even....
View
Full
Document
This note was uploaded on 01/18/2012 for the course CSCI 2610 taught by Professor Smith during the Fall '08 term at UGA.
 Fall '08
 smith
 Computer Science

Click to edit the document details