IMS Engineering College

NH-09, Adhyatmik Nagar, Near Dasna, Distt. Ghaziabad, U.P.

Tel: (0120) 4940000

Department of Computer Science/ Computer Science & Design

Discrete structure and theory of logic-KCS303 (2022-2023)

Assignment 4

Maximum Marks: 20 Submission Date: 06-01-2023

COURSE OUTCOMES

By the end of the course, students will be able to:

CO No. Description Bloom’s
Level

C 205.1 Write an argument using logical notation and determine if the argument is K3, K4
or is not valid.

C 205.2 Understand the basic principles of sets and operations in sets. K1, K2

C 205.3 Demonstrate an understanding of relations and functions and be able to determine K2, K3
their properties.

C 205.4 Demonstrate different traversal methods for trees and graphs K2, K4

C 205.5 Model problems in Computer Science using graphs and trees. K2, K6

ATTEMPT ALL QUESTIONS each question carries equal marks

Q.
Question CO
No.
1. Construct the truth table for the following and state that whether it is a
C 205.1
tautology, contradiction or contingency?
1. (p Λ q) → (p V q)
2. (P ↔ ¬ Q) Λ (P → ¬ R)

2. Interpret the following without using Truth table:

C 205.1

1. (¬P Λ (¬Q Λ R)) V (Q Λ R) V (P Λ R) R

2. (P V Q) Λ (¬P Λ (¬P Λ Q)) ¬P Λ Q

3. “If the labour market is perfect then the wages of all persons in a particular C 205.1
employment will be equal. But it is always the case that wages for such
persons are not equal therefore the labour market is not perfect”. Test the
 validity of this argument using truth table.
Explain the following terms with suitable example :
4. i. Conjunction C 205.1
ii. Disjunction
iii. Conditional
iv. Converse
v. Contrapositive

5. 1. Consider the following conditional statement: If the flood destroy C 205.1

my house or the fires destroy my house, then my insurance
company will pay me. Write the converse, inverse and
contrapositive of the statement.
2. Express negations of the following sentences:
(i) ( Vx)( x 2> x)
(ii) (∃ x ) ( x 2=2)