Midterm Exam Solved | 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-j1m
koofers-user-j1m 🇺🇸

8 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 Exam Solved | Discrete structures | CS 381 and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

§ & Given a set of premises, construct a proof using the rules of inference. Premise 1: (a b) v 7a Premise 2: b > ¢ Premise 3: € <> ¢ Prove that a— e @ (aa va) A (na vb) Dishkilubve law applied +o Tremise ( (a) tT A Ga Qa vo) Trvial tatologu, tO © (ad's Ldeutly law apptes © @ = ( Kole ys . ab bweG urtion of puepl ication © ate o Hypothe-lreae sy llega of Snel ae © 20 4 (e2O tehurken of <> ’ @ Qe ess wel! Grealrox af © @ awe Hyprtotiont sy (ozs cpplred te © cus, Let A= {0, 3, 9} and B={-1, 1, 3,6, 11}. @.& a. What is A UB? 3-4 0,1, 3, ©, F, 6 b. What is ANB? {53 c. Is(A-B)>(B-A)? Neo, d. IsBc(BOA)? Neo