Paper Tayyari

Midterm PreparationMidterm ki tayyari

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

Start mock testMock test shuru karein
DoneHal kiye 0/161
– correctsahi
1.
★ Midterm Fall 2009Lecture 1

The negation of "Today is Friday" is

  1. AToday is Saturday
  2. BToday is not Friday
  3. CToday is Thursday

Negation just adds "not".Negation mein sirf "not" lagta hai.

2.
★ Midterm Fall 2009Lecture 3

The contrapositive of the conditional statement p → q is

  1. A~p → ~q
  2. Bq → p
  3. C~q → ~p
  4. DNone of these

Contrapositive: negate both parts and swap them.Contrapositive: dono hisson ko negate karein aur jagah badal dein.

3.
★ Midterm Fall 2009Lecture 3

The statement p → q ≡ ~p ∨ q ≡ ~(p ∧ ~q) describes the

  1. ACommutative law
  2. BImplication laws
  3. CExportation law
  4. DEquivalence

These are the implication laws for rewriting p → q.Ye implication laws hain jo p → q ko doosri shakal mein likhte hain.

4.
★ MTH202 Quiz (Lectures 7–15)Lecture 7

{a} ∈ {a}, i.e. {a} is an element of {a}.

  1. AFalse
  2. BTrue

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}.

5.
★ Midterm Fall 2009Lecture 7

The same element can never appear twice in a set.

  1. ATrue
  2. BFalse

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.

6.
★ Midterm Fall 2009Lecture 7

If two sets are not equal, then one must be a subset of the other.

  1. ATrue
  2. BFalse

{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.

7.
★ Midterm Fall 2009Lecture 8

If A ∪ B = A, then A ∩ B = B.

  1. ATrue
  2. BFalse
  3. CCannot be determined

A ∪ B = A means B ⊆ A, so A ∩ B = B.A ∪ B = A ka matlab B ⊆ A, isliye A ∩ B = B.

8.
★ Final term Spring 2010Lecture 9

Which of these is the distributive law of union over intersection for three sets?

  1. AA ∪ (B ∪ C) = (A ∪ B) ∪ C
  2. BA ∩ (B ∩ C) = (A ∩ B) ∩ C
  3. CA ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
  4. DNone of these

∪ distributes over ∩; the first two are associative laws.∪, ∩ par distribute hota hai; pehle do associative laws hain.

9.
★ MTH202 Quiz (Lectures 7–15)Lecture 9

Let A be a subset of the universal set U. The double complement law is:

  1. A(Aᶜ)ᶜ = U − A
  2. B(Aᶜ)ᶜ = ∅
  3. C(Aᶜ)ᶜ = A
  4. D(Aᶜ)ᶜ = U

Taking the complement twice gives back the original set.Complement do baar lene se wahi asal set wapas mil jata hai.

10.
★ MTH202 Quiz (Lectures 7–15)Lecture 9

Let A and B be subsets of the universal set U. Then (A ∪ B)ᶜ =

  1. AAᶜ ∪ Bᶜ
  2. BAᶜ ∩ Bᶜ
  3. CA − Bᶜ
  4. DA ∪ 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.

11.
★ MTH202 Quiz (Lectures 7–15)Lecture 9

Let A, B, C be subsets of the universal set U. Then the Idempotent law is:

  1. AA ∪ Aᶜ = A
  2. BA ∩ A = A
  3. CA ∩ Aᶜ = A
  4. DA ∩ Aᶜ = ∅

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.

12.
★ Midterm Fall 2009Lecture 9

Which of these is the associative law of intersection for three sets?

  1. AA ∪ (B ∪ C) = (A ∪ B) ∪ C
  2. BA ∩ (B ∩ C) = (A ∩ B) ∩ C
  3. CA ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C)
  4. DNone of these

Associative law: the grouping of ∩ does not matter.Associative law: ∩ mein brackets ki jagah se farq nahi parta.

13.
★ Midterm Fall 2009Lecture 10

If a set A has 5 elements, then the number of elements in its power set P(A) is

  1. A5⁵
  2. B4⁵
  3. C2⁵

A set with n elements has 2ⁿ subsets: 2⁵ = 32.n elements wale set ke 2ⁿ subsets hote hain: 2⁵ = 32.

14.
★ Midterm Fall 2009Lecture 12

Let A = {a, b, c} and R = {(a, c), (b, b), (c, a)} be a relation on A. R is

  1. ATransitive
  2. BReflexive
  3. CSymmetric
  4. DTransitive and reflexive

(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.

15.
★ Past papers (blog)Lecture 13

A binary relation R on A such that (t, t) ∉ R for every t in A is

  1. AAnti-symmetric
  2. BSymmetric
  3. CIrreflexive

No element is related to itself: irreflexive.Koi element khud se related nahi: irreflexive.

16.
★ Midterm Fall 2009Lecture 14

The inverse of the relation R = {(1,1), (1,2), (1,4), (3,4), (4,1)} is

  1. A{(1,1), (2,1), (4,1), (2,3)}
  2. B{(1,1), (1,2), (4,1), (4,3), (1,4)}
  3. C{(1,1), (2,1), (4,1), (4,3), (1,4)}

Swap each pair: (a, b) becomes (b, a).Har pair ko ulat dein: (a, b) ban jata hai (b, a).

17.
★ MTH202 Quiz (Lectures 7–15)Lecture 15

Given A = {a, b} and B = {1, 2, 3}, the number of functions from A to B is ____.

  1. A5
  2. B9
  3. C8
  4. D6

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.

18.
★ MTH202 Quiz (Lectures 7–15)Lecture 15

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)}

  1. AR₁ and R₃ are functions
  2. BR₃ and R₂ are functions
  3. CR₁ and R₂ are functions
  4. DR₂ and R₄ are functions

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.

19.
★ Past papers (blog)Lecture 15

The number of functions from a set with 3 elements to a set with 2 elements is

  1. A6
  2. B8
  3. C12

Each of the 3 elements has 2 choices: 2³ = 8.3 elements mein se har ek ke 2 choices: 2³ = 8.

20.
★ Midterm Fall 2009Lecture 17

If f(x) = 2x + 1 and g(x) = x² − 1, then f(g(x)) =

  1. Ax² − 1
  2. B2x² − 1
  3. C2x³ − 1

f(g(x)) = 2(x² − 1) + 1 = 2x² − 1.f(g(x)) = 2(x² − 1) + 1 = 2x² − 1.

21.
★ Midterm Fall 2009Lecture 17

If f and g are two one-to-one functions, then their composition g ∘ f is

  1. ANot one-to-one
  2. BOnto
  3. COne-to-one
  4. DOnto and one-to-one

A composition of one-to-one functions is one-to-one.One-to-one functions ki composition bhi one-to-one hoti hai.

22.
★ Midterm Fall 2009Lecture 17

If f(4) = 1 and g(1) = 4, then (f ∘ g)(1) =

  1. A3
  2. B1
  3. C4

(f ∘ g)(1) = f(g(1)) = f(4) = 1.(f ∘ g)(1) = f(g(1)) = f(4) = 1.

23.
★ Midterm Fall 2009Lecture 18

If a set contains exactly m distinct elements, where m is a non-negative integer, then the set is

  1. AFinite
  2. BInfinite
  3. CNone of these

A set with a fixed whole number of elements is finite.Jis set ke elements ki ginti mukarrar ho wo finite hai.

24.
★ Midterm Fall 2009Lecture 18

If f(x) = x and g(x) = −2x, then (f + g)(x) =

  1. A3x
  2. B2x²
  3. C−x

x + (−2x) = −x.x + (−2x) = −x.

25.
★ Midterm Fall 2009Lecture 19

Which term of the sequence 4, 1, −2, … is −77?

  1. A26th
  2. B27th
  3. C28th

aₙ = 4 − 3(n − 1) = −77 gives n = 28.aₙ = 4 − 3(n − 1) = −77 se n = 28.

26.
★ Midterm Fall 2009Lecture 19

1, 10, 10², 10³, 10⁴, … is a

  1. AArithmetic series
  2. BGeometric series
  3. CArithmetic sequence
  4. DGeometric sequence

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).

27.
★ Midterm Fall 2009Lecture 20

Σ (j = 1 to 3) (3j − 5) =

  1. A4
  2. B3
  3. C−2

(−2) + 1 + 4 = 3.(−2) + 1 + 4 = 3.

28.
★ Final term Spring 2010Lecture 21

The part of a definition that is expressed in terms of smaller versions of itself is called

  1. ABase
  2. BRestriction
  3. CRecursion
  4. DConclusion

A recursive clause defines new cases using smaller ones.Recursive hissa naye cases ko chhote cases ke zariye define karta hai.

29.
★ Midterm Fall 2009Lecture 22

A collection of rules indicating how to form new set objects from those already known to be in the set is called

  1. ABase
  2. BRestriction
  3. CRecursion

The recursion clause builds new elements from old ones.Recursion ka hissa purane elements se naye elements banata hai.

30.
★ MTH202 Quiz (Lectures 7–15)

Subtraction (−) is a binary operation on the set of integers.

  1. ATrue
  2. BFalse

The difference of any two integers is always an integer.Do integers ka difference hamesha integer hi hota hai.

31.
★ MTH202 Quiz (Lectures 7–15)

Let A be a subset of the universal set U. Then Aᶜ =

  1. AA ∩ Aᶜ
  2. BA ∪ Aᶜ
  3. CU − A
  4. DU ∪ 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.

32.
★ MTH202 Quiz (Lectures 7–15)

The properties of being symmetric and being anti-symmetric are ____.

  1. ANegative of each other
  2. BNot negative of each other

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.

33.
★ MTH202 Quiz (Lectures 7–15)

Which of the following is always true for the matrix of a symmetric relation?

  1. AMatrix always has 0 in its diagonal entries
  2. BMatrix is equal to its transpose
  3. CMatrix is singular
  4. DMatrix always has 1 in its diagonal entries

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.

34.
★ Midterm Fall 2009

In Boolean addition, 1 + 1 =

  1. A2
  2. B1
  3. C0

Boolean addition works like OR, so 1 + 1 = 1.Boolean addition OR ki tarah hai, isliye 1 + 1 = 1.

35.
★ Midterm Fall 2009

The total number of elements in a set is called its

  1. AStrength
  2. BCardinality
  3. CFinite

Cardinality is the number of elements.Elements ki ginti ko cardinality kehte hain.

36.
Lecture 1

Discrete Mathematics concerns processes that consist of:

  1. AA continuous flow of values
  2. BA sequence of individual steps
  3. COnly real numbers
  4. DSmooth curves

Lecture definition: processes with a sequence of individual steps.Lecture ki definition: aise processes jin mein alag alag steps ki sequence ho.

37.
Lecture 1

Which of these is an example of a discrete set?

  1. AReal numbers
  2. BAll points on a line
  3. CIntegers
  4. DTime measured without gaps

Integers are separate points (..., -1, 0, 1, ...) with gaps between them.Integers alag alag points (..., -1, 0, 1, ...) hain jin ke beech gaps hain.

38.
Lecture 1

The set of real numbers is:

  1. ADiscrete
  2. BContinuous
  3. CFinite
  4. DEmpty

Real numbers have no gaps, so they are continuous.Real numbers mein koi gap nahi, isliye yeh continuous hain.

39.
Lecture 1

"Discrete Mathematics with Applications" is written by:

  1. AKenneth H. Rosen
  2. BSusanna S. Epp
  3. CRoss and Wright
  4. DSeymour Lipschutz

Recommended book 1: Susanna S. Epp (second edition).Recommended book 1: Susanna S. Epp (second edition).

40.
Lecture 1

"Discrete Mathematics and Its Applications" is written by:

  1. ASusanna S. Epp
  2. BRoss and Wright
  3. CSeymour Lipschutz
  4. DKenneth H. Rosen

Recommended book 2: Kenneth H. Rosen (fourth edition).Recommended book 2: Kenneth H. Rosen (fourth edition).

41.
Lecture 1

One course objective is to "prove a formula using ______".

  1. ATruth tables
  2. BMathematical induction
  3. CVenn diagrams
  4. DGraphs

Objective 6: Prove a formula using mathematical induction.Objective 6: mathematical induction se formula prove karna.

42.
Lecture 1

Logic is the study of the principles and methods that distinguish between:

  1. ATrue and false numbers
  2. BA valid and an invalid argument
  3. CSets and functions
  4. DDiscrete and continuous data

Lecture definition of Logic.Yeh lecture mein di gayi Logic ki definition hai.

43.
Lecture 1

A statement is a declarative sentence that is:

  1. AAlways true
  2. BAlways false
  3. CEither true or false, but not both
  4. DBoth true and false

Definition of a statement.Yeh statement ki definition hai.

44.
Lecture 1

Another name for a statement is:

  1. AVariable
  2. BProposition
  3. CConnective
  4. DArgument

A statement is also called a proposition.Statement ko proposition bhi kehte hain.

45.
Lecture 1

The truth values "true" and "false" are denoted by:

  1. A1 and 0
  2. BY and N
  3. CT and F
  4. D+ and -

True = T, False = F.True = T, False = F.

46.
Lecture 1

Which of the following is a statement?

  1. AClose the door.
  2. BMay I come in?
  3. CGrass is green.
  4. Dx + 2 is positive.

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.

47.
Lecture 1

Which of the following is NOT a statement?

  1. A4 + 2 = 7
  2. B-1 > 0
  3. CIt is hot today.
  4. Dx + y = 12

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.

48.
Lecture 1

"4 + 2 = 7" is:

  1. ANot a statement, because it is false
  2. BA statement with truth value False
  3. CA statement with truth value True
  4. DA question

A false sentence is still a statement; its truth value is F.Ghalat sentence bhi statement hi hai; uski truth value F hai.

49.
Lecture 1

"May I come in?" is not a statement because it is:

  1. AA question
  2. BFalse
  3. CA command
  4. DA compound statement

Questions are neither true nor false.Sawal na true hote hain na false.

50.
Lecture 1

"Close the door." is not a statement because it is:

  1. AA question
  2. BA command (order)
  3. CFalse
  4. DUsing a variable

Orders are neither true nor false.Orders na true hote hain na false.

51.
Lecture 1

The sentence "x is greater than 2" (with nothing before it) is:

  1. AA true statement
  2. BA false statement
  3. CNot a statement, because x is unknown
  4. DA compound statement

Without knowing x we cannot decide true or false.x pata kiye baghair hum true ya false decide nahi kar sakte.

52.
Lecture 1

If we first say "x = 1", then the sentence "x > 2" is:

  1. ANot a statement
  2. BA statement with truth value True
  3. CA statement with truth value False
  4. DA question

Now x is known: 1 > 2 is false.Ab x pata hai: 1 > 2 false hai.

53.
Lecture 1

"Bill Gates is an American. He is very rich." Here "He is very rich" is:

  1. ANot a statement
  2. BA statement with truth value TRUE
  3. CA statement with truth value FALSE
  4. DA command

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.

54.
Lecture 1

A sentence with a pronoun (he/she) or a variable (x) becomes a statement when:

  1. AIt is written in symbols
  2. BEarlier sentences make the pronoun or variable clear
  3. CIt ends with a question mark
  4. DIt uses the word "and"

This is the rule given in the lecture.Yeh lecture mein diya gaya rule hai.

55.
Lecture 1

"Logic is interesting." is:

  1. AA statement
  2. BNot a statement
  3. CA question
  4. DA command

The lecture lists it as a statement.Lecture mein isay statement likha gaya hai.

56.
Lecture 1

"He is very rich" (with nothing before it) is:

  1. AA true statement
  2. BA false statement
  3. CA compound statement
  4. DNot a statement

We do not know who "He" is.Humein nahi pata ke "He" kaun hai.

57.
Lecture 1

A compound statement is built by:

  1. AJoining two questions
  2. BCombining simple statements using connectives
  3. CUsing only numbers
  4. DWriting one variable

Simple statements + connectives (and, or, not) = compound statement.Simple statements + connectives (and, or, not) = compound statement.

58.
Lecture 1

Which words are called logical connectives in Lecture 1?

  1. AAND, OR, NOT
  2. BPLUS, MINUS
  3. CIS, ARE
  4. Dx, y, z

AND, OR, NOT are logical connectives.AND, OR, NOT logical connectives hain.

59.
Lecture 1

Statements are represented symbolically by:

  1. ANumbers 1, 2, 3
  2. BLetters such as p, q, r
  3. CThe symbols ∧ and ∨
  4. DThe letters T and F

We use small letters p, q, r, ...Hum chhote letters p, q, r, ... use karte hain.

60.
Lecture 1

The symbol for negation (not) is:

  1. A∧
  2. B∨
  3. C~
  4. D→

Negation = not = ~Negation = not = ~

61.
Lecture 1

The symbol ∧ is called:

  1. AVel
  2. BTilde
  3. CHat
  4. DArrow

∧ = Hat (used for and).∧ = Hat (and ke liye use hota hai).

62.
Lecture 1

The symbol ∨ is called:

  1. AVel
  2. BHat
  3. CTilde
  4. DDouble arrow

∨ = Vel (used for or).∨ = Vel (or ke liye use hota hai).

63.
Lecture 1

The symbol ~ is called:

  1. AHat
  2. BVel
  3. CArrow
  4. DTilde

~ = Tilde (used for not).~ = Tilde (not ke liye use hota hai).

64.
Lecture 1

Conjunction means:

  1. Aor
  2. Bnot
  3. Cand
  4. Dif…then

Conjunction = and = ∧Conjunction = and = ∧

65.
Lecture 1

Disjunction means:

  1. Aand
  2. Bor
  3. Cnot
  4. Dif and only if

Disjunction = or = ∨Disjunction = or = ∨

66.
Lecture 1

The connective "if…then" is called:

  1. ABiconditional
  2. BConjunction
  3. CConditional
  4. DNegation

Conditional = if…then = →Conditional = if…then = →

67.
Lecture 1

The symbol for the biconditional (if and only if) is:

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

Biconditional = ↔ (Double arrow).Biconditional = ↔ (Double arrow).

68.
Lecture 1

The symbol → is called:

  1. AArrow
  2. BDouble arrow
  3. CHat
  4. DVel

→ = Arrow (Conditional).→ = Arrow (Conditional).

69.
Lecture 1

The symbol ↔ is called:

  1. AArrow
  2. BTilde
  3. CDouble arrow
  4. DHat

↔ = Double arrow (Biconditional).↔ = Double arrow (Biconditional).

70.
Lecture 1

p = "Islamabad is the capital of Pakistan", q = "17 is divisible by 3". Then p ∧ q is:

  1. AIslamabad is the capital of Pakistan or 17 is divisible by 3
  2. BIslamabad is the capital of Pakistan and 17 is divisible by 3
  3. CIslamabad is not the capital of Pakistan
  4. DIf Islamabad is the capital of Pakistan then 17 is divisible by 3

∧ = and.∧ = and.

71.
Lecture 1

Let p = "Islamabad is the capital of Pakistan" and q = "17 is divisible by 3". Then p ∨ q is:

  1. AIslamabad is the capital of Pakistan and 17 is divisible by 3
  2. B17 is not divisible by 3
  3. CIslamabad is the capital of Pakistan or 17 is divisible by 3
  4. DIslamabad is the capital of Pakistan if and only if 17 is divisible by 3

∨ = or.∨ = or.

72.
Lecture 1

Let p = "Islamabad is the capital of Pakistan". Then ~p is:

  1. AIslamabad is the capital of Pakistan
  2. B17 is not divisible by 3
  3. CIslamabad is the capital of Pakistan and 17 is divisible by 3
  4. DIt is not the case that Islamabad is the capital of Pakistan

~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.

73.
Lecture 1

Let p = "It is hot", q = "It is sunny". "It is not hot" is:

  1. Ap
  2. B~p
  3. C~q
  4. Dp ∧ q

not hot = ~pnot hot = ~p

74.
Lecture 1

Let p = "It is hot" and q = "It is sunny". "It is hot and sunny" in symbols is:

  1. Ap ∨ q
  2. B~p ∧ q
  3. Cp ∧ q
  4. Dp ∧ ~q

and = ∧and = ∧

75.
Lecture 1

Let p = "It is hot" and q = "It is sunny". "It is hot or sunny" in symbols is:

  1. Ap ∨ q
  2. Bp ∧ q
  3. C~p ∨ q
  4. D~(p ∨ q)

or = ∨or = ∨

76.
Lecture 1

Let p = "It is hot" and q = "It is sunny". "It is not hot but sunny" in symbols is:

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

not hot = ~p, but = ∧, sunny = qnot hot = ~p, but = ∧, sunny = q

77.
Lecture 1

Let p = "It is hot" and q = "It is sunny". "It is neither hot nor sunny" in symbols is:

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

neither…nor = not p AND not qneither…nor ka matlab = not p AND not q

78.
Lecture 1

In logic, the English word "but" is translated as:

  1. A∨
  2. B~
  3. C∧
  4. D→

"but" works like "and"."but" bilkul "and" ki tarah kaam karta hai.

79.
Lecture 1

The phrase "neither p nor q" is written as:

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

Both are negated and joined with ∧.Dono ko negate karke ∧ se joda gaya hai.

80.
Lecture 1

Let h = "Zia is healthy", w = "Zia is wealthy", s = "Zia is wise". "Zia is healthy and wealthy but not wise" is:

  1. A(h ∧ w) ∧ (~s)
  2. B(h ∨ w) ∧ s
  3. Ch ∧ w ∧ s
  4. D~h ∧ ~w ∧ s

healthy and wealthy = h ∧ w, but not wise = ∧ ~shealthy and wealthy = h ∧ w, but not wise = ∧ ~s

81.
Lecture 1

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:

  1. Aw ∧ (h ∧ s)
  2. B~w ∨ (h ∧ s)
  3. C~w ∧ (h ∧ s)
  4. D~w ∧ ~h ∧ ~s

not wealthy = ~w, but = ∧, healthy and wise = h ∧ snot wealthy = ~w, but = ∧, healthy and wise = h ∧ s

82.
Lecture 1

Let h = "Zia is healthy", w = "Zia is wealthy" and s = "Zia is wise". "Zia is neither healthy, wealthy nor wise" in symbols is:

  1. A~h ∨ ~w ∨ ~s
  2. B~h ∧ w ∧ s
  3. Ch ∧ w ∧ s
  4. D~h ∧ ~w ∧ ~s

All three are negated and joined with ∧.Teeno ko negate karke ∧ se joda gaya hai.

83.
Lecture 1

Let m = "Ali is good in Mathematics", c = "Ali is a Computer Science student". ~c means:

  1. AAli is a Computer Science student
  2. BAli is not a Computer Science student
  3. CAli is not good in Mathematics
  4. DAli is good in Mathematics

~ = not~ = not

84.
Lecture 1

Let m = "Ali is good in Mathematics" and c = "Ali is a Computer Science student". Then c ∨ m means:

  1. AAli is a Computer Science student or good in Maths
  2. BAli is a Computer Science student and good in Maths
  3. CAli is not a Computer Science student but good in Maths
  4. DAli is neither a Computer Science student nor good in Maths

∨ = or∨ = or

85.
Lecture 1

Let m = "Ali is good in Mathematics" and c = "Ali is a Computer Science student". Then m ∧ ~c means:

  1. AAli is good in Maths or a Computer Science student
  2. BAli is not good in Maths but is a Computer Science student
  3. CAli is good in Maths but not a Computer Science student
  4. DAli is neither good in Maths nor a Computer Science student

m = good in Maths, ∧ ~c = but not a CS studentm = good in Maths, ∧ ~c = but not a CS student

86.
Lecture 1

A truth table shows:

  1. AThe meaning of each English word
  2. BThe truth value of a compound proposition for all possible truth values of its parts
  3. COnly the cases that are true
  4. DHow many statements are in a sentence
87.
Lecture 1

If p is true, then ~p is:

  1. ATrue
  2. BFalse
  3. CBoth true and false
  4. DCannot be decided

Negation gives the opposite value.Negation ulti value deta hai.

88.
Lecture 1

If p is false, then ~p is:

  1. ATrue
  2. BFalse
  3. CBoth true and false
  4. DNot a statement

Negation gives the opposite value.Negation ulti value deta hai.

89.
Lecture 1

How many rows (without the heading) does the truth table of ~p have?

  1. A1
  2. B2
  3. C4
  4. D8

One letter → 2 cases: T and F.Ek letter → 2 cases: T aur F.

90.
Lecture 1

How many rows (without the heading) does a truth table with two statements p and q have?

  1. A2
  2. B3
  3. C4
  4. D6

Two letters → 4 cases: TT, TF, FT, FF.Do letters → 4 cases: TT, TF, FT, FF.

91.
Lecture 1

p ∧ q is true when:

  1. AAt least one of p, q is true
  2. BBoth p and q are true
  3. CBoth p and q are false
  4. Dp is false

Conjunction is true only when both are true.Conjunction sirf tab true hai jab dono true hon.

92.
Lecture 1

If p = T and q = F, then p ∧ q is:

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

One part is false, so ∧ is false.Ek part false hai, isliye ∧ false hai.

93.
Lecture 1

In the truth table of p ∧ q, how many rows give the result T?

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

Only the TT row.Sirf TT wali row.

94.
Lecture 1

Disjunction (∨) is also called:

  1. AExclusive or
  2. BInclusive or
  3. CNegation
  4. DConditional

Lecture heading: Disjunction or INCLUSIVE OR.Lecture ki heading: Disjunction or INCLUSIVE OR.

95.
Lecture 1

p ∨ q is false only when:

  1. ABoth p and q are true
  2. Bp is true and q is false
  3. Cp is false and q is true
  4. DBoth p and q are false

Disjunction is false only in the FF row.Disjunction sirf FF wali row mein false hai.

96.
Lecture 1

If p = F and q = T, then p ∨ q is:

  1. AF
  2. BT
  3. CNot defined
  4. DSame as p

At least one part is true, so ∨ is true.Kam az kam ek part true hai, isliye ∨ true hai.

97.
Lecture 1

If p = F and q = F, then p ∨ q is:

  1. AT
  2. BNot a statement
  3. CF
  4. DCannot be decided

Both parts are false, so ∨ is false.Dono parts false hain, isliye ∨ false hai.

98.
Lecture 1

In the truth table of p ∨ q, how many rows give the result T?

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

TT, TF and FT are true; only FF is false.TT, TF aur FT true hain; sirf FF false hai.

99.
Lecture 1

If p = T and q = T, then ~p ∧ q is:

  1. AT
  2. BNot defined
  3. CSame as p
  4. DF

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

100.
Lecture 1

If p = F and q = F, then ~p ∧ ~q is:

  1. AT
  2. BF
  3. CNot defined
  4. DSame as p

~p = T and ~q = T, so T ∧ T = T.~p = T aur ~q = T, isliye T ∧ T = T.

101.
Lecture 2

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.

102.
Lecture 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.

103.
Lecture 2

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.

104.
Lecture 2

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.

105.
Lecture 2

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.

106.
Lecture 2

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.

107.
Lecture 2

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 ∧.

108.
Lecture 2

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.

109.
Lecture 2

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.

110.
Lecture 2

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.

111.
Lecture 2

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.

112.
Lecture 2

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.

113.
Lecture 2

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.

114.
Lecture 2

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.

115.
Lecture 2

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.

116.
Lecture 2

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.

117.
Lecture 2

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.

118.
Lecture 2

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.

119.
Lecture 2

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.

120.
Lecture 2

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.

121.
Lecture 2

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.

122.
Lecture 2

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.

123.
Lecture 2

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.

124.
Lecture 2

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.

125.
Lecture 2

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.

126.
Lecture 2

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.

127.
Lecture 2

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.

128.
Lecture 2

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.

129.
Lecture 2

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.

130.
Lecture 2

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.

131.
Lecture 2

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.

132.
Lecture 2

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.

133.
Lecture 2

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.

134.
Lecture 2

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.

135.
Lecture 2

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.

136.
Lecture 2

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.

137.
Lecture 2

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.

138.
Lecture 2

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.

139.
Lecture 2

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.

140.
Lecture 2

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.

141.
Lecture 2

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.

142.
Lecture 2

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.

143.
Lecture 2

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.

144.
Lecture 2

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.

145.
Lecture 2

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.

146.
Lecture 2

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.

147.
Lecture 2

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.

148.
Lecture 2

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.

149.
Lecture 2

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.

150.
Lecture 2

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.

151.
Lecture 2

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.

152.
Lecture 2

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.

153.
Lecture 2

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.

154.
Lecture 2

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.

155.
Lecture 2

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.

156.
Lecture 2

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.

157.
Lecture 2

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.

158.
Lecture 2

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.

159.
Lecture 2

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.

160.
Lecture 2

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.

161.
Lecture 2

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.