CSE 1101- Discrete Mathematics for Computer Science WkSheet 2

(Last Name, First Name): ______________________________________________________________

Logic 2: Algebra of Propositions and Logic Applications
1. Show that:

a) ¬ ( p → q ) ≡ p ∧¬ q d) ¬ ( p ∨¬ q ) ∨ ( ¬ p ∧¬ q ) ≡¬ p
b) ¬¿ e) ( p ↔q ) ≡( p ∧q )∨(¬ p ∧¬ q)
c) [ p ∧ (¬ p∨ q ) ]∨ q ≡q

2. Show that( p ∧q ) → ( p ∨ q ) is a tautology.

3. Determine whether the system specifications are consistent.

- “The diagnostic message is stored in the buffer or it is retransmitted”
- “The diagnostic message is not stored in the buffer”
- If the diagnostic message is not stored in the buffer, then it is retransmitted”

4. Are these system specifications consistent?

- The system is in multiuser state if and only if it is operating normally.
- If the system is operating normally, the kernel is functioning.
- The kernel is not functioning or the system is in interrupt mode.
- If the system is not in multiuser state, then it is interrupt mode.
- The system is not in interrupt mode.

5. Indicate the output of the following circuits:

a) b)

6. Find the Boolean expression corresponding to the following logic circuits.

a) b)

1|Page
Course Instructor: A. Baksh
 7. Construct a circuit from the following Boolean expressions:

a) b) .

8. Design a circuit for the following input/output table, hence draw the
logic circuit.

Notes: Logical Operators

Operator Read
Not
It is false that
~, ¬
It is not the case that
It is not true that
And
Operator Precedence
But ~, ¬ 1
∧ Still ∧ 2
Notes:
However ∨ 3
Precedence of → 4
nevertheless
Logical ↔ 5
Or
∨ Operators
Otherwise
If p, then q
p implies q
p only if q
p is sufficient for q
q is necessary for p
p →q
q if p
q whenever p
q follows from p
q when p
q unless ~p
p is necessary and sufficient for q
p ↔q if p then q, and conversely
2|Page
Course Instructor: A. Baksh p if and only if q