My Cart
Your Cart 0

    Your cart is empty.

  • Total (Amount) ₹0.00
Previous year question hub

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.

4Papers
3Years
4Questions
1Topics

Root Finding question pattern

Every graph below is calculated only from this selection.

Questions by year

Year-wise coverage for Root Finding. Each bar uses a separate theme-derived color.

Difficulty distribution

How the classified questions are distributed by difficulty.

Medium 3 75%
Easy 1 25%

Question type distribution

MCQ, numerical, multiple-select and other formats found in these papers.

MCQ 3 75%
Numerical Answer Type (NAT) 1 25%

Subject weightage

Top subjects by unique question coverage.

General Aptitude (GA)
4 Qs

Most asked topics

Top topics across the included previous year papers.

Numerical Methods
4 Qs

Subtopic coverage

Top subtopics inside this exact selection.

Root Finding
4 Qs

Paper coverage

Question coverage for the most populated papers. Every active PYP paper remains listed below.

Computer Science & Information Technology (CS) 2017 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 1]
1 Qs
Computer Science & Information Technology (CS) 2015 [Session 2]
1 Qs
Computer Science & Information Technology (CS) 2012
1 Qs

Included previous year papers

Newest papers appear first. Sort by year, question coverage or name.

PaperYear / sessionQuestions in this viewOpen
Computer Science & Information Technology (CS) 2017 [Session 2]20171View paper
Computer Science & Information Technology (CS) 2015 [Session 1]20151View paper
Computer Science & Information Technology (CS) 2015 [Session 2]20151View paper
Computer Science & Information Technology (CS) 201220121View paper

All Root Finding previous year questions

Practice every matching question in batches of 20, with every available option.

1
2012 · General Aptitude (GA) · Numerical Methods · Root Finding
Computer Science & Information Technology (CS) 2012
The bisection method is applied to compute a zero of the function \(f(x) = x^4 - x^3 - x^2 - 4\) in the interval [1,9]. The method converges to a solution after _____ iterations.
Open complete paper
2
2015 · General Aptitude (GA) · Numerical Methods · Root Finding
Computer Science & Information Technology (CS) 2015 [Session 1]
In the LU decomposition of the matrix \(\begin{bmatrix} 2 & 2 \\ 4 & 9 \end{bmatrix}\), if the diagonal elements of \(U\) are both 1, then the lower diagonal entry \(l_{22}\) of \(L\) is ________.
Open complete paper
3
2015 · General Aptitude (GA) · Numerical Methods · Root Finding
Computer Science & Information Technology (CS) 2015 [Session 2]
The secant method is used to find the root of an equation f(x) = 0. It is started from two distinct estimates xa and xb for the root. It is an iterative procedure involving linear interpolation to a root. The iteration stops if f(xb) is very small and then xb is the solution. The procedure is given below. Observe that there is an expression which is missing and is marked by ?. Which is the suitable expression that is to be put in place of ? so that it follows all steps of the secant method?

Secant
Initialize: xa, xb, ε, N  // ε = convergence indicator
                       // N = maximum no. of iterations
fb = f(xb)
i = 0
while (i < N and |fb| > ε) do
  i = i + 1  // update counter
  xt = ?      // missing expression for
                // intermediate value
  xa = xb     // reset xa
  xb = xt     // reset xb
  fb = f(xb)  // function value at new xb
end while
if |fb| > ε then  // loop is terminated with i=N
  write "Non-convergence"
else
  write "return xb"
end if
Open complete paper
4
2017 · General Aptitude (GA) · Numerical Methods · Root Finding
Computer Science & Information Technology (CS) 2017 [Session 2]
The number of roots of \(e^x + 0.5x^2 - 2 = 0\) in the range \([-5, 5]\) is
Open complete paper