Difficulty distribution
How the classified questions are distributed by difficulty.
5questions
Easy
5
100%
Numerical Methods - Engineering Mathematics - Biomedical Engineering Previous Year Questions
Practice Numerical Methods - Engineering Mathematics - Biomedical Engineering previous year questions organised from real papers, with year-wise coverage and clear topic navigation.
4Papers
4Years
5Questions
1Topics
Numerical Methods question pattern
Every graph below is calculated only from this selection.
Questions by year
Year-wise coverage for Numerical Methods. Each bar uses a separate theme-derived color.
Question type distribution
MCQ, numerical, multiple-select and other formats found in these papers.
5questions
MCQ
3
60%
Numerical Answer Type (NAT)
2
40%
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. Sort by year, question coverage or name.
| Paper | Year / session | Questions in this view | Open |
|---|---|---|---|
| Biomedical Engineering (BM) 2026 | 2026 | 1 | View paper |
| Biomedical Engineering (BM) 2025 | 2025 | 1 | View paper |
| Biomedical Engineering (BM) 2024 | 2024 | 2 | View paper |
| Biomedical Engineering (BM) 2020 | 2020 | 1 | View paper |
All Numerical Methods previous year questions
Practice every matching question in batches of 20, with every available option.
2020 · Biomedical Engineering · Engineering Mathematics · Numerical Methods
Biomedical Engineering (BM) 2020
The following recursion relation, when started from a finite positive non-zero value, converges to ________
\[ x_{n+1} = \frac{1}{2} \left( x_n + \frac{1}{x_n} \right) \]
\[ x_{n+1} = \frac{1}{2} \left( x_n + \frac{1}{x_n} \right) \]
2024 · Biomedical Engineering · Engineering Mathematics · Numerical Methods
Biomedical Engineering (BM) 2024
To solve the equation \(x = 2\cos x\) using Newton-Raphson's method, which one of the following iterations should be used?
2024 · Biomedical Engineering · Engineering Mathematics · Numerical Methods
Biomedical Engineering (BM) 2024
To solve the equation \(x = 2 \cos x\) using Newton-Raphson's method, which one of the following iterations should be used?
2025 · Biomedical Engineering · Engineering Mathematics · Numerical Methods
Biomedical Engineering (BM) 2025
Newton Raphson method is used to solve the equation \(x^3 - 2x - 5 = 0\) with an initial guess \(x_0 = 3\). What is \(x_1\), the value after ONE iteration? __________ (rounded off to two decimal places)
2026 · Biomedical Engineering · Engineering Mathematics · Numerical Methods
Biomedical Engineering (BM) 2026
The Newton-Raphson method is used to find the roots of the equation \(x = e^{-2x}\). If the initial guess \(x_0 = 0\), the estimate of the root after the first iteration, \(x_1 = \) ____