Scribd
Upload
343 views4 pages

Assignment 2 Mat210

This document contains an assignment submission for a Discrete Mathematics course. It lists the course code, assignment details including the question date and group member names. The assignment contains two questions: the first asks students to represent a logical statement using a truth table and show it is equivalent to another statement. The second questions provides an argument with three propositions and asks students to write the premises and determine the logical conclusion using rules of inference.

Uploaded by

lily chu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
343 views4 pages

Assignment 2 Mat210

This document contains an assignment submission for a Discrete Mathematics course. It lists the course code, assignment details including the question date and group member names. The assignment contains two questions: the first asks students to represent a logical statement using a truth table and show it is equivalent to another statement. The second questions provides an argument with three propositions and asks students to write the premises and determine the logical conclusion using rules of inference.

Uploaded by

lily chu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

CS110

DIPLOMA IN COMPUTER SCIENCE

MAT210
DISCRETE MATHEMATICS

ASSIGNMENT 2
PAST YEAR QUESTION - MARCH 2012
Group Members:-
NAME MATRIC NO.
Siti Hajar Nabila Binti Baharuddin 2018292728
Muhammad Aqil Anwar Bin Mohd Rosman 2018411666
Nurul Fatihah Binti Mohd Razale 2018220708

Lecturer’s Name:
Madam Noraini Binti Hasan

Submission Date:
17th January 2021
MAR4CH 2012
a)Consider the logical statement : [ ( ¬ p ∨ q) ∧ ¬ p] ∨ [ ( ¬ p ∧ q) ∨ ¬ q ]
i) Sketch a network to represent it.

Answer :
ii)Use a truth table to show that the above statement is logically equivalent to ¬ (p ∧ q).
Answer :

( ¬ p ∨ q) ∧ ¬ p ∨ ( ¬ p ∧ q) ∨ ¬ q
p q ¬p ¬p∨q ( ¬ p ∨ q) ¬p∧q ( ¬ p ∨ q) ∧ ¬ p ∨ ( ¬q ( ¬ p ∨ q) ∧ ¬ p ∨ ( ¬ p ∧ q) ∨ ¬ q
∧¬p ¬ p ∧ q)
F T F F F F F F F
F F F F F F F T T
T T T T T T T F T
T T T F T F T T T

¬ (p ∧ q)
p q p∧q ¬ (p ∧ q)
T T T F
T F F T
F T F T
F F F T
b) Given the following argument :

“Devork gets a raise if and only if he works hard. Devork buys a new car if he gets a raise.
Devork does not buy a new car.”

i)Write the three primary propositions using the variable p,q and r
ii)Write all the premises by using the variables in (i).
iii)Find the logical conclusion of the argument by using the rules of inference.

Answer :
i) p : Devork gets a raise
q : He works hard
r : Devork buys a new car

ii) P1 : p  q
P2 : r  p
P3 : ~ r

iii)

1. pq Premise 1
2. rp Premise 2
3. ~r Premise 3
4. rq 1,2 Syllogism
5. ~q 4,3 Modens Tollens

Conclusion : Devork did not works hard

You might also like