Official answer key is not available for this question yet.
Studying seriously for GATE CSE?
Keep browsing free. Pro unlocks the paid study loop: explanations, topic mastery, mistake notebook, and custom PYQ drills.
See GATE CSE betaOpen notebookGATE 2021Set 2PYQNATanswer pendingexplanationeasy
Programming Languages · Number Theory & Algorithms
Concept intelligence
Jump into a concept drill from this question.
Recurring concept
See all 7 →Number Theory & Algorithms has appeared in GATE CSE & IT 7 times across 5 years (2004, 2007, 2020, 2021, 2025).
More questions on Number Theory & Algorithms
See all →- 2025 Qint x = 126, y = 105; do{ if(x > y) x = x - y; else y = y - x; }while(x!=y); printf('%d", x); The output of th...
- 2020 QConsider the following C functions. int tob(int b, int* arr) { int i; for (i=0; b>0; i++) { if (b%2) arr[i] =...
- 2007 QExponentiation is a heavily used operation in public key cryptography. Which of the following options is the t...
- 2007 QIn the following C function, let n $$ \ge $$ m. int gcd(n,m) { if (n % m == 0) return m; n = n % m; return gcd...
- 2004 QConsider the following C program main ( ) { int x, y, m, n; scanf("%d %d", &x, &y); /* Assume x > 0 and y > 0...
- 2004 QWhat does the following algorithm approximate? (Assume m > 1, $$ \in > 0$$) x = m; y = 1; while(x - y > ε){ x...
∑ has math
c-programmingrecursiongcdeuclidean-algorithm