Midterm Solutions | Discrete Structures | CS 381, Exams of Discrete Structures and Graph Theory

Material Type: Exam; Class: DISCRETE STRUCTURES; Subject: Computer Science; University: Old Dominion University; Term: Unknown 1989;

Typology: Exams

Pre 2010

Uploaded on 02/12/2009

koofers-user-jhc
koofers-user-jhc 🇺🇸

9 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1

Partial preview of the text

Download Midterm Solutions | Discrete Structures | CS 381 and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

Se [whens CS 381 Midterm Rewiew 1. Prove that ((a > sb) A (a a b)) is a contradiction using logical equivalences. 2 pts. ' Feo it © fo. v 1b) A (arb) Deluihon of Sweplica How. 2) a(a 4 b) A (aa b) De Morgans ® F Tetviel contra diction Proof 2: © Ga v 3 alan b) Defiuidion of tmp licahine © (a v 1b) aa) Ab Associative law @ (a. Ga vrb))ab Commutative laud @ G A na) vla a76)) ab Distr betve leew © ( Fou (a 4 11)) A b Test vial Cortadhita, Dar (abi Assocntne law Tetvie[ Contra dichorn @ e Douduetton