MCQ For Unit-2

206002 Empty set is a
Options - Correct answer: 3
(1) infinite set
(2) invalid set
(3) finite set
(4) none of these
206019 A set has n elements, then the number of elements in its power set is
(1) 2 n
(2) 2 mn
(3) 2 m+n
(4) 2 m−n
Questions in Unit-2
Topic: EQUIVALENCE OF PROPOSITIONS
179033 ┐(P ∨ Q) ⇔
(1) ┐P ∨ ┐Q
(2) P ∨ Q
(3) ┐P ∧ ┐Q
(4) P ∧ Q
https://edu.kalasalingam.ac.in/exam_quiz_report/658 33/133
179057 ┐(P ∧ Q) ⇔
(1) ┐P ∧ ┐Q
(2) ┐P ∨ ┐Q
(3) P ∨ Q
(4) P ∧ Q
Topic: IMPLICATION
179173 Symbolize the statement:
If either Ram takes C++ or Kumar takes ORACLE, then Latha will take JAVA.
(1) P ∨ Q ∨ R
(2) (P ∨ Q) → R
(3) P ∧ Q ∧ R
(4) P ⇔ ┐Q
179251 Let P: It is raining, Q: The sun is shining, R: There are clouds in the sky.
Symbolize the statement:
If it is not raining then the sun is not shining and there are clouds in the sky.
(1) ┐P → (┐Q ∧ R)
(2) R → (P ∨ Q)
(3) Q → (P ∧ R)
(4) R → (Q ∨ P )
The sun is shining if and only if it is not raining.
(1) P ↔ ┐Q
(2) ┐P ↔ ┐Q
(3) Q ↔ ┐P
(4) P → ┐Q
179342 Let P: The moon is out. Q: It is not snowing. R: Ram goes out for a walk.
If the moon is out and it is not snowing, then Ram goes out for a walk.
(1) R → (P ∨ Q)
(2) Q → (P ∧ R)
(3) R → (Q ∨ P )
(4) (P ∧ ┐Q) → R
179630 Let P: I finish writing my computer program before lunch. Q: I shall play tennis in the
afternoon. R: The sun is shining. S: The boundary is low.
Low boundary and sunshine are sufficient to play Tennis in this afternoon.
(1) (S ∨ R) → Q
(2) (S ∧ ┐R) → ┐Q
(3) (┐S ∧ ┐R) → ┐Q
(4) (S ∧ R) → Q
Topic: LAWS
177642 The law of logic P ∨ Q ⇔ Q ∨ P is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Absorption
177660 The law of logic P ∧ Q ⇔ Q ∧ P is called
(1) Distributive
(2) Commutative
(3) Idempotent
(4) Absorption
177690 The law of logic P ∨ (Q ∨ R) ⇔ (P ∨ Q) ∨ R is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177735 The law of logic P ∧ (Q ∧ R) ⇔ (P ∧ Q) ∧ R is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177756 The law of logic P ∧ (Q ∨ R) ⇔ (P ∧ Q) ∨ (P ∧ R) is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177823 The law of logic P ∨ (Q ∧ R) ⇔ (P ∨ Q) ∧ (P ∨ R) is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177875 The law of logic P ∨ (P ∧ Q) ⇔ P is called
(1) Absorption
(2) Commutative
(3) Distributive
(4) Idempotent
178027 The law of logic P ∧ (P ∨ Q) ⇔ P is called
(1) Absorption
(2) Commutative
(3) Distributive
(4) Idempotent
178367 The laws of logic (P ∧ P ) ⇔ P ; (P ∨ P ) ⇔ P are called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Absorption
Topic: NEGATION
178512 The product of variables and their negations is called the elementary
(1) product
(2) sum
(3) complete
(4) inverse
178541 The sum of variables and their negations is called the elementary
(1) product
(2) sum
(3) complete
(4) inverse
179075 If P is a proposition, then its negation is denoted by
(1) ┐P
(2) P
(3) T
(4) F
179444 Let P:The moon is out. Q: It is snowing. R : Ram goes out for a walk.
Symbolize the statement
It is not the case that Ram goes out for a walk if and only if it is not snowing or the moon is
out.
(1) P → (┐Q → R)
(2) ┐(R ↔ (┐Q ∨ P ))
(3) (P ∧ ┐Q) → R)
(4) R → (P ∨ Q)
179809 Let p: Ram is a graduate. q: Ram will get a job.

If Ram is not a graduate then he will not get a job.
(1) p → q
(2) ┐p → q
(3) ┐p → ┐q
(4) p → ┐q
Topic: PDNF AND PCNF

178582 Product consisting of all variables are called
(1) minterms
(2) maxterms
(3) minmaxterms
(4) maxminterms
178616 Sum consisting of all variables are called
(1) minterms
(2) maxterms
(3) minmaxterms
(4) maxminterms
178640 A formula which is equivalent to a given formula and which consists of a sum of elementary
products is called the
(1) Conjunctive Normal Form
(2) functionally complete
(3) Disjunctive Normal Form
(4) All the above
178681 A formula which is equivalent to a given formula and which consists of a product of
elementary sums is called the
(3) functionally complete
(4) All the above
178728 The Principle Disjunctive Normal Form of a given formula P is an equivalent given formula
consisting of disjunction of
(1) maxterms only
(2) minmaxterms only
(3) minterms only
(4) maxminterms only
178766 The Principle Conjunctive Normal Form of a given formula P is an equivalent given formula
consisting of conjunction of
(1) minterms only
(2) minmaxterms only
(3) maxminterms only
(4) maxterms only
178800 If a given formula is tautology, then its Principle Disjunctive Normal Form includes all the
possible
(1) maxterms of the variable.
(2) minmaxterms of the variable.
(3) maxminterms of the variable.
(4) minterms of the variable.
178942 P ∧ F ⇔
(1) P
(2) T
(3) F
(4) None of the above
179389 Consider the logical expression (P ∨ Q) ∧ (P ∨ R) ∧ (7Q ∨ P ) . The given logical expression
is
(3) Principal Conjunctive Normal Form
(4) Principal Disjunctive Normal Form
Topic: PROPOSITIONS
177207 A declarative statement is called
(1) proposition
(2) not proposition
(3) Truth values
(4) inverse
177234 A proposition consisting of two or more simple propositions is called
(1) not proposition
(2) compound proposition
(3) not compound proposition
(4) inverse proposition
177264 The disjunction of two propositions P and Q is denoted by
(1) P ∧ Q
(2) P ⊕ Q
(3) P ∨ Q
(4) P ⊖ Q
177303 The conjunction of two propositions P and Q is denoted by
(1) P ∨ Q
(2) P ⊕ Q
(3) P ⊖ Q
(4) P ∧ Q
177329 The conditional statement of P and Q is denoted by
(1) P→Q
(2) P←Q
(3) P ⊕ Q
(4) P ⊖ Q
177353 The biconditional statement of P and Q is denoted by
(1) P→Q
(2) P↔Q
(3) P ⊕ Q
(4) P ⊖ Q
177386 Symbolize the statement: If Ram is a computer science student, then he will study DBMS.
(1) P←Q
(2) P ⊕ Q
(3) P→Q
(4) P ⊖ Q
177413 Symbolize the statement: Raju appointed in Wipro or HCL
(1) P ∧ Q
(2) P ⊕ Q
(3) P ⊖ Q
(4) P ∨ Q
177452 Symbolize the statement: Rani wears a ring and chain.
(1) P ∨ Q
(2) P ∧ Q
(3) P ⊕ Q
(4) P ⊖ Q
177483 Symbolize the statement: You can take the flight if and only if you buy a ticket.
(1) P↔Q
(2) P←Q
(3) P ⊕ Q
(4) P ⊖ Q
177585 If P→ Q is a conditional statement then ┐Q → ~┐P is called
(1) Contradiction
(2) Equivalence
(3) Contrapositive
(4) Inverse
179115 P: The file system is full. Q : The automated reply can be sent.
Symbolize the statement
If the file system is full then the automated reply can not be sent.
(1) P → ┐Q
(2) P ∨ Q
(3) P ∧ Q
(4) P ⇔ ┐Q
If it is raining then there are clouds in the sky.
(1) R → P
(2) Q → P
(3) R → Q
(4) P → R
afternoon. R: The sun is shining. S: The boundary is low.
Symbolize the statement: If the sun is shining then I shall play tennis in the afternoon.
(1) R → Q
(2) R ∨ Q
(3) R ∧ Q
(4) R ⊕ Q
afternoon.
R: The sun is shining. S: The boundary is low.
Finishing the writing of my computer program before lunch is necessary for playing tennis in
this afternoon.
(1) R ∨ Q
(2) Q → P
(3) R ∧ P
(4) R ⊕ P
Topic: TAUTOLOGY AND CONTRADICTION

177516 A statement formula which is always true is called
(1) Contradiction
(2) Equivalence
(3) Tautology
(4) Contrapositive
177554 A statement formula which is always false is called
(1) Tautology
(2) Contradiction
(3) Equivalence
(4) Contrapositive
177609 P and Q are logically equivalent if P⇔Q is a
(1) Contradiction
(2) Implication
(3) Contrapositive
(4) Tautology
178480 Which of the following is tautology?
(1) P → Q
(2) P → 7Q
(3) (P → Q) ⇔ (7Q → 7P )
(4) None of these
Topic: TRUTH TABLE
179676 If p → q is a conditional statement then q → p is called
(1) converse
(2) contrapositive
(3) inverse
(4) equivalence
179706 If p → q is a conditional statement then ┐p → ┐q is called
(1) converse
(2) contrapositive
(3) inverse
(4) equivalence
179762 Let p: Ram is a graduate. q: Ram will get a job.

If Ram is a graduate then he will get a job.
(1) ┐p → q
(2) ┐p → ┐q
(3) p → q
(4) p → ┐q
179839 If p: T and q: F then p ∨ q is
(1) T
(2) F
(3) converse
(4) inverse
179866 If p: T and q: F then p → q is
(1) T
(2) F
(3) converse
(4) inverse
179891 If p: T and q: F then p ↔ q is
(1) T
(2) F
(3) converse
(4) inverse
179918 If p: F and q: F then p ↔ q is
(1) T
(2) F
(3) converse
(4) inverse
179949 If p: T and q: F then p ∧ q is
(1) T
(2) F
(3) converse
(4) inverse
179989 If p: T , q: F and r: F then (p ∧ q) ∧ r is
(1) F
(2) T
(3) converse
(4) inverse
180040 If p: T , q: F and r: T then (p ∧ q) ∧ r is
(1) T
(2) F
(3) converse
(4) inverse
Topic: TRUTH VALUES

178417 (P ∧ ┐P ) ⇔
(1) F
(2) T
(3) ┐P
(4) P
178451 P ∨ ┐P ⇔
(1) F
(2) T
(3) ┐P
(4) P
178829 P ∨ F ⇔
(1) P
(2) T
(3) F
178862 P ∧ T ⇔
(1) T
(2) P
(3) F
178892 P ∨ T ⇔
(1) P
(2) F
(3) T
178969 ┐(┐P ) ⇔
(1) P
(2) T
(3) F
213034 If p: T and q: F then ¬p ∨ q is
(1) T
(2) F
(3) converse
(4) inverse
213046 If p: T , q: F and r: F then (p ∨ q) ∨ r is
(1) T
(2) F
(3) converse
(4) inverse
213058 If p: T , q: F and r: F then (p ∧ q) ↔ r is
(1) T
(2) F
(3) converse
(4) inverse
213072 If p: T , q: F and r: T then (p ∨ q) ↔ r is
(1) F
(2) T
(3) converse
(4) inverse
213095 If p: T , q: F then p → (q → p) is
(1) converse
(2) inverse
(3) F
(4) T
213118 If p: T , q: F then (p ∧ q) → (p ∨ q) is
(1) converse
(2) inverse
(3) T
(4) F
213127 If p: T , q: F then (p ∧ q) → (p → q) is
(1) T
(2) F
(3) converse
(4) inverse
213143 If p: F , q: T then (p ∧ q) → (p → q) is
(1) T
(2) F
(3) converse
(4) inverse
213150 If p: F , q: T then p → (q → p) is
(1) T
(2) F
(3) converse
(4) Inverse
213167 If p: T then ¬(¬p)
(1) F
(2) T
(3) converse
(4) inverse
Questions in Unit-3
Topic: GENERATING FUNCTIONS
49907 The generating function of the sequence 1 n
,n ≥ 0 is ________.
(1) 1−x
1
(2) 1
(3) 2−x
1
(4) 1−x
2

MCQ For Unit-2

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MCQ For Unit-2

Uploaded by

Copyright:

Available Formats

206002 Empty set is a

Options - Correct answer: 3

(1) infinite set

(2) invalid set

(3) finite set

(4) none of these

Options - Correct answer: 1

Options - Correct answer: 3

Options - Correct answer: 2

Options - Correct answer: 2

Options - Correct answer: 1

Options - Correct answer: 3

Options - Correct answer: 4

Options - Correct answer: 4

(3) (┐S ∧ ┐R) → ┐Q

Options - Correct answer: 1

177660 The law of logic P ∧ Q ⇔ Q ∧ P is called

Options - Correct answer: 2

177690 The law of logic P ∨ (Q ∨ R) ⇔ (P ∨ Q) ∨ R is called

Options - Correct answer: 4

Options - Correct answer: 4

177756 The law of logic P ∧ (Q ∨ R) ⇔ (P ∧ Q) ∨ (P ∧ R) is called

Options - Correct answer: 2

177823 The law of logic P ∨ (Q ∧ R) ⇔ (P ∨ Q) ∧ (P ∨ R) is called

Options - Correct answer: 2

Options - Correct answer: 1

178027 The law of logic P ∧ (P ∨ Q) ⇔ P is called

Options - Correct answer: 1

178367 The laws of logic (P ∧ P ) ⇔ P ; (P ∨ P ) ⇔ P are called

Options - Correct answer: 3

Options - Correct answer: 1

Options - Correct answer: 2

179075 If P is a proposition, then its negation is denoted by

Options - Correct answer: 1

Options - Correct answer: 2

(2) ┐(R ↔ (┐Q ∨ P ))

179809 Let p: Ram is a graduate. q: Ram will get a job.

Options - Correct answer: 3

Topic: PDNF AND PCNF

Options - Correct answer: 1

Options - Correct answer: 2

Options - Correct answer: 3

(1) Conjunctive Normal Form

(2) functionally complete

(3) Disjunctive Normal Form

(4) All the above

Options - Correct answer: 2

(1) Disjunctive Normal Form

(2) Conjunctive Normal Form

(3) functionally complete

(4) All the above

Options - Correct answer: 3

(1) maxterms only

(2) minmaxterms only

(3) minterms only

(4) maxminterms only

Options - Correct answer: 4

(1) minterms only

(2) minmaxterms only

(3) maxminterms only

(4) maxterms only

Options - Correct answer: 4