cs70_sp09_mt1

# cs70_sp09_mt1 - CS70 Discrete Mathematics and Probability...

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
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: CS70 Discrete Mathematics and Probability Theory, Spring 2009 Midterm 1 6:00-8:00pm, 5 March Notes: There are six questions on this midterm. Answer each question part in the space below it, using the back of the sheet to continue your answer if necessary. If you need more space, use the blank sheet at the end. In both cases, be sure to clearly label your answers! None of the questions requires a very long answer, so avoid writing too much! Unclear or long-winded solutions may be penalized. The approximate credit for each question part is shown in the margin (total 60 points). Points are not necessarily an indication of difficulty! Your Name: Your Section: For official use; please do not write below this line! Q1 Q2 Q3 Q4 Q5 Q6 Total [exam starts on next page] 1. Logic In the following, P ( n ) and Q ( n ) denote propositions concerning the natural number n , and R ( m,n ) denotes a proposition concerning natural numbers m and n . Each part asserts a logical equivalence A ≡ B . For each part, say whether the equivalence is valid or invalid. You doeach part, say whether the equivalence is valid or invalid....
View Full Document

## This note was uploaded on 10/23/2010 for the course CS 70 taught by Professor Papadimitrou during the Spring '08 term at University of California, Berkeley.

### Page1 / 7

cs70_sp09_mt1 - CS70 Discrete Mathematics and Probability...

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

View Full Document
Ask a homework question - tutors are online