0% found this document useful (0 votes)
19 views2 pages

Spring 2012 - MTH202 - 1

This document contains a student's homework assignment for their MTH202 course in Spring 2012. It includes two questions, with the student's solutions. Question 1 involves formulating an argument symbolically using propositional logic, and testing its validity using a truth table. Question 2 asks the student to construct a Boolean circuit for the expression (P∧ Q) ∨(P ∧Q) ~.

Uploaded by

Ameet
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
19 views2 pages

Spring 2012 - MTH202 - 1

This document contains a student's homework assignment for their MTH202 course in Spring 2012. It includes two questions, with the student's solutions. Question 1 involves formulating an argument symbolically using propositional logic, and testing its validity using a truth table. Question 2 asks the student to construct a Boolean circuit for the expression (P∧ Q) ∨(P ∧Q) ~.

Uploaded by

Ameet
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Assignment 1 Of MTH202 (Spring 2012) Name: Ameet Kumar Student Id:bc100202096

Question 1; Mark: 10 Formulate the argument symbolically and test its validity using the truth table. Also mention the critical row (or rows). If you finish your home work, then you will sleep early. If you will sleep early, then you will get up for 8:30am class. Therefore if you finish your home work, then you will get up for 8:30am class. Where p = you finish your home work, q = you will sleep early, r = you will get up for 8:30am class. Solution: Pq Qr P^r P T T T T F F F F Q T T F F T T F F R T F T F T F T F Pq T T F F T T T T Qr T F T T T F F T P^r T F T F F F F F

Question 2; 5 Construct circuit for Boolean expression (Mention output at each step) (P Q) (P Q) ~ Solution:
P~ Q

Marks:

P Q

Edraw Trial Version


~Q

Edraw Trial Version


PQ

(P~ Q) (P Q)

P Q

Edraw Trial Version

You might also like