AB Sir’s Coaching

Department of Computer Science

B.Sc. Honours (3rd Semester)

Class Test, 2023

CC6 (Computational Mathematics)

Full Mark: 50 Time: 2 Hours

[Answer question no. 1 and any four questions from the rest]

1. Answer any five questions. (5x2=10)

a. If y= 4x^6 -5x, find the percentage error in y at x=1, if the error in x=0.04.
b. Define the Graph Colouring problem.
c. An unbiased coin is tossed 60 times.
(i) How many possible outcomes are there?
(ii) How many of them have exactly 45 heads and 15 tails?
d. If 22/7 is approximated as 3.14, find the absolute and relative errors.
e. What is minimum spanning tree?
f. Why is Newton-Raphson method called a second-order iterative process?
g. “Every edge of a tree is a cut set” – Justify.

2. a) Give the formal definition of a function, its domain and range. Illustrate with proper
examples a one-to-one and a onto function.
b) State the Principle of Inclusion and Exclusion for n number of sets.
c) Among how many students in a class, at least two of them have first names that begin
with the same letter? ((2+1+1)+ 3 + 3)

3. a) What is the Cartesian product of A×B×C, where A = {0, 1}, B = {1, 2}

and C = {0, 1, 2}?
b) How many bit strings of length 8 either start with a 1 bit or end with the two bits 00?
c) State the Bayes’ theorem on conditional probability. (3+ 3 + 4)

4. a) State and prove generalized pigeonhole principle.

b) What do you mean by random experiment and random variable?
c) Find the number of primes less than 200 using the principle of Inclusion and Exclusion.
(4 + 4 + 2)

5. a) Find the Generating Function for the finite sequence 1, 4, 16, 64, 256.
b) Define the big oh notation. What does it estimate? What is tautology?
c) Find the big O estimate of the function f(n) = 5n^4 – 37n^3 + 13n -4.
(2 + (2+3) + 3)

6. a) Define a recurrence relation. Give a suitable example.

b) Consider functions f(x), g(x) and h(x) such that f(x)=O(g(x)), g(x)=O(h(x)).
Show that f(x) = O(h(x)).
c) Solve the recurrence relation together with the given initial condition:
an=5an-1 -6an-2 for n>=2, a0=1, a1=0. ((2+2) + 3 + 3)
7. a) State and Prove Lagrange’s Interpolation formula.
b) Find the smallest positive root of the following equation f (x) = x^3–3x^2 + x + 1 = 0
using Secant method.
c) Use 4th order R-K method to solve the following firrerential equation correct upto five
decimal places. Compute y(0.4) from dy/dx = x + y, y(0)= 1, h= 0.1. (3 + 3 + 4)

8. a) Prove that a given connected graph G is an Eular graph if and only if all the vertices of
G are of even degree.
b) Prove that a simple graph with n vertices and k components can have atmost
(n-k)(n-k+1)/2 edges.
c) What is an arbitrarily traceable graph? (4 + 4 + 2)