The negation of "Today is Friday" is
- AToday is Saturday
- BToday is not Friday
- CToday is Thursday
Negation just adds "not".Negation mein sirf "not" lagta hai.
Syllabus: lectures 1–22. Past-paper MCQs are shown first.Syllabus: lecture 1–22. Past paper ki MCQs pehle dikhai gayi hain.
161 MCQs · 3 short · 2 long questions · 35 MCQs from past papers161 MCQs · 3 short · 2 long sawal · 35 MCQs past papers se
The negation of "Today is Friday" is
Negation just adds "not".Negation mein sirf "not" lagta hai.
The contrapositive of the conditional statement p → q is
Contrapositive: negate both parts and swap them.Contrapositive: dono hisson ko negate karein aur jagah badal dein.
The statement p → q ≡ ~p ∨ q ≡ ~(p ∧ ~q) describes the
These are the implication laws for rewriting p → q.Ye implication laws hain jo p → q ko doosri shakal mein likhte hain.
{a} ∈ {a}, i.e. {a} is an element of {a}.
The only element of {a} is a, not {a}. So {a} ⊆ {a}, but {a} ∉ {a}.{a} ka sirf ek element a hai, {a} nahi. Isliye {a} ⊆ {a} sahi hai, lekin {a} ∉ {a}.
The same element can never appear twice in a set.
A set lists distinct elements; repeating one does not change the set.Set mein alag alag elements hote hain; dobara likhne se set nahi badalta.
If two sets are not equal, then one must be a subset of the other.
{1} and {2} are not equal, and neither is a subset of the other.{1} aur {2} barabar nahi, aur koi bhi doosre ka subset nahi.
If A ∪ B = A, then A ∩ B = B.
A ∪ B = A means B ⊆ A, so A ∩ B = B.A ∪ B = A ka matlab B ⊆ A, isliye A ∩ B = B.
Which of these is the distributive law of union over intersection for three sets?
∪ distributes over ∩; the first two are associative laws.∪, ∩ par distribute hota hai; pehle do associative laws hain.
Let A be a subset of the universal set U. The double complement law is:
Taking the complement twice gives back the original set.Complement do baar lene se wahi asal set wapas mil jata hai.
Let A and B be subsets of the universal set U. Then (A ∪ B)ᶜ =
De Morgan's law: the complement of a union is the intersection of the complements.De Morgan ka law: union ka complement, complements ka intersection hota hai.
Let A, B, C be subsets of the universal set U. Then the Idempotent law is:
Idempotent law: A ∩ A = A (and A ∪ A = A). A ∩ Aᶜ = ∅ is true too, but it is the complement law.Idempotent law: A ∩ A = A (aur A ∪ A = A). A ∩ Aᶜ = ∅ bhi sahi hai, lekin wo complement law hai.
Which of these is the associative law of intersection for three sets?
Associative law: the grouping of ∩ does not matter.Associative law: ∩ mein brackets ki jagah se farq nahi parta.
If a set A has 5 elements, then the number of elements in its power set P(A) is
A set with n elements has 2ⁿ subsets: 2⁵ = 32.n elements wale set ke 2ⁿ subsets hote hain: 2⁵ = 32.
Let A = {a, b, c} and R = {(a, c), (b, b), (c, a)} be a relation on A. R is
(a, c) and (c, a) are both in R; it is not transitive because (a, a) is missing.(a, c) aur (c, a) dono R mein hain; (a, a) nahi, isliye transitive nahi.
A binary relation R on A such that (t, t) ∉ R for every t in A is
No element is related to itself: irreflexive.Koi element khud se related nahi: irreflexive.
The inverse of the relation R = {(1,1), (1,2), (1,4), (3,4), (4,1)} is
Swap each pair: (a, b) becomes (b, a).Har pair ko ulat dein: (a, b) ban jata hai (b, a).
Given A = {a, b} and B = {1, 2, 3}, the number of functions from A to B is ____.
Each of the 2 elements of A can go to any of the 3 elements of B: 3 × 3 = 3² = 9.A ke 2 elements mein se har ek B ke 3 elements mein se kisi par bhi ja sakta hai: 3 × 3 = 3² = 9.
Which of these relations are functions? R₁ = {(3,4), (4,5), (6,7), (8,9)}, R₂ = {(3,4), (4,5), (6,7), (3,9)}, R₃ = {(−3,4), (4,−5), (0,0), (8,9)}, R₄ = {(8,11), (34,5), (6,17), (8,19)}
In R₂, 3 goes to both 4 and 9; in R₄, 8 goes to both 11 and 19. A function gives each input only one output.R₂ mein 3 ke do outputs hain (4 aur 9), aur R₄ mein 8 ke do (11 aur 19). Function mein har input ka sirf ek output hota hai.
The number of functions from a set with 3 elements to a set with 2 elements is
Each of the 3 elements has 2 choices: 2³ = 8.3 elements mein se har ek ke 2 choices: 2³ = 8.
If f(x) = 2x + 1 and g(x) = x² − 1, then f(g(x)) =
f(g(x)) = 2(x² − 1) + 1 = 2x² − 1.f(g(x)) = 2(x² − 1) + 1 = 2x² − 1.
If f and g are two one-to-one functions, then their composition g ∘ f is
A composition of one-to-one functions is one-to-one.One-to-one functions ki composition bhi one-to-one hoti hai.
If f(4) = 1 and g(1) = 4, then (f ∘ g)(1) =
(f ∘ g)(1) = f(g(1)) = f(4) = 1.(f ∘ g)(1) = f(g(1)) = f(4) = 1.
If a set contains exactly m distinct elements, where m is a non-negative integer, then the set is
A set with a fixed whole number of elements is finite.Jis set ke elements ki ginti mukarrar ho wo finite hai.
If f(x) = x and g(x) = −2x, then (f + g)(x) =
x + (−2x) = −x.x + (−2x) = −x.
Which term of the sequence 4, 1, −2, … is −77?
aₙ = 4 − 3(n − 1) = −77 gives n = 28.aₙ = 4 − 3(n − 1) = −77 se n = 28.
1, 10, 10², 10³, 10⁴, … is a
Each term is 10 times the previous one, and the terms are listed (not added).Har term pichhli ka 10 guna hai, aur terms list hain (jama nahi ho raheen).
Σ (j = 1 to 3) (3j − 5) =
(−2) + 1 + 4 = 3.(−2) + 1 + 4 = 3.
The part of a definition that is expressed in terms of smaller versions of itself is called
A recursive clause defines new cases using smaller ones.Recursive hissa naye cases ko chhote cases ke zariye define karta hai.
A collection of rules indicating how to form new set objects from those already known to be in the set is called
The recursion clause builds new elements from old ones.Recursion ka hissa purane elements se naye elements banata hai.
Subtraction (−) is a binary operation on the set of integers.
The difference of any two integers is always an integer.Do integers ka difference hamesha integer hi hota hai.
Let A be a subset of the universal set U. Then Aᶜ =
The complement of A is everything in U that is not in A.A ka complement U ke wo tamam elements hain jo A mein nahi.
The properties of being symmetric and being anti-symmetric are ____.
A relation can be both symmetric and anti-symmetric (e.g. equality) or neither, so one is not the negative of the other.Ek relation symmetric aur anti-symmetric dono ho sakti hai (jaise equality) ya dono nahi, isliye ye ek doosre ka negative nahi.
Which of the following is always true for the matrix of a symmetric relation?
Symmetric means (a, b) in R gives (b, a) in R, so entry (i, j) equals entry (j, i).Symmetric ka matlab hai (a, b) R mein ho to (b, a) bhi ho, isliye entry (i, j) aur (j, i) barabar hoti hain.
In Boolean addition, 1 + 1 =
Boolean addition works like OR, so 1 + 1 = 1.Boolean addition OR ki tarah hai, isliye 1 + 1 = 1.
The total number of elements in a set is called its
Cardinality is the number of elements.Elements ki ginti ko cardinality kehte hain.
Discrete Mathematics concerns processes that consist of:
Lecture definition: processes with a sequence of individual steps.Lecture ki definition: aise processes jin mein alag alag steps ki sequence ho.
Which of these is an example of a discrete set?
Integers are separate points (..., -1, 0, 1, ...) with gaps between them.Integers alag alag points (..., -1, 0, 1, ...) hain jin ke beech gaps hain.
The set of real numbers is:
Real numbers have no gaps, so they are continuous.Real numbers mein koi gap nahi, isliye yeh continuous hain.
"Discrete Mathematics with Applications" is written by:
Recommended book 1: Susanna S. Epp (second edition).Recommended book 1: Susanna S. Epp (second edition).
"Discrete Mathematics and Its Applications" is written by:
Recommended book 2: Kenneth H. Rosen (fourth edition).Recommended book 2: Kenneth H. Rosen (fourth edition).
One course objective is to "prove a formula using ______".
Objective 6: Prove a formula using mathematical induction.Objective 6: mathematical induction se formula prove karna.
Logic is the study of the principles and methods that distinguish between:
Lecture definition of Logic.Yeh lecture mein di gayi Logic ki definition hai.
A statement is a declarative sentence that is:
Definition of a statement.Yeh statement ki definition hai.
Another name for a statement is:
A statement is also called a proposition.Statement ko proposition bhi kehte hain.
The truth values "true" and "false" are denoted by:
True = T, False = F.True = T, False = F.
Which of the following is a statement?
It can be judged true or false. The others are an order, a question and an unknown x.Isay true ya false keh sakte hain. Baqi ek order, ek sawal aur ek unknown x hain.
Which of the following is NOT a statement?
x and y are unknown, so we cannot say true or false.x aur y unknown hain, isliye hum true ya false nahi keh sakte.
"4 + 2 = 7" is:
A false sentence is still a statement; its truth value is F.Ghalat sentence bhi statement hi hai; uski truth value F hai.
"May I come in?" is not a statement because it is:
Questions are neither true nor false.Sawal na true hote hain na false.
"Close the door." is not a statement because it is:
Orders are neither true nor false.Orders na true hote hain na false.
The sentence "x is greater than 2" (with nothing before it) is:
Without knowing x we cannot decide true or false.x pata kiye baghair hum true ya false decide nahi kar sakte.
If we first say "x = 1", then the sentence "x > 2" is:
Now x is known: 1 > 2 is false.Ab x pata hai: 1 > 2 false hai.
"Bill Gates is an American. He is very rich." Here "He is very rich" is:
The first sentence makes "He" clear, so it becomes a true statement.Pehla sentence "He" ko clear kar deta hai, isliye yeh true statement ban jata hai.
A sentence with a pronoun (he/she) or a variable (x) becomes a statement when:
This is the rule given in the lecture.Yeh lecture mein diya gaya rule hai.
"Logic is interesting." is:
The lecture lists it as a statement.Lecture mein isay statement likha gaya hai.
"He is very rich" (with nothing before it) is:
We do not know who "He" is.Humein nahi pata ke "He" kaun hai.
A compound statement is built by:
Simple statements + connectives (and, or, not) = compound statement.Simple statements + connectives (and, or, not) = compound statement.
Which words are called logical connectives in Lecture 1?
AND, OR, NOT are logical connectives.AND, OR, NOT logical connectives hain.
Statements are represented symbolically by:
We use small letters p, q, r, ...Hum chhote letters p, q, r, ... use karte hain.
The symbol for negation (not) is:
Negation = not = ~Negation = not = ~
The symbol ∧ is called:
∧ = Hat (used for and).∧ = Hat (and ke liye use hota hai).
The symbol ∨ is called:
∨ = Vel (used for or).∨ = Vel (or ke liye use hota hai).
The symbol ~ is called:
~ = Tilde (used for not).~ = Tilde (not ke liye use hota hai).
Conjunction means:
Conjunction = and = ∧Conjunction = and = ∧
Disjunction means:
Disjunction = or = ∨Disjunction = or = ∨
The connective "if…then" is called:
Conditional = if…then = →Conditional = if…then = →
The symbol for the biconditional (if and only if) is:
Biconditional = ↔ (Double arrow).Biconditional = ↔ (Double arrow).
The symbol → is called:
→ = Arrow (Conditional).→ = Arrow (Conditional).
The symbol ↔ is called:
↔ = Double arrow (Biconditional).↔ = Double arrow (Biconditional).
p = "Islamabad is the capital of Pakistan", q = "17 is divisible by 3". Then p ∧ q is:
∧ = and.∧ = and.
Let p = "Islamabad is the capital of Pakistan" and q = "17 is divisible by 3". Then p ∨ q is:
∨ = or.∨ = or.
Let p = "Islamabad is the capital of Pakistan". Then ~p is:
~p = not p. It can also be said: Islamabad is not the capital of Pakistan.~p = not p. Isay yun bhi keh sakte hain: Islamabad is not the capital of Pakistan.
Let p = "It is hot", q = "It is sunny". "It is not hot" is:
not hot = ~pnot hot = ~p
Let p = "It is hot" and q = "It is sunny". "It is hot and sunny" in symbols is:
and = ∧and = ∧
Let p = "It is hot" and q = "It is sunny". "It is hot or sunny" in symbols is:
or = ∨or = ∨
Let p = "It is hot" and q = "It is sunny". "It is not hot but sunny" in symbols is:
not hot = ~p, but = ∧, sunny = qnot hot = ~p, but = ∧, sunny = q
Let p = "It is hot" and q = "It is sunny". "It is neither hot nor sunny" in symbols is:
neither…nor = not p AND not qneither…nor ka matlab = not p AND not q
In logic, the English word "but" is translated as:
"but" works like "and"."but" bilkul "and" ki tarah kaam karta hai.
The phrase "neither p nor q" is written as:
Both are negated and joined with ∧.Dono ko negate karke ∧ se joda gaya hai.
Let h = "Zia is healthy", w = "Zia is wealthy", s = "Zia is wise". "Zia is healthy and wealthy but not wise" is:
healthy and wealthy = h ∧ w, but not wise = ∧ ~shealthy and wealthy = h ∧ w, but not wise = ∧ ~s
Let h = "Zia is healthy", w = "Zia is wealthy" and s = "Zia is wise". "Zia is not wealthy but he is healthy and wise" in symbols is:
not wealthy = ~w, but = ∧, healthy and wise = h ∧ snot wealthy = ~w, but = ∧, healthy and wise = h ∧ s
Let h = "Zia is healthy", w = "Zia is wealthy" and s = "Zia is wise". "Zia is neither healthy, wealthy nor wise" in symbols is:
All three are negated and joined with ∧.Teeno ko negate karke ∧ se joda gaya hai.
Let m = "Ali is good in Mathematics", c = "Ali is a Computer Science student". ~c means:
~ = not~ = not
Let m = "Ali is good in Mathematics" and c = "Ali is a Computer Science student". Then c ∨ m means:
∨ = or∨ = or
Let m = "Ali is good in Mathematics" and c = "Ali is a Computer Science student". Then m ∧ ~c means:
m = good in Maths, ∧ ~c = but not a CS studentm = good in Maths, ∧ ~c = but not a CS student
A truth table shows:
If p is true, then ~p is:
Negation gives the opposite value.Negation ulti value deta hai.
If p is false, then ~p is:
Negation gives the opposite value.Negation ulti value deta hai.
How many rows (without the heading) does the truth table of ~p have?
One letter → 2 cases: T and F.Ek letter → 2 cases: T aur F.
How many rows (without the heading) does a truth table with two statements p and q have?
Two letters → 4 cases: TT, TF, FT, FF.Do letters → 4 cases: TT, TF, FT, FF.
p ∧ q is true when:
Conjunction is true only when both are true.Conjunction sirf tab true hai jab dono true hon.
If p = T and q = F, then p ∧ q is:
One part is false, so ∧ is false.Ek part false hai, isliye ∧ false hai.
In the truth table of p ∧ q, how many rows give the result T?
Only the TT row.Sirf TT wali row.
Disjunction (∨) is also called:
Lecture heading: Disjunction or INCLUSIVE OR.Lecture ki heading: Disjunction or INCLUSIVE OR.
p ∨ q is false only when:
Disjunction is false only in the FF row.Disjunction sirf FF wali row mein false hai.
If p = F and q = T, then p ∨ q is:
At least one part is true, so ∨ is true.Kam az kam ek part true hai, isliye ∨ true hai.
If p = F and q = F, then p ∨ q is:
Both parts are false, so ∨ is false.Dono parts false hain, isliye ∨ false hai.
In the truth table of p ∨ q, how many rows give the result T?
TT, TF and FT are true; only FF is false.TT, TF aur FT true hain; sirf FF false hai.
If p = T and q = T, then ~p ∧ q is:
~p = F, and F ∧ T = F.~p = F hai, aur F ∧ T = F.
If p = F and q = F, then ~p ∧ ~q is:
~p = T and ~q = T, so T ∧ T = T.~p = T aur ~q = T, isliye T ∧ T = T.
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.
Find (f ∘ g)(x) if f(x) = x² + 1 and g(x) = 2x + 2.
(f ∘ g)(x) = f(g(x)) = (2x + 2)² + 1 = 4x² + 8x + 5.
f: ℝ → ℝ is defined by f(x) = x³. Show that f is bijective.
One-to-one: if x³ = y³ then x = y (the real cube root is unique). Onto: for any real y, x = ∛y is real and f(x) = y. Since f is one-to-one and onto, it is bijective.
Consider the geometric progression 5/7, 5/49, 5/343, … (i) Find the common ratio r. (ii) Find the nth term. (iii) Find the sum to infinity.
(i) r = (5/49)/(5/7) = 1/7. (ii) aₙ = a·rⁿ⁻¹ = (5/7)(1/7)ⁿ⁻¹ = 5/7ⁿ. (iii) Since |r| < 1, S∞ = a/(1 − r) = (5/7)/(6/7) = 5/6.
Using a truth table, determine whether [~q ∨ (q → p)] → ~p is a tautology.
Rows (p, q): (T, T): ~q ∨ (q → p) = F ∨ T = T, ~p = F, so T → F = F. (T, F): T → F = F. (F, T): ~q ∨ (q → p) = F ∨ F = F, so F → T = T. (F, F): T → T = T. The final column has F in two rows, so it is not a tautology.
In a circuit, inputs X and Y go into an AND gate; its output and input Z go into an OR gate; the OR output goes through a NOT gate to give S. Write the input/output table for X = 1, Y = 0, Z = 0.
S = ~((X ∧ Y) ∨ Z). X ∧ Y = 1 ∧ 0 = 0; (X ∧ Y) ∨ Z = 0 ∨ 0 = 0; S = ~0 = 1. Table: X = 1, Y = 0, Z = 0 → X∧Y = 0 → (X∧Y)∨Z = 0 → S = 1.