Paper Tayyari

Lecture 28: Loop to Compute a Product, Division Algorithm, Euclidean Algorithm

MCQs, short and long questions from lecture 28.Lecture 28 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 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.

2.
★ Final term Spring 2010

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.

3.
★ Final term Spring 2010

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.