Computer Science 70 - Spring 2001 - Wagner - Midterm 1

Computer Science 70 - Spring 2001 - Wagner - Midterm 1 - CS...

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

View Full Document Right Arrow Icon
CS 70 Midterm 1 Solutions Midterm Exam 1 Solutions CS70 Blum/Wagner, 9 March 2001 This is a CLOSED BOOK examination. One page of notes is permitted. Calculators are permitted. Do all your work on the pages of this examination. Give reasons for all your answers. Problem 1 (Short answer grab-bag) [10 Points] For parts (a)-(c), justify your answer briefly. (a) [2 Points] True or False: (P => Q) => (Q => P) always holds, for all propositions P, Q. False. Counter example: P=False, Q=True. This is a converse error. (b) [3 Points] True or False: ((P v Q) => Q) => (Q => (P v Q)) always holds, for all propositions P, Q. True. (Q => (P v Q)) = True for all P,Q, and (anything => True) is true. (Don't be fooled into thinking this is another converse error. It's not.) (Common error: Not realizing that (False => False) is True.) (c) [3 Points] Recall that two sest S,T are said to be disjoint if = Ø. Can two events A and B be simultaneously independent and disjoint? Yes. An example: If A = Ø, then A isect B = Ø and Pr[A]=0. So, Pr[A isect B] = 0 = 0 × Pr[B] = Pr[A]Pr[B], and A,B are independent and disjoint. (d) [2 Points] Recall that two random variables X and Y are
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
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 Berkeley.

Page1 / 5

Computer Science 70 - Spring 2001 - Wagner - Midterm 1 - CS...

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

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