Concept drill
numerical-methods
GATE CSE & IT · Number Theory & Algorithms · 1996-2014
3
PYQs
67%
keyed
1
elite explanations
3
years appeared
Study anchor
Cormen et al. — Introduction to Algorithms (CLRS)
Algorithms, data structures, graph algorithms, complexity
Practice action
Start latest PYQPYQs in this concept
All concepts →2014 PYQ
Consider the following function double f (double x) { if ( abs (x * x – 3) < 0. 01) return x; else return f (x / 2 + 1.5/x); } Give a value q (to 2 decimals) such that f(q) will re...
medium
2004 PYQ
What does the following algorithm approximate? (Assume m > 1, $$ \in > 0$$) x = m; y = 1; while(x - y > ε){ x = (x + y) / 2; y = m/x; } print(x);
mediumanswer keyelite explanation
1996 PYQ
The formula used to compute an approximation for the second derivative of a function $$f$$ at a point $${x_0}$$ is
easyanswer key