CS 2603 — APPLIEDLOGICFORHARDWAREANDSOFTWARE9/26/07Midterm Examination 1Fall 20071Consider the following proposition.(((a ∨b) ∧(b ∨c)) ∧(¬b))a) How many rows would a truth table for the proposition have?c) Classify the proposition as satisfiable, tautology, or contradiction.2a) Diagram a digital circuit representing the proposition of problem 1.b) Rewrite the proposition of problem 1 in proof-checker notation.3a) Supply the missing details in this proof. Assume it cites inference rules only, not theorems.b) Draw a box around each discharged assumption.c) State the theorem that the proof confirms.Use natural deduction to prove the following theorems, citing inference rules or theorems stated in the form of inference rules on the cribsheet.4a→ (b → c) |- (a ∧b) → c5(b∨c) ∧a |- (a ∧b) ∨(a ∧c)Prove the following equations using the laws and theorems of Boolean algebra stated on the
This is the end of the preview. Sign up
access the rest of the document.