Exam1-Practice-solutions Computer Science

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

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

View Full Document Right Arrow Icon
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
Background image of page 1

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

View Full DocumentRight Arrow Icon
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
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 10/19/2008 for the course CSRU 1100 taught by Professor Uknown during the Spring '08 term at Fordham.

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 Right Arrow Icon
Ask a homework question - tutors are online