Question 1

Complete
Mark 1.00 out of 1.00

Flag question

Question text

In the analysis of algorithm, this refers to the volume of memory.

Select one:
a. Process Complexity
b. Space complexity
c. Step complexity
d. Time complexity

Question 2
Complete
Mark 1.00 out of 1.00

Flag question

Question text

In numerical integration, when both the end points of the interval of integration
are used as nodes in the methods, the methods are called closed type methods
Select one:
True
False

Question 3
Complete
Mark 1.00 out of 1.00

Remove flag
Question text

For an interval of 0 to 1, a subinterval with a size of 0.2 will give n = 5 described

as 5 segment Trapezoidal rule.
Select one:
True
False

Question 4
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Simpson’s 1/3 rule uses a second degree polynomial formed by the two points of
the original function.
Select one:
True
False

Question 5
Complete
Mark 1.00 out of 1.00

Flag question

Question text

For a two segment trapezoidal rule, it will use the points similar to the ones used
by Simpson’s 1/3 rule.
Select one:
True
False

Question 6
Complete
Mark 1.00 out of 1.00

Flag question

Question text

In the analysis of algorithm, this refers to the number of steps to be taken in an

algorithm.
Select one:
a. Space complexity
b. Step complexity
c. Time complexity
d. Process Complexity

Question 7
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The coefficients of the Newton's interpolating polynomial can also be expressed

in terms of divided difference.
Select one:
True
False

Question 8
Complete
Mark 1.00 out of 1.00

Flag question

Question text
A cubic polynomial can interpolate three points.
Select one:
True
False

Question 9
Complete
Mark 1.00 out of 1.00

Remove flag

Question text

First order differences is equivalent f[x0,x1] when i = 0.

Select one:
True
False

Question 10
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Which of the following statements about algorithm is INCORRECT?

Select one:
a. Algorithms should have explicitly defined set of inputs and outputs
b. Algorithms must have a unique name
c. Algorithms can run for infinitely
d. Algorithms are well-ordered with unambiguous operations

Question 11
Complete
Mark 1.00 out of 1.00
 Flag question

Question text

The degree of the polynomial for the 10 sample values or data points is equal to
10.
Select one:
True
False

Question 12
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Given the function f(x) = 0.75 + 1.1x, an exact value can be given instantly by
Trapezoidal rule
Select one:
True
False

Question 13
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Another method called midpoint rule is an open type method numerical

integration.
Select one:
True
False

Question 14
Complete
Mark 1.00 out of 1.00

Flag question

Question text

In using smaller integration interval for multiple segments, Trapezoidal method

can reduce the approximation error better than Simpson’s 1/3 rule
Select one:
True
False

Question 15
Complete
Mark 1.00 out of 1.00

Flag question

Question text

If the interval of the function is given as 0 to pi, for n = 6 segments, each node
or segments will be

Select one:
True
False

Question 16
Complete
Mark 1.00 out of 1.00
 Flag question

Question text

In the analysis of algorithm, this is the number of steps taken on any instance of
size a.
Select one:
a. best-case
b. worst-case
c. amortized
d. average-case

Question 17
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The same algorithm can be represented in several different ways.

Select one:
True
False

Question 18
Complete
Mark 1.00 out of 1.00

Flag question

Question text
This is an informal and human readable description of an algorithm leaving
many granular details of it.
Select one:
a. Process
b. Algorithm
c. Pseudocode
d. Instruction

Question 19
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Which of the following correctly describes an algorithm?

Select one:
a. It is an efficient method that can be expressed within finite amount of time
and space.
b. All of these
c. An algorithm is a set of steps of operations to solve a problem performing
calculation, data processing, and automated reasoning tasks.
d. Algorithm is being used to determine the most practical kinds of solution to
solve a problem.

Question 20
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Sequential algorithm is an algorithm which can be executed a piece at a time on

many different processing devices, and then combined together again at the
end to get the correct result.
Select one:
True
False

Question 21
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Using Newton’s interpolation, with data given below compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
x2 = 5 f(x2) = 9
The solution of Y(1.5)=4.8
Select one:
True
False

Question 22
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Best-case is the maximum number of steps taken on any instance of size of a

variable.
Select one:
True
False

Question 23
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
x2 = 5 f(x2) = 9
The first order from x0 = 3 to x1 = 5 has a value of 1
Select one:
True
False

Question 24
Complete
Mark 1.00 out of 1.00

Flag question

Question text

If there is a randomized algorithm that solves a decision problem in time t and

outputs the correct answer with probability 0.5, then there is a randomized
algorithm for the problem that runs in time Θ(t) and outputs the correct answer
with probability at least 0.99.
Select one:
True
False

Question 25
Complete
Mark 1.00 out of 1.00
 Flag question

Question text

The approximate integral of

Select one:
True
False

Question 26
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Only four points are needed in constructing a fourth order Newton Divided
Difference polynomial,
Select one:
True
False

Question 27
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The approximate integral of

Select one:
True
False

Question 28
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The coefficient a0 is also equal to f(x0) in the Newton’s interpolating polynomial.

Select one:
True
False

Question 29
Complete
Mark 1.00 out of 1.00

Flag question

Question text

From the two data points (1,4) and (3, 7), and (4,10) using Lagrange polynomial
method, the polynomial is Li(x) = 0.5x2 -0.5x +2.
Select one:
True
False

Question 30
Complete
Mark 1.00 out of 1.00
 Flag question

Question text

Using Lagrange interpolation, with data given below compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
x2 = 5 f(x2) = 9
the solution is f(1.5) = 4.8
Select one:
True
False

Question 31
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
x2 = 5 f(x2) = 9
The second ordervalue is 1/3.
Select one:
True
False

Question 32
Complete
Mark 1.00 out of 1.00
 Flag question

Question text

If the function, f(x) = cos3x was approximated by the polynomial, P(1.5) = -0.2,
the amount of error approximately 0.05
Select one:
True
False

Question 33
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Which of the following is the first step in solving computational problems?

Select one:
a. Problem definition
b. Specification of an Algorithm
c. Designing an Algorithm
d. Development of a model

Question 34
Complete
Mark 1.00 out of 1.00

Flag question

Question text
This is defined as the high level descriptions of instruction which is intended for
human reading.
Select one:
a. Process
b. Algorithm
c. Pseudocode
d. Instruction

Question 35
Complete
Mark 1.00 out of 1.00

Flag question

Question text

An algorithm design technique is a general approach to solving problems

algorithmically that is applicable to a variety of problems from different areas of
computing.
Select one:
True
False

Question 36
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The point was added to the Simpson’s 1/3 Rule which gives a better

approximation to the integral of the function.

Select one:
True
 False

Question 37
Complete
Mark 1.00 out of 1.00

Flag question

Question text

In numerical differentiation, using a very small step size may increase the
approximation error.
Select one:
True
False

Question 38
Complete
Mark 1.00 out of 1.00

Flag question

Question text

The complexity of sorting algorithm measures the running time as a function of

the number n of items to be sorter.
Select one:
True
False

Question 39
Complete
Mark 1.00 out of 1.00

Flag question
Question text

In Newton-Cotes integration methods, the nodes are uniformly distributed in

[a, b] with x0 = a, xn = band the spacing h = (b – a) / n.

Select one:
True
False

Question 40
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Reducing the equidistant points improves the approximation of the function, f(x)
by the polynomial, P.
Select one:
True
False

Question 41
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Numerical integrations such as Trapezoidal and Simpson’s 1/3 rule should have
intervals that are uniform.
Select one:
True
False

Question 42
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Simpson’s 1/3 rule is an example of an open type numerical integration method

Select one:
True
False

Question 43
Complete
Mark 1.00 out of 1.00

Flag question

Question text

While using two sets of points (x0,y0) and (x1,y1) a straight line is formed and
could use the slope equation which follows that the first derivative can be
approximated using the given values.
Select one:
True
False

Question 44
Complete
Mark 1.00 out of 1.00

Flag question

Question text

For both the Trapezoidal and Simpson’s 1/3 rule , using more strips will give
better approximation of the curve.
Select one:
True
False

Question 45
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Thealgorithm of the Trapezoidalrule is described by

>>h=(b-a)/n
>>x=a sum=f(x)
>>for i=1:n-1
>>x=x+h
>>sum=sum+2*f(x)
>> end
>>sum=sum+f(b)
>>(b-a)*sum/(2*n)
Select one:
True
False

Question 46
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Using Lagrange interpolation, with data given below compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
the solution is f(1.5) = 4.5
Select one:
True
False

Question 47
Complete
Mark 1.00 out of 1.00

Flag question

Question text

To measure the efficiency of the algorithm, the space and time efficiency are the
important factors
Select one:
True
False

Question 48
Complete
Mark 1.00 out of 1.00

Flag question

Question text

In the analysis of algorithm, this is maximum number of steps taken on any

instance of size a.
Select one:
a. best-case
b. average-case
c. worst-case
d. amortized
Question 49
Complete
Mark 1.00 out of 1.00

Flag question

Question text

Using Newton’s interpolation, with data given below to compute for f(1.5)
x0 = 0 f(x0) = 2
x1 = 3 f(x1) = 7
x2 = 5 f(x2) = 9
The first order from x0 = 0 to x1 = 3 has a value of 4.8 which is similar to
Lagrange.
Select one:
True
False

Question 50
Complete
Mark 1.00 out of 1.00

Flag question

Question text

From the two data points(2,5) and (6, 11), using Lagrange polynomial method,
the polynomial is Li(x) = 1.5x +2.
Select one:
True
False