MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 8 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
What is the GCD of 20 and 12 using Euclid’s algorithm? |
| A. | 8 |
| B. | 2 |
| C. | 4 |
| D. | 6 |
| Answer» D. 6 | |
| 2. |
What is the total running time of Euclid’s algorithm? |
| A. | O(N) |
| B. | O(N log M) |
| C. | O(N log N) |
| D. | O(log N +1) |
| Answer» B. O(N log M) | |
| 3. |
Which of the following is the correct mathematical application of Euclid’s algorithm? |
| A. | Determination of prime numbers |
| B. | Lagrange’s four square theorem |
| C. | Cauchy-Euler theorem |
| D. | Residue theorem |
| Answer» C. Cauchy-Euler theorem | |
| 4. |
According to Gabriel lame, how many steps does Euclid’s algorithm require to solve a problem? |
| A. | Less than five times the number of digits |
| B. | More than five times the number of digits |
| C. | Less than two times the number of digits |
| D. | More than two times the number of digits |
| Answer» B. More than five times the number of digits | |
| 5. |
The Euclid’s algorithm runs efficiently if the remainder of two numbers is divided by the minimum of two numbers until the remainder is zero. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 6. |
Which of the following is not an application of Euclid’s algorithm? |
| A. | Simplification of fractions |
| B. | Performing divisions in modular arithmetic |
| C. | Solving quadratic equations |
| D. | Solving diophantine equations |
| Answer» D. Solving diophantine equations | |
| 7. |
Who invented Euclid’s algorithm? |
| A. | Sieve |
| B. | Euclid |
| C. | Euclid-Sieve |
| D. | Gabriel lame |
| Answer» C. Euclid-Sieve | |
| 8. |
Euclid’s algorithm is used for finding ___________ |
| A. | GCD of two numbers |
| B. | GCD of more than three numbers |
| C. | LCM of two numbers |
| D. | LCM of more than two numbers |
| Answer» B. GCD of more than three numbers | |