Computer Science 70 - Spring 2002 - Vazirani - Midterm 1

Computer Science 70 - Spring 2002 - Vazirani - Midterm 1 -...

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

View Full Document Right Arrow Icon
CS 70 file:///C:/Documents%20and%20Settings/Jason%20Raftery/Desktop/R. .. 1 of 5 5/12/2006 8:44 PM CS 70 Discrete Mathematics for CS Spring 2002 Vazirani Midterm 1 PRINT your name: ____________________________SID________________________ This is a CLOSED BOOK examination. Do all your work on the pages of this examination. Give reasons for all your answers. 1. (15 pts.) Satisfiability and all that For each of the following Boolean expressions, decide if it is (i) valid (ii) satisfiable (iii) unsatisfiable. (Give all applicable properties.) (a) (10) [(P ===> Q) ^ (Q ===> R)] ===> (P ===> R) (b) (5) ~(P ===> Q) ^ ~(Q ===> P) CS 70, Spring 2002 Midterm 1 2. (Each 10 pts.) Logic and Proofs (a) Can you define open sentences (i.e., sentences whose truth value depends on some variable x) P(x) and Q(x) and a universe U so that (for all x in U)(P(x) ==> Q(x)) is false, and (for all x in U)(Q(x) ==> P(x)) is false?
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS 70 file:///C:/Documents%20and%20Settings/Jason%20Raftery/Desktop/R. .. 2 of 5
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 09/26/2009 for the course CS 70 taught by Professor Papadimitrou during the Fall '08 term at University of California, Berkeley.

Page1 / 5

Computer Science 70 - Spring 2002 - Vazirani - Midterm 1 -...

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

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