This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: CSE 260 Exam1, September 21,2005 Name: This exam has 4 pages and 7 problems totaling 100 points. This is closed book and closed notes. A student can bring in a 8 1/2x11 sheet of notes. 1. (5 pts) Construct a truth table for the following compound proposition: ( p q ) ( p q ) 2. (10 pts) Give a compound proposition corresponding to the following truth table. (for example, first row of the table means p=false, q=false, r=false, and P is true which is the result of a compound proposition.) p q r | P--------|---- 0 | 1 1 | 1 0 | 1 1 | 1 0 | 1 1 1 | 1 1 1 0 | 1 1 1 | 1 3. (10 pts) Show by constructing truth table that p q and ( p q ) ( p q ) are equivalent. 4. (25 pts) Answer True or False . [Where needed, assume the definitions of the following predicates for the universe of discourse is all integers. Even(x) is true iff x is an even integer. Odd(x) is true iff x is an odd integer. Prime(x) is true iff x is prime. GreaterThan(x,y) is true iff x is greater than...
View Full Document
- Spring '08
- Computer Science