{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Exam1-Practice-solutions Computer Science

# Exam1-Practice-solutions Computer Science - CSRU 1100...

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

CSRU 1100 Structures of Computer Science Department of Computer and Information Sciences Fordham University Spring 2008 Exam #1 Practice Solutions Name: _____________________________________________________ This is a closed book, closed calculator, closed note exam. This practice exam is a little shorter than the actual exam. You should be able to complete it in 40 minutes. Integers = {…-2, -1, 0, 1, 2…} Naturals = {1, 2, 3, 4, 5…} Note: 0 is included in this instance Notation: AND OR IMPLIES NOT ¬ Points Score 1 20 2 24 3 24 Total 68

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

View Full Document
i. Write out complete truth tables for each of the following statements. The specify whether the logical statement is a tautology, contradiction, or neither. b) (a ¬ c) [(b a) (c b)] (10 points) Circle one: Tautology Contradiction Neither a b c ¬ c a ¬ c b a c b (b a) (c b) (a ¬ c) [(b a) (c b)] T T T F F T T T T T T F T T T F F F T F T F F T F F T T F F T T T F F F F T T F F T T T T F T F T F T F F T F F T F F F F T T F F F T F F F T T c) ¬ ( p ¬ q) (q ¬ p) (10 points) Circle one:
This is the end of the preview. Sign up to access the rest of the document.
• Spring '08
• uknown
• Transitive relation, A Closed Book, tautology contradiction, Computer Science Department of Computer and Information Sciences Fordham University

{[ snackBarMessage ]}

### Page1 / 4

Exam1-Practice-solutions Computer Science - CSRU 1100...

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

View Full Document
Ask a homework question - tutors are online