Paper Tayyari

Lecture 2: Truth Tables, Logical Equivalence and De Morgan's Laws

Notes, MCQs, short and long questions from lecture 2.Lecture 2 ke notes, MCQs, short aur long sawal.

61 MCQs61 MCQs

PDFLecture notesLecture notesThe whole lecture explained simply, with examples and practicePoora lecture aasan alfaaz mein, examples aur practice ke saath · 142 KBReadParhein →
Start mock testMock test shuru karein
DoneHal kiye 0/61
– correctsahi
1.

How many rows (not counting the heading row) does the truth table of a statement form with three variables p, q and r have?

  1. A4
  2. B6
  3. C8
  4. D9

2³ = 8 rows.3 variables hon to 2³ = 8 rows.

2.

How many rows (not counting the heading row) does the truth table of a statement form with two variables p and q have?

  1. A2
  2. B4
  3. C6
  4. D8

2² = 4 rows.2 variables hon to 2² = 4 rows.

3.

How many rows (not counting the heading row) does the truth table of a statement form with four variables p, q, r and s have?

  1. A16
  2. B8
  3. C12
  4. D32

2⁴ = 16 rows.4 variables hon to 2⁴ = 16 rows.

4.

A statement form has n different statement variables. How many rows does its truth table have?

  1. An
  2. B2n
  3. Cn²
  4. D2ⁿ

Each variable doubles the number of cases, so 2ⁿ rows.Har variable cases ko double kar deta hai, isliye 2ⁿ rows.

5.

In a truth table with three variables p, q and r written in the standard order of the handouts (first row T, T, T), the p column is:

  1. AT, T, T, T, F, F, F, F
  2. BT, F, T, F, T, F, T, F
  3. CT, T, F, F, T, T, F, F
  4. DF, F, F, F, T, T, T, T

p: four T then four F.p column: pehle chaar T, phir chaar F.

6.

In a truth table with three variables p, q and r written in the standard order of the handouts (first row T, T, T), the r column is:

  1. AT, T, T, T, F, F, F, F
  2. BT, T, F, F, T, T, F, F
  3. CT, F, T, F, T, F, T, F
  4. DT, T, T, T, T, T, T, T

r: T and F one by one.r column: T aur F baari baari.

7.

What is the best way to make the truth table of a long compound statement such as ~p ∧ (q ∨ ~r)?

  1. AGuess the final column directly
  2. BBreak it into smaller parts and make a separate column for each part
  3. CWrite only the first and the last column
  4. DFill every column with T

Work step by step: ~r, then q ∨ ~r, then ~p, then the final ∧.Step by step karein: pehle ~r, phir q ∨ ~r, phir ~p, aur aakhir mein ∧.

8.

For which values of p and q is the statement form ~p ∧ q true?

  1. Ap = T, q = T
  2. Bp = T, q = F
  3. Cp = F, q = T
  4. Dp = F, q = F

~p must be T (so p = F) and q must be T.~p ka T hona zaroori hai (yani p = F) aur q bhi T ho.

9.

What is the truth value of ~p ∧ q when p = T and q = T?

  1. AT
  2. BF
  3. CBoth T and F
  4. DCannot be determined

~p = F, and F ∧ T = F.~p = F, aur F ∧ T = F.

10.

What is the truth value of ~p ∧ q when p = F and q = F?

  1. AF
  2. BT
  3. CBoth T and F
  4. DCannot be determined

~p = T, and T ∧ F = F.~p = T, aur T ∧ F = F.

11.

In the complete truth table of ~p ∧ q (variables p and q), how many rows have the value T?

  1. A0
  2. B1
  3. C2
  4. D3

Only the row p = F, q = T.Sirf ek row: p = F, q = T.

12.

What is the truth value of ~p ∧ (q ∨ ~r) when p = F, q = F and r = T?

  1. AT
  2. BBoth T and F
  3. CF
  4. DCannot be determined

~r = F, q ∨ ~r = F, ~p = T, so T ∧ F = F.~r = F, q ∨ ~r = F, ~p = T, isliye T ∧ F = F.

13.

What is the truth value of ~p ∧ (q ∨ ~r) when p = F, q = F and r = F?

  1. AF
  2. BNot defined
  3. CBoth T and F
  4. DT

~r = T, q ∨ ~r = T, ~p = T, so T ∧ T = T.~r = T, q ∨ ~r = T, ~p = T, isliye T ∧ T = T.

14.

What is the truth value of ~p ∧ (q ∨ ~r) when p = T, q = T and r = T?

  1. AT
  2. BNot defined
  3. CF
  4. DBoth T and F

~p = F, so the whole ∧ statement is F.~p = F hai, isliye poori ∧ statement F hai.

15.

In the complete truth table of ~p ∧ (q ∨ ~r) (variables p, q and r), how many rows have the value T?

  1. A1
  2. B2
  3. C3
  4. D4

Rows (F,T,T), (F,T,F) and (F,F,F) are T.Rows (F,T,T), (F,T,F) aur (F,F,F) T hain.

16.

In the statement form ~p ∧ (q ∨ ~r), what happens whenever p is true?

  1. AThe statement is always F
  2. BThe statement is always T
  3. CThe statement is T only when q = T
  4. DThe statement is T only when r = F

If p = T then ~p = F, and F ∧ anything = F.Agar p = T to ~p = F, aur F ∧ kuch bhi = F.

17.

What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = T and q = T?

  1. AT
  2. BNot defined
  3. CF
  4. DSame as p

p ∨ q = T, ~(p ∧ q) = F, so T ∧ F = F.p ∨ q = T, ~(p ∧ q) = F, isliye T ∧ F = F.

18.

What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = T and q = F?

  1. AT
  2. BF
  3. CNot defined
  4. DBoth T and F

p ∨ q = T, ~(p ∧ q) = T, so T ∧ T = T.p ∨ q = T, ~(p ∧ q) = T, isliye T ∧ T = T.

19.

What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = F and q = F?

  1. AT
  2. BCannot be determined
  3. CBoth T and F
  4. DF

p ∨ q = F, so the whole ∧ statement is F.p ∨ q = F hai, isliye poori ∧ statement F hai.

20.

The statement form (p ∨ q) ∧ ~(p ∧ q) is true exactly when:

  1. ABoth p and q are true
  2. BBoth p and q are false
  3. CExactly one of p and q is true
  4. Dp is true, whatever q is

Its truth table is T only in the rows T,F and F,T.Is ki truth table sirf T,F aur F,T wali rows mein T hai.

21.

Two statement forms are called logically equivalent when:

  1. AThey use the same variables
  2. BThey have identical truth values in every row of their truth tables
  3. CThey have the same number of T values
  4. DThey have the same value in at least one row

Every single row must match.Har ek row ka match hona zaroori hai.

22.

Which symbol is used for logical equivalence?

  1. A↔
  2. B→
  3. C≡
  4. D∨

≡ is read "is logically equivalent to".≡ ko "is logically equivalent to" parha jata hai.

23.

Two statement forms have the same truth values in three rows but different truth values in one row. They are:

  1. ALogically equivalent
  2. BNot logically equivalent
  3. CBoth tautologies
  4. DNegations of each other

Even one different row means they are not equivalent.Sirf ek row bhi alag ho to wo equivalent nahi.

24.

To decide whether two statement forms are logically equivalent using a truth table, which columns are compared?

  1. AThe p and q columns
  2. BOnly the first row
  3. CThe number of rows
  4. DThe final columns of the two statement forms

Compare the two final columns row by row.Dono final columns ko row by row compare karein.

25.

Which of the following is the double negative property?

  1. A~(~p) ≡ ~p
  2. B~(~p) ≡ t
  3. C~p ≡ p
  4. D~(~p) ≡ p

Negating twice gives back the original statement.Do baar negation karne se wahi asal statement wapas mil jati hai.

26.

If p is false, what is the truth value of ~(~p)?

  1. AT
  2. BF
  3. CBoth T and F
  4. DNot defined

~(~p) ≡ p, so it is F.~(~p) ≡ p, isliye ye F hai.

27.

The statement "It is not true that I am not happy" is logically equivalent to:

  1. AI am happy
  2. BI am not happy
  3. CIt is not true that I am happy
  4. DI am happy and I am not happy

Let p = I am happy. The statement is ~(~p), which is ≡ p.p = I am happy. Ye statement ~(~p) hai, jo p ke ≡ hai.

28.

The statement "It is not true that Ali is not a student" is logically equivalent to:

  1. AAli is not a student
  2. BIt is not true that Ali is a student
  3. CAli is a student
  4. DAli is neither a student nor a teacher

Double negative: ~(~p) ≡ p.Double negative: ~(~p) ≡ p.

29.

Which pair of statement forms is logically equivalent?

  1. A~(p ∧ q) and ~p ∧ ~q
  2. Bp ∧ q and p ∨ q
  3. C~(~p) and p
  4. Dp and ~p

Double negative property.Double negative property.

30.

The statement forms ~(p ∧ q) and ~p ∧ ~q are:

  1. ALogically equivalent
  2. BNot logically equivalent
  3. CBoth tautologies
  4. DExactly the same statement

Their truth values differ in two rows.In ki truth values do rows mein alag hain.

31.

In a truth table written in the order (p, q) = (T,T), (T,F), (F,T), (F,F), in which rows do ~(p ∧ q) and ~p ∧ ~q have different truth values?

  1. ARows 1 and 4
  2. BRows 2 and 3
  3. COnly row 1
  4. DAll four rows

In rows 2 and 3, ~(p ∧ q) = T but ~p ∧ ~q = F.Row 2 aur 3 mein ~(p ∧ q) = T lekin ~p ∧ ~q = F.

32.

Let p = T and q = F. Which of the following is correct?

  1. A~(p ∧ q) is F and ~p ∧ ~q is T
  2. B~(p ∧ q) and ~p ∧ ~q are both T
  3. C~(p ∧ q) is T and ~p ∧ ~q is F
  4. D~(p ∧ q) and ~p ∧ ~q are both F

p ∧ q = F so ~(p ∧ q) = T; ~p = F so ~p ∧ ~q = F.p ∧ q = F, isliye ~(p ∧ q) = T; ~p = F, isliye ~p ∧ ~q = F.

33.

The equivalence (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) is:

  1. ATrue: both forms have the same truth values in all 8 rows
  2. BFalse: they differ when r = F
  3. CTrue only when p = T
  4. DFalse: brackets always change the meaning

Both are T only when p, q and r are all T.Dono sirf tab T hain jab p, q aur r teeno T hon.

34.

Are the statement forms (p ∧ q) ∨ r and p ∧ (q ∨ r) logically equivalent?

  1. AYes, in all rows
  2. BYes, but only when r = T
  3. CNo; for example when p = F, q = F and r = T the first is T but the second is F
  4. DThis cannot be checked with a truth table

One different row is enough to show they are not equivalent.Sirf ek alag row bhi yeh dikhane ke liye kaafi hai ke wo equivalent nahi.

35.

According to De Morgan's laws, ~(p ∧ q) is logically equivalent to:

  1. A~p ∨ ~q
  2. B~p ∧ ~q
  3. Cp ∨ q
  4. D~p ∨ q

The negation of an and statement is an or statement with each part negated.And statement ka negation ek or statement hai jis ka har hissa negate hota hai.

36.

According to De Morgan's laws, ~(p ∨ q) is logically equivalent to:

  1. A~p ∨ ~q
  2. Bp ∧ q
  3. C~p ∧ ~q
  4. D~p ∨ q

The negation of an or statement is an and statement with each part negated.Or statement ka negation ek and statement hai jis ka har hissa negate hota hai.

37.

According to De Morgan's laws, the negation of an "and" statement is logically equivalent to:

  1. AAn and statement in which each component is negated
  2. BAn or statement in which the components are not changed
  3. CThe same and statement
  4. DAn or statement in which each component is negated

~(p ∧ q) ≡ ~p ∨ ~q.~(p ∧ q) ≡ ~p ∨ ~q.

38.

According to De Morgan's laws, the negation of an "or" statement is logically equivalent to:

  1. AAn and statement in which each component is negated
  2. BAn or statement in which each component is negated
  3. CAn and statement in which the components are not changed
  4. DThe same or statement

~(p ∨ q) ≡ ~p ∧ ~q.~(p ∨ q) ≡ ~p ∧ ~q.

39.

When a negation sign ~ is moved inside brackets using De Morgan's laws, what happens?

  1. AOnly the first letter is negated
  2. BEach component is negated and ∧ changes to ∨ (or ∨ changes to ∧)
  3. CEach component is negated but the connective stays the same
  4. DThe brackets are removed and nothing else changes

Negate each part and swap and/or.Har hissa negate karein aur and/or ko badal dein.

40.

What is the negation of "The fan is slow or it is very hot"?

  1. AThe fan is not slow or it is not very hot
  2. BThe fan is slow and it is very hot
  3. CThe fan is not slow and it is not very hot
  4. DThe fan is not slow and it is very hot

or becomes and; both parts are negated.or, and ban jata hai aur dono hisse negate hote hain.

41.

What is the negation of "Akram is unfit and Saleem is injured"?

  1. AAkram is not unfit and Saleem is not injured
  2. BAkram is unfit or Saleem is injured
  3. CAkram is fit and Saleem is injured
  4. DAkram is not unfit or Saleem is not injured

and becomes or; both parts are negated.and, or ban jata hai aur dono hisse negate hote hain.

42.

What is the negation of "Ali is tall and Ahmed is short"?

  1. AAli is not tall or Ahmed is not short
  2. BAli is not tall and Ahmed is not short
  3. CAli is tall or Ahmed is short
  4. DAli is not tall and Ahmed is short

and becomes or; both parts are negated.and, or ban jata hai aur dono hisse negate hote hain.

43.

What is the negation of "It is cold or it is raining"?

  1. AIt is not cold or it is not raining
  2. BIt is not cold and it is not raining
  3. CIt is cold and it is raining
  4. DIt is not cold and it is raining

or becomes and; both parts are negated.or, and ban jata hai aur dono hisse negate hote hain.

44.

For a real number x, the inequality -1 < x ≤ 4 means:

  1. Ax > -1 or x ≤ 4
  2. Bx < -1 and x ≥ 4
  3. Cx > -1 and x ≤ 4
  4. Dx ≤ -1 or x > 4

A double inequality hides the word "and".Double inequality mein "and" chhupa hota hai.

45.

Using De Morgan's laws, the negation of -1 < x ≤ 4 (for a real number x) is:

  1. Ax ≤ -1 or x > 4
  2. Bx ≤ -1 and x > 4
  3. Cx > -1 or x ≤ 4
  4. Dx < -1 or x ≥ 4

x > -1 and x ≤ 4 becomes x ≤ -1 or x > 4.x > -1 and x ≤ 4 ban jata hai x ≤ -1 or x > 4.

46.

Using De Morgan's laws, the negation of 2 < x ≤ 7 (for a real number x) is:

  1. Ax < 2 or x ≥ 7
  2. Bx ≤ 2 and x > 7
  3. Cx > 2 or x ≤ 7
  4. Dx ≤ 2 or x > 7

x > 2 and x ≤ 7 becomes x ≤ 2 or x > 7.x > 2 and x ≤ 7 ban jata hai x ≤ 2 or x > 7.

47.

For a real number x, the negation of "x > -1" is:

  1. Ax < -1
  2. Bx ≥ -1
  3. Cx ≤ -1
  4. Dx > 1

The opposite of > is ≤.> ka ulat ≤ hai.

48.

For a real number x, the negation of "x ≤ 4" is:

  1. Ax ≥ 4
  2. Bx > 4
  3. Cx < 4
  4. Dx = 4

The opposite of ≤ is >.≤ ka ulat > hai.

49.

When the truth tables of ~(p ∨ q) and ~p ∧ ~q are compared, they:

  1. AHave the same truth values in all rows, so they are logically equivalent
  2. BDiffer in rows 2 and 3
  3. CDiffer only in row 1
  4. DAre both tautologies

This is De Morgan's second law.Ye De Morgan ka doosra law hai.

50.

What is the truth value of ~(p ∨ q) when p = F and q = F?

  1. AF
  2. BT
  3. CNot defined
  4. DBoth T and F

p ∨ q = F, so its negation is T.p ∨ q = F hai, isliye us ka negation T hai.

51.

Using De Morgan's laws and the double negative property, ~(~p ∧ q) is logically equivalent to:

  1. A~p ∨ ~q
  2. Bp ∧ ~q
  3. Cp ∨ ~q
  4. D~p ∧ q

~(~p) ∨ ~q, and ~(~p) ≡ p.~(~p) ∨ ~q, aur ~(~p) ≡ p.

52.

A tautology is a statement form that is:

  1. AAlways false
  2. BAlways true, whatever the truth values of its statement variables
  3. CTrue only when all variables are true
  4. DSometimes true and sometimes false

Definition from the handouts.Handouts ki definition.

53.

Which symbol represents a tautology in the handouts?

  1. AT
  2. B≡
  3. Cc
  4. Dt

A tautology is represented by t.Tautology ko t se dikhaya jata hai.

54.

Which of the following statement forms is a tautology?

  1. Ap ∨ ~p
  2. Bp ∧ ~p
  3. Cp ∧ q
  4. D~p

p ∨ ~p is T in every row.p ∨ ~p har row mein T hai.

55.

The statement form p ∨ ~p is logically equivalent to:

  1. Ap
  2. B~p
  3. Ct
  4. Dp ∧ ~p

p ∨ ~p ≡ t.p ∨ ~p ≡ t.

56.

In the truth table of a tautology, the final column contains:

  1. AOnly F
  2. BOnly T
  3. CExactly one T
  4. DAn equal number of T and F

A tautology is always true.Tautology hamesha true hoti hai.

57.

The sentence "It will rain today or it will not rain today" is:

  1. ANot a statement
  2. BAlways false
  3. CEquivalent to "It will rain today"
  4. DA tautology

It has the form p ∨ ~p.Is ki form p ∨ ~p hai.

58.

Is the statement form p ∧ q a tautology?

  1. AYes, because it is true in one row
  2. BYes, because it uses two variables
  3. CNo, because its final column contains F values
  4. DThis cannot be checked

p ∧ q is T only in one row.p ∧ q sirf ek row mein T hai.

59.

Is the statement form q ∨ ~q a tautology?

  1. ANo
  2. BOnly when q = T
  3. CYes, it is always true
  4. DOnly when q = F

Same form as p ∨ ~p.Is ki form bhi p ∨ ~p jaisi hai.

60.

If the final column of a truth table has at least one F, the statement form is:

  1. AA tautology
  2. BNot a tautology
  3. CLogically equivalent to t
  4. DAlways true

A tautology must be T in every row.Tautology ka har row mein T hona zaroori hai.

61.

How many rows (not counting the heading row) does the truth table of p ∨ ~p have?

  1. A1
  2. B4
  3. C2
  4. D8

Only one variable p, so 2¹ = 2 rows.Sirf ek variable p hai, isliye 2¹ = 2 rows.