NPTEL Problem Solving Through Programming In C Week 10 Assignment Answers 2025
1. How can you improve the best-case efficiency in bubble sort? (The input is already sorted)
Answer :- For Answers Click Here
2. Bisection method is used to find
a) Derivative of a function at a given point
b) Numerical integration of a function within a range
c) Root of a function
d) None of the above
Answer :-
3. In ……………, search starts at the beginning of the list and checks every element in the list.
a) Linear search
b) Binary search
c) Hash search
d) Binary tree search
Answer :-
4.
a) 40
b) 30
c) Compilation error
d) Runtime error
Answer :-
5. Assuming an initial range [1,5], the second (at the end of 2 iterations) iterative value of the root of te-t 0.3 = 0 using the bisection method is (Note: you need to find the root, not the function value)
Answer :- For Answers Click Here
6. What would be the equivalent pointer expression for referring to the array element a[i][j][k][l]?
a) (((*(a+i)+j)+k)+l)
b) *(*(*(*(a+i)+j)+k)+l)
c) (*(*(a+i)+j)+k+l)
d) *((a+i)+j+k+l)
Answer :-
7.
a) 23,11
b) 23,23
c) 11,17
d) 17,17
Answer :-
8.
a) 40
b) 80
c) 120
d) 160
Answer :-
9.
Answer :-
10. What is the solution of the equation given below using the Bisection Method up to four decimal places? (Consider the root lying on positive quadrant only and compute the root till five iterations only)
f(x) = xe2x – 3x2 — 5
Answer :- For Answers Click Here
