How many rows (not counting the heading row) does the truth table of a statement form with three variables p, q and r have?
- A4
- B6
- C8
- D9
2³ = 8 rows.3 variables hon to 2³ = 8 rows.
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 →How many rows (not counting the heading row) does the truth table of a statement form with three variables p, q and r have?
2³ = 8 rows.3 variables hon to 2³ = 8 rows.
How many rows (not counting the heading row) does the truth table of a statement form with two variables p and q have?
2² = 4 rows.2 variables hon to 2² = 4 rows.
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?
2⁴ = 16 rows.4 variables hon to 2⁴ = 16 rows.
A statement form has n different statement variables. How many rows does its truth table have?
Each variable doubles the number of cases, so 2ⁿ rows.Har variable cases ko double kar deta hai, isliye 2ⁿ rows.
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:
p: four T then four F.p column: pehle chaar T, phir chaar F.
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:
r: T and F one by one.r column: T aur F baari baari.
What is the best way to make the truth table of a long compound statement such as ~p ∧ (q ∨ ~r)?
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 ∧.
For which values of p and q is the statement form ~p ∧ q true?
~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.
What is the truth value of ~p ∧ q when p = T and q = T?
~p = F, and F ∧ T = F.~p = F, aur F ∧ T = F.
What is the truth value of ~p ∧ q when p = F and q = F?
~p = T, and T ∧ F = F.~p = T, aur T ∧ F = F.
In the complete truth table of ~p ∧ q (variables p and q), how many rows have the value T?
Only the row p = F, q = T.Sirf ek row: p = F, q = T.
What is the truth value of ~p ∧ (q ∨ ~r) when p = F, q = F and r = T?
~r = F, q ∨ ~r = F, ~p = T, so T ∧ F = F.~r = F, q ∨ ~r = F, ~p = T, isliye T ∧ F = F.
What is the truth value of ~p ∧ (q ∨ ~r) when p = F, q = F and r = F?
~r = T, q ∨ ~r = T, ~p = T, so T ∧ T = T.~r = T, q ∨ ~r = T, ~p = T, isliye T ∧ T = T.
What is the truth value of ~p ∧ (q ∨ ~r) when p = T, q = T and r = T?
~p = F, so the whole ∧ statement is F.~p = F hai, isliye poori ∧ statement F hai.
In the complete truth table of ~p ∧ (q ∨ ~r) (variables p, q and r), how many rows have the value T?
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.
In the statement form ~p ∧ (q ∨ ~r), what happens whenever p is true?
If p = T then ~p = F, and F ∧ anything = F.Agar p = T to ~p = F, aur F ∧ kuch bhi = F.
What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = T and q = T?
p ∨ q = T, ~(p ∧ q) = F, so T ∧ F = F.p ∨ q = T, ~(p ∧ q) = F, isliye T ∧ F = F.
What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = T and q = F?
p ∨ q = T, ~(p ∧ q) = T, so T ∧ T = T.p ∨ q = T, ~(p ∧ q) = T, isliye T ∧ T = T.
What is the truth value of (p ∨ q) ∧ ~(p ∧ q) when p = F and q = F?
p ∨ q = F, so the whole ∧ statement is F.p ∨ q = F hai, isliye poori ∧ statement F hai.
The statement form (p ∨ q) ∧ ~(p ∧ q) is true exactly when:
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.
Two statement forms are called logically equivalent when:
Every single row must match.Har ek row ka match hona zaroori hai.
Which symbol is used for logical equivalence?
≡ is read "is logically equivalent to".≡ ko "is logically equivalent to" parha jata hai.
Two statement forms have the same truth values in three rows but different truth values in one row. They are:
Even one different row means they are not equivalent.Sirf ek row bhi alag ho to wo equivalent nahi.
To decide whether two statement forms are logically equivalent using a truth table, which columns are compared?
Compare the two final columns row by row.Dono final columns ko row by row compare karein.
Which of the following is the double negative property?
Negating twice gives back the original statement.Do baar negation karne se wahi asal statement wapas mil jati hai.
If p is false, what is the truth value of ~(~p)?
~(~p) ≡ p, so it is F.~(~p) ≡ p, isliye ye F hai.
The statement "It is not true that I am not happy" is logically equivalent to:
Let p = I am happy. The statement is ~(~p), which is ≡ p.p = I am happy. Ye statement ~(~p) hai, jo p ke ≡ hai.
The statement "It is not true that Ali is not a student" is logically equivalent to:
Double negative: ~(~p) ≡ p.Double negative: ~(~p) ≡ p.
Which pair of statement forms is logically equivalent?
Double negative property.Double negative property.
The statement forms ~(p ∧ q) and ~p ∧ ~q are:
Their truth values differ in two rows.In ki truth values do rows mein alag hain.
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?
In rows 2 and 3, ~(p ∧ q) = T but ~p ∧ ~q = F.Row 2 aur 3 mein ~(p ∧ q) = T lekin ~p ∧ ~q = F.
Let p = T and q = F. Which of the following is correct?
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.
The equivalence (p ∧ q) ∧ r ≡ p ∧ (q ∧ r) is:
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.
Are the statement forms (p ∧ q) ∨ r and p ∧ (q ∨ r) logically equivalent?
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.
According to De Morgan's laws, ~(p ∧ q) is logically equivalent to:
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.
According to De Morgan's laws, ~(p ∨ q) is logically equivalent to:
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.
According to De Morgan's laws, the negation of an "and" statement is logically equivalent to:
~(p ∧ q) ≡ ~p ∨ ~q.~(p ∧ q) ≡ ~p ∨ ~q.
According to De Morgan's laws, the negation of an "or" statement is logically equivalent to:
~(p ∨ q) ≡ ~p ∧ ~q.~(p ∨ q) ≡ ~p ∧ ~q.
When a negation sign ~ is moved inside brackets using De Morgan's laws, what happens?
Negate each part and swap and/or.Har hissa negate karein aur and/or ko badal dein.
What is the negation of "The fan is slow or it is very hot"?
or becomes and; both parts are negated.or, and ban jata hai aur dono hisse negate hote hain.
What is the negation of "Akram is unfit and Saleem is injured"?
and becomes or; both parts are negated.and, or ban jata hai aur dono hisse negate hote hain.
What is the negation of "Ali is tall and Ahmed is short"?
and becomes or; both parts are negated.and, or ban jata hai aur dono hisse negate hote hain.
What is the negation of "It is cold or it is raining"?
or becomes and; both parts are negated.or, and ban jata hai aur dono hisse negate hote hain.
For a real number x, the inequality -1 < x ≤ 4 means:
A double inequality hides the word "and".Double inequality mein "and" chhupa hota hai.
Using De Morgan's laws, the negation of -1 < x ≤ 4 (for a real number x) is:
x > -1 and x ≤ 4 becomes x ≤ -1 or x > 4.x > -1 and x ≤ 4 ban jata hai x ≤ -1 or x > 4.
Using De Morgan's laws, the negation of 2 < x ≤ 7 (for a real number x) is:
x > 2 and x ≤ 7 becomes x ≤ 2 or x > 7.x > 2 and x ≤ 7 ban jata hai x ≤ 2 or x > 7.
For a real number x, the negation of "x > -1" is:
The opposite of > is ≤.> ka ulat ≤ hai.
For a real number x, the negation of "x ≤ 4" is:
The opposite of ≤ is >.≤ ka ulat > hai.
When the truth tables of ~(p ∨ q) and ~p ∧ ~q are compared, they:
This is De Morgan's second law.Ye De Morgan ka doosra law hai.
What is the truth value of ~(p ∨ q) when p = F and q = F?
p ∨ q = F, so its negation is T.p ∨ q = F hai, isliye us ka negation T hai.
Using De Morgan's laws and the double negative property, ~(~p ∧ q) is logically equivalent to:
~(~p) ∨ ~q, and ~(~p) ≡ p.~(~p) ∨ ~q, aur ~(~p) ≡ p.
A tautology is a statement form that is:
Definition from the handouts.Handouts ki definition.
Which symbol represents a tautology in the handouts?
A tautology is represented by t.Tautology ko t se dikhaya jata hai.
Which of the following statement forms is a tautology?
p ∨ ~p is T in every row.p ∨ ~p har row mein T hai.
The statement form p ∨ ~p is logically equivalent to:
p ∨ ~p ≡ t.p ∨ ~p ≡ t.
In the truth table of a tautology, the final column contains:
A tautology is always true.Tautology hamesha true hoti hai.
The sentence "It will rain today or it will not rain today" is:
It has the form p ∨ ~p.Is ki form p ∨ ~p hai.
Is the statement form p ∧ q a tautology?
p ∧ q is T only in one row.p ∧ q sirf ek row mein T hai.
Is the statement form q ∨ ~q a tautology?
Same form as p ∨ ~p.Is ki form bhi p ∨ ~p jaisi hai.
If the final column of a truth table has at least one F, the statement form is:
A tautology must be T in every row.Tautology ka har row mein T hona zaroori hai.
How many rows (not counting the heading row) does the truth table of p ∨ ~p have?
Only one variable p, so 2¹ = 2 rows.Sirf ek variable p hai, isliye 2¹ = 2 rows.
No MCQs match this filter.Is filter mein koi MCQ nahi.
No short questions added yet.Abhi koi short sawal shamil nahi.
No long questions added yet.Abhi koi long sawal shamil nahi.