CSE331 HW0 - CSE 331: Introduction to Algorithm Analysis...

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

View Full Document Right Arrow Icon
CSE 331: Introduction to Algorithm Analysis and Design Fall 2011 Homework 0 Due Friday, September 2, 2011 in class by 1:15pm This homework is to refresh your memory on stuff you should have seen in CSE 191 and/or CSE 250. This homework is intended for you to start thinking about proofs again. This HW will not count towards your grade. We will grade any submitted HW– the idea is to give you back feedback where the stakes are a bit lower. If you are not comfortable writing proofs then it is recommended that you submit this one. On the other hand, if you have written many proofs and are comfortable with them, then you can probably skip this one. No collaboration is allowed on the first problem but collaboration is allowed for the other two problems. For more details, see the Homework Policy document. 1. ( What is a proof? ) (40 points ) Consider the following “proof”: Brad Pitt has a beard: 1 Every goat has a beard: 2 Hence, Brad Pitt is a goat. State precisely where the “proof” above fails logically.
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 12/11/2011 for the course CSE 331 taught by Professor Rudra during the Fall '11 term at SUNY Buffalo.

Page1 / 2

CSE331 HW0 - CSE 331: Introduction to Algorithm Analysis...

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