Paper Tayyari

Lecture 33: Tree Diagrams, Inclusion–Exclusion Principle

MCQs, short and long questions from lecture 33.Lecture 33 ki MCQs, short aur long sawal.

3 MCQs · 3 MCQs from past papers3 MCQs · 3 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/3
– correctsahi
1.
★ Final term Spring 2010

If A and B are finite overlapping sets, which of the following must be true?

  1. An(A ∪ B) = n(A) + n(B)
  2. Bn(A ∪ B) = n(A) + n(B) − n(A ∩ B)
  3. Cn(A ∪ B) = 0
  4. DNone of these

Inclusion–exclusion: subtract the overlap counted twice.Inclusion–exclusion: do baar gina gaya overlap ghata dein.

2.
★ Past papers (blog)

Of 200 people, 150 swim or jog or both. If 85 swim and 60 swim and jog, how many jog?

  1. A125
  2. B225
  3. C85
  4. D25

150 = 85 + J − 60, so J = 125.150 = 85 + J − 60, isliye J = 125.

3.
★ Past papers (blog)

A tree diagram lists all logical possibilities of a sequence of events, each with finitely many outcomes.

  1. ATrue
  2. BFalse

That is exactly what a tree diagram shows.Tree diagram yahi dikhata hai.