National University of Computer and Emerging Sciences, Lahore Campus

Course: Numerical Computing Course Code: CS2008

Program: BSCS Semester: Fall 2023.
Duration: November 1, 2023. Total Marks: 20
Paper Date: Waqar Azeem Weight
Section: 5G Page(s): 1
Exam: Assignment 2 Roll No:
Instruction/Notes: Attempt All Questions

1. Find where the graphs of 𝑦 = 3𝑥 and 𝑦 = 𝑒 𝑥 intersect by finding roots of 𝑒 𝑥 − 3𝑥 = 0, using

Regula Falsi method correct to four decimal digits.
1
2. The equation 𝑥 − 𝑅𝑥 −1 = 0 has 𝑥 = ±𝑅 2 for its solution. Establish Newton’s iterative scheme, in
simplified form, for this situation. Carry out five steps for 𝑅 = 25 and 𝑥0 = 1.
𝑥2
3. Computer the root of the equation 𝑥2𝑒− 2 = 1 in the interval (0, 2) using the secant method
correct to three decimal places.

4. Solve the following system of equations by Factorization and Crout’s method

4𝑤 + 𝑥 + 2𝑦 − 3𝑧 = −16

−3𝑤 + 3𝑥 − 𝑦 + 4𝑧 = 20

−𝑤 + 2𝑥 + 5𝑦 + 𝑧 = −4

5𝑤 + 4𝑥 + 3𝑦 − 𝑧 = −1

5. Write an algorithm and code of the following methods in C++/Python/Mathematica.

a) Newton Rapson Method
b) Regula Falsi Method
c) Secant Method