Scribd
Upload
14 views

Assignment On Logic

Vce 1/2 spesh

Uploaded by

4bpg4wvzrf
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
14 views

Assignment On Logic

Vce 1/2 spesh

Uploaded by

4bpg4wvzrf
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Assignment on Logic

Total: 33 marks

Question 1 (1 mark )

Give the truth table for the compound statement p ∧ ¬q.

Question 2 ( 1 mark)

Write the Boolean expression for: p or q, and p or r

Question 3 ( 2 marks)

Determine the missing connectives between p, q and r in the last column of the following
truth table.

p q r p?q?r
T T T T
T T F T
T F T T
F T T T
T F F F
F T F F
F F T T
F F F F
p □q □ r

Question 4 ( 2 marks)

Use truth tables to establish if (¬p ⇒ q) ⇔ (p ⇒ ¬q).


Question 5 ( 1 mark)
Which of the following is a negation of ‘All plongs are umple’?
A. No plongs are umple.
B. All plongs are not umple.
C. No plongs are not umple.
D. Some plongs are umple.
E. Some plongs are not umple.

Question 6 ( 1 mark)

Question 7 ( 3 marks)

Determine using Boolean algebra if (P ∧ Q) ∨ ¬Q and P ∨ ¬Q are equivalent.

Question 8 ( 3 marks)
Show using the truth table [¬ (p ∨ q)] ∨[(¬p) ∧ q] ∨ p is a tautology
Question 11 ( 3 marks)
Show using table of values [(p ∨ q)] ∧ [(¬p) ∧(¬ q)] is a contradiction.

Question 12 ( 3 marks)
Simplify the Boolean expression (𝑨′ 𝑽𝑩) ∧ (𝑨𝑽𝑩)
Question 13
Complete the truth table (4 marks)

Question 14 (1+2+2+2 =7 marks)

a Give the Boolean function f (x,y,z) corresponding to this circuit.


(Do not simplify)
b Complete the table of values for this function.

x y z y1 x∧ z (x∧z) V y yVz y∧𝒛 x V (y∧z) f(x,y,z)


0 0 0 1

0 0 1 1

0 1 0 0

0 1 1 0

1 0 0 1

1 0 1 1

1 1 0 0

1 1 1 0

c. The expression from a can be simplified to an expression of the form ----- ^------
Determine this simplified expression.

d. Draw the circuit for this simplified expression.


Question 15 ( 2+2+2 = 6 marks)

Let f (x, y, z) be the Boolean function whose truth table is given below.

x y z f (x,y,z)
0 0 0 1

0 0 1 0

0 1 0 1

0 1 1 0

1 0 0 0

1 0 1 0

1 1 0 1

1 1 1 0

a. Express the function f (x,y,z) in terms of x, y and z in such a way that only
negation (¬)and the logical connectives ∨ and ∧ are used.
b. Find an equivalent formulation for f (x, y, z) that uses only ¬ and ∨.

c. Find an equivalent formulation of f (x, y, z) uses only ¬ and ^.

END OF ASSIGNMENT

You might also like