Paper Tayyari

Lecture 1: Introduction to Discrete Mathematics; Statements, Negation, Conjunction and Disjunction

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 →
Start mock testMock test shuru karein
DoneHal kiye 0/66
– correctsahi
1.
★ Midterm Fall 2009

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.

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.

3.

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.

4.

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.

5.

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

6.

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

7.

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.

8.

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.

9.

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.

10.

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.

11.

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.

12.

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.

13.

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.

14.

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

15.

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

16.

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

17.

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.

18.

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.

19.

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

20.

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.

21.

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

22.

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

23.

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.

24.

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.

25.

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.

26.

The symbol for negation (not) is:

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

Negation = not = ~Negation = not = ~

27.

The symbol ∧ is called:

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

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

28.

The symbol ∨ is called:

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

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

29.

The symbol ~ is called:

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

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

30.

Conjunction means:

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

Conjunction = and = ∧Conjunction = and = ∧

31.

Disjunction means:

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

Disjunction = or = ∨Disjunction = or = ∨

32.

The connective "if…then" is called:

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

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

33.

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

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

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

34.

The symbol → is called:

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

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

35.

The symbol ↔ is called:

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

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

36.

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.

37.

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.

38.

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.

39.

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

40.

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

41.

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 = ∨

42.

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

43.

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

44.

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.

45.

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.

46.

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

47.

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

48.

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.

49.

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

50.

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

51.

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

52.

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

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.

54.

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.

55.

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.

56.

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.

57.

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.

58.

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.

59.

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.

60.

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.

61.

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.

62.

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.

63.

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.

64.

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.

65.

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.

66.

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.