Difficulty distribution
How the classified questions are distributed by difficulty.
2questions
Medium
2
100%
Root Finding - Numerical Methods - General Aptitude (GA) Previous Year Questions
Practice Root Finding - Numerical Methods - General Aptitude (GA) previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
2Papers
2Years
2Questions
1Topics
Root Finding question pattern
Every graph below is calculated only from this selection.
Questions by year
Compare question counts across years.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
2questions
Numerical Answer Type (NAT)
1
50%
MCQ
1
50%
Subject weightage
Top subjects by unique question coverage.
Most asked topics
Top topics across the included previous year papers.
Subtopic coverage
Top subtopics inside this exact selection.
Paper coverage
Question coverage for the most populated papers. Every active PYP paper remains listed below.
Included previous year papers
Newest papers appear first. Search these papers or sort by year and name.
| Paper name | Year | Attempt | |
|---|---|---|---|
Mathematics (MA) 20202020 | 2020 |
|
|
Mathematics (MA) 20152015 | 2015 | |
|
All Root Finding previous year questions
Practice every matching question in batches of 20, with every available option.
2015 · General Aptitude (GA) · Numerical Methods · Root Finding
Mathematics (MA) 2015
Suppose that the Newton-Raphson method is applied to the equation \(2x^2 + 1 - e^{x^2} = 0\) with an initial approximation \(x_0\) sufficiently close to zero. Then, for the root \(x = 0\), the order of convergence of the method is equal to ______
2020 · General Aptitude (GA) · Numerical Methods · Root Finding
Mathematics (MA) 2020
Consider the iterative scheme \( x_n = \frac{x_{n-1}}{2} + \frac{3}{x_{n-1}}, \quad n \geq 1, \) with initial point \(x_0 > 0\). Then the sequence \(\{x_n\}\)