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.
Notes, MCQs, short and long questions from lecture 1.Lecture 1 ke notes, MCQs, short aur long sawal.
66 MCQs · 1 MCQ from past papers66 MCQs · 1 MCQ past papers se
PDFLecture notesLecture notesThe whole lecture explained simply, with examples and practicePoora lecture aasan alfaaz mein, examples aur practice ke saath · 138 KBReadParhein →The negation of "Today is Friday" is
Negation just adds "not".Negation mein sirf "not" lagta hai.
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.
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.