Paper Tayyari

Final Term PreparationFinal term ki tayyari

Syllabus: lectures 23–45. Past-paper MCQs are shown first.Syllabus: lecture 23–45. Past paper ki MCQs pehle dikhai gayi hain.

30 MCQs · 8 short · 3 long questions · 30 MCQs from past papers30 MCQs · 8 short · 3 long sawal · 30 MCQs past papers se

Start mock testMock test shuru karein
DoneHal kiye 0/30
– correctsahi
1.
★ Past papers (blog)Lecture 24

5ⁿ − 1 is divisible by 4 for all positive integers n.

  1. ATrue
  2. BFalse

5 ≡ 1 (mod 4), so 5ⁿ − 1 ≡ 0 (mod 4); it can also be proved by induction.5 ≡ 1 (mod 4), isliye 5ⁿ − 1 ≡ 0 (mod 4); induction se bhi prove hota hai.

2.
★ Past papers (blog)Lecture 25

"If 5k is even, then 5k + 5k + 5k is odd."

  1. ATrue
  2. BFalse

5k + 5k + 5k = 3(5k), and 3 times an even number is even.5k + 5k + 5k = 3(5k), aur even ka 3 guna even hi hota hai.

3.
★ Final term Spring 2010Lecture 26

"The square root of every prime number is irrational."

  1. ATrue
  2. BFalse
  3. CDepends on the prime number

√p for a prime p cannot be a ratio of integers (proof by contradiction).Prime p ka √p integers ka ratio nahi ho sakta (proof by contradiction).

4.
★ Final term Spring 2010Lecture 28

If a and b are positive integers and a = b·q + r with q and r non-negative integers, then

  1. Agcd(a, b) = gcd(b, r)
  2. Bgcd(a, r) = gcd(b, r)
  3. Cgcd(a, q) = gcd(q, r)

This is the step used in the Euclidean algorithm.Euclidean algorithm isi step par chalta hai.

5.
★ Final term Spring 2010Lecture 28

The greatest common divisor of 27 and 72 is

  1. A27
  2. B9
  3. C1
  4. DNone of these

27 = 3³ and 72 = 2³·3², so gcd = 3² = 9.27 = 3³ aur 72 = 2³·3², isliye gcd = 3² = 9.

6.
★ Final term Spring 2010Lecture 28

Quotient–remainder theorem: for any integer n and positive integer d, there are unique integers q and r with n = d·q + r and

  1. A0 ≤ r < d
  2. B0 < r < d
  3. C0 ≤ d < r
  4. DNone of these

The remainder is at least 0 and less than the divisor.Remainder 0 ya us se zyada aur divisor se kam hota hai.

7.
★ Past papers (blog)Lecture 31

The number of ways to select five letters from the English alphabet is

  1. AC(26, 5)
  2. BC(5, 26)
  3. CC(12, 3)
  4. DNone of these

Choose 5 of 26 letters without order: C(26, 5).26 mein se 5 letters bina tarteeb ke: C(26, 5).

8.
★ Past papers (blog)Lecture 31

The number of ways to select five players from a 10-member tennis team is

  1. AC(10, 5)
  2. BC(5, 10)
  3. CP(10, 5)
  4. DNone of these

Order does not matter: C(10, 5).Tarteeb ka farq nahi: C(10, 5).

9.
★ Past papers (blog)Lecture 31

If order does not matter and repetition is allowed, the number of ways to select k items from n is

  1. Anᵏ
  2. BC(n + k − 1, k)
  3. CP(n, k)
  4. DC(n, k)

Selections with repetition: C(n + k − 1, k).Repetition ke saath selection: C(n + k − 1, k).

10.
★ Final term Spring 2010Lecture 33

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.

11.
★ Past papers (blog)Lecture 33

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.

12.
★ Past papers (blog)Lecture 33

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.

13.
★ Past papers (blog)Lecture 35

Two dice are thrown. The probability that the total is 5 or 11 is

  1. A1/8
  2. B1/9
  3. C1/6

Sum 5 in 4 ways and 11 in 2 ways: 6/36 = 1/6.Sum 5 chaar tareeqon se aur 11 do tareeqon se: 6/36 = 1/6.

14.
★ Past papers (blog)Lecture 35

A die is thrown twice. The probability that the sum of the dots is 3 or 11 is

  1. A2/3
  2. B1/9
  3. C1/2

(1,2), (2,1), (5,6), (6,5): 4/36 = 1/9.(1,2), (2,1), (5,6), (6,5): 4/36 = 1/9.

15.
★ Past papers (blog)Lecture 36

A die is thrown. The probability that the top face shows a prime or an odd number is

  1. A1
  2. B1/2
  3. C2/3

Prime or odd: {1, 2, 3, 5}, so 4/6 = 2/3.Prime ya odd: {1, 2, 3, 5}, isliye 4/6 = 2/3.

16.
★ Past papers (blog)Lecture 36

P(A ∪ B ∪ C) is equal to

  1. AP(A) + P(B) + P(C)
  2. BP(A) + P(B) + P(C) − P(A ∩ B) − P(A ∩ C) − P(B ∩ C) + P(A ∩ B ∩ C)
  3. CP(A) + P(B) + P(C) − P(A ∩ B) − P(A ∩ C) − P(B ∩ C)
  4. DP(A) + P(B) + P(C) + P(A ∩ B ∩ C)

Inclusion–exclusion for three events.Teen events ke liye inclusion–exclusion.

17.
★ Final term Spring 2010Lecture 37

If P(A ∩ B) ≠ P(A)·P(B), then the events A and B are called

  1. AIndependent
  2. BDependent
  3. CExhaustive

Events are independent only when P(A ∩ B) = P(A)·P(B).Events sirf tab independent hain jab P(A ∩ B) = P(A)·P(B).

18.
★ Past papers (blog)Lecture 37

If P(A ∩ B) = P(A)·P(B), then the events A and B are called

  1. AIndependent
  2. BDependent
  3. CExhaustive

This product rule is the definition of independent events.Ye product rule independent events ki definition hai.

19.
★ Final term Spring 2010Lecture 38

A rule that assigns a numerical value to each outcome in a sample space is called a

  1. AOne-to-one function
  2. BConditional probability
  3. CRandom variable

That is the definition of a random variable.Ye random variable ki definition hai.

20.
★ Past papers (blog)Lecture 39

Two distinct edges with the same set of end points are called

  1. AIsolated
  2. BIncident
  3. CParallel

Edges with the same end points are parallel edges.Ek jaise end points wale edges parallel edges hain.

21.
★ Final term Spring 2010Lecture 40

A walk that starts and ends at the same vertex is called a

  1. ASimple walk
  2. BCircuit
  3. CClosed walk

Same start and end vertex makes a walk closed.Shuru aur aakhir ka vertex ek ho to walk closed hoti hai.

22.
★ Past papers (blog)Lecture 40

A circuit that consists of a single vertex is called

  1. ATrivial
  2. BTree
  3. CEmpty

A one-vertex circuit is the trivial circuit.Ek vertex wala circuit trivial circuit hai.

23.
★ Past papers (blog)Lecture 43

The crossing number of a planar graph is

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

A planar graph can be drawn with no edges crossing.Planar graph ko bina edges cross kiye banaya ja sakta hai.

24.
★ Final term Spring 2010Lecture 44

In a tree, a vertex of degree greater than 1 is called a

  1. ABranch vertex
  2. BTerminal vertex
  3. CAncestor

Degree 1 vertices are terminal (leaves); higher degree vertices are branch (internal) vertices.Degree 1 wale vertices terminal hain; is se zyada degree wale branch vertices.

25.
★ Final term Spring 2010Lecture 45

Any two spanning trees of a connected graph

  1. ADo not contain the same number of edges
  2. BHave the same degrees of corresponding vertices
  3. CContain the same number of edges
  4. DMay or may not contain the same number of edges

A spanning tree on n vertices always has n − 1 edges.n vertices wale spanning tree mein hamesha n − 1 edges hote hain.

26.
★ Final term Spring 2010

(n + 1)!/(n − 1)! =

  1. A0
  2. Bn(n − 1)
  3. Cn² + n
  4. DCannot be determined

(n + 1)!/(n − 1)! = (n + 1)·n = n² + n.(n + 1)!/(n − 1)! = (n + 1)·n = n² + n.

27.
★ Midterm Fall 2009

The product of the positive integers from 1 to n is called

  1. AMultiplication
  2. Bn factorial
  3. CGeometric sequence

1 × 2 × … × n = n!.1 × 2 × … × n = n!.

28.
★ Past papers (blog)

The value of (−2)! is

  1. A0
  2. B1
  3. CCannot be determined

Factorial is defined only for non-negative integers.Factorial sirf non-negative integers ke liye defined hai.

29.
★ Past papers (blog)

An integer n is a perfect square if and only if n = k² for some integer k.

  1. ATrue
  2. BFalse
  3. CDepends on the value of k

This is the definition of a perfect square.Ye perfect square ki definition hai.

30.
★ Past papers (blog)

The value of 0! is

  1. A0
  2. B1

By definition 0! = 1.Definition ke mutabiq 0! = 1.