Answer Sheet of

MC0074

Prepared By: Arnab Biswas

Roll No. : 52091 2050
Semester: III
Course: MCA
 1. Briefly explain the concept of Bernoulli’s process

A Bernoulli process is a finite or infinite sequence of independent random variables X1, X2, X3, ...,
such that

 For each i, the value of Xi is either 0 or 1;

 For all values of i, the probability that Xi = 1 is the same number p.

In other words, a Bernoulli process is a sequence of independent identically distributed Bernoulli

trials.

Independence of the trials implies that the process is memoryless. Given that the probability p is
known, past outcomes provide no information about future outcomes. (If p is unknown, however, the
past informs about the future indirectly, through inferences about p.)

If the process is infinite, then from any point the future trials constitute a Bernoulli process identical to
the whole process, the fresh-start property.

Formal definition
The Bernoulli process can be formalized in the language of probability spaces as a random sequence
in {0, 1}, a single random variable.

A Bernoulli process is then a probability triple and a random variable X mapping Ω into
the set {0, 1}N such that for every , one has X(ω)i = 1 with probability p and X(ω)i = 0 with
probability 1 − p.

Where there is no possible confusion, Xi(ω) may be written Xi.

Bernoulli sequence
The term Bernoulli sequence is often used informally to refer to a realization of a Bernoulli process.
However, the term has an entirely different formal definition as given blow.

Suppose a Bernoulli process formally defined as a single random variable (see preceding section).
For every there is a sequence of integers

called the Bernoulli sequence associated with the Bernoulli process. For example,
if ω represents a sequence of coin flips, then the associated Bernoulli sequence is the list of
natural numbers or time-points for which the coin toss outcome is heads.

Page 2 of 6 Prepared by Asish Das

 So defined, a Bernoulli sequence is also a random subset of the index set, the natural
numbers .

Almost all Bernoulli sequences are ergodic sequences

Bernoulli map

Because every trial has one of two possible outcomes, any sequence of trial outcomes may be
represented by a sequence of zeroes and ones, which may be interpreted as the binary digital
representation of a real number between zero and one.

If the probability parameter p for the original process is 1/2, then the sequence of 0s and 1s is the
sequence of binary digits of a real-valued random variable that is uniformly distributed on the unit
interval [0, 1].

Consider the shift operator T that takes each random variable in a discrete-time stochastic process to
its successor:

For the outcome of our Bernoulli process, also known as our real number x ∈ [0, 1], the shift
operator is then given by the Bernoulli map or the 2x mod 1 map

where z ∈ [0, 1] represents a given sequence of measurements, and is the floor

function, the largest integer less than or equal to z. The Bernoulli map essentially lops off
one digit of the binary expansion of z.

The Bernoulli map is an exactly solvable model of deterministic chaos. The transfer
operator, or Frobenius–Perron operator, of the Bernoulli map is solvable;
the eigenvalues are powers of 1/2, and the eigenfunctions are the Bernoulli polynomials.

2. If is approximated by 0.667, find the absolute and relative errors?

Page 3 of 6 Prepared by Asish Das

 absolute error = 0.001666666...
relative error = 0.0024999 approx

3. Write a program in C++ language for the addition of two matrices.

#include<iostream.h>

#include<conio.h>

void main()

{ int ch,a[10][10],b[10][10],c[10][10],m,n,o,p,i,j;
clrscr();

cout<<"Enter row no. and column no. of matrix 1: ";cin>>m>>n;

cout<<"Enter row no. and column no. of matrix 2: ";cin>>o>>p;

if (m!=o||n!=p) cout<<"Matrix cannot be added";

else

{ cout<<"\nEnter elements of matrix 1..\n";

for (i=0;i<m;i++) for (j=0;j<n;j++) cin>>a[i][j];
cout<<"\nEnter elements of matrix 2..\n";

for (i=0;i<o;i++) for (j=0;j<p;j++) cin>>b[i][j];

for (i=0;i<m;i++)

for (j=0;j<n;j++) c[i][j]=a[i][j]+b[i][j];

cout<<"\nMatrix after addition..\n";

for (i=0;i<m;i++)

{
for (j=0;j<n;j++) cout<<c[i][j]<<" ";
cout<<"\n";
}
}
}
}

4. Find a real root of the equation x3 – 4x – 9 = 0 using the bisection method

Page 4 of 6 Prepared by Asish Das

 First Let x0 be 1 and x1 be 3

F(x0)= x3 – 4x -9
=1–4–9
= -12 < 0
F(x1)=27 – 12 – 9
=6>0

Therefore, the root lies between 1 and 3

Now we try with x2 =2

F(x2)= 8 – 8 – 9

= -9 < 0

Therefore, the root lies between 2 and 3

X3

= (x1+x2)/2

=(3+2)/2

= 2.5
F(x3)= 15.625 – 10 – 9

= - 3.375 < 0

Therefore, the root lies between 2.5 and 3

X4
= (x1+x3)/2
= 2.75

5. Find the cubic polynomial which takes the following values y(0) = 1, y(1) =
0, y(2) = 1 and y(3) = 10 . Hence obtain the value of y(0.5).

Page 5 of 6 Prepared by Asish Das

 y(x) = 1 - 2 x2 + x3

Check:

y(0) = 1, y(1) = 0, y(2) = 1 and y(3) = 10

y(0.5) = 0.625

6. Evaluate using Trapezoidal rule with h = 0.2. Hence determine the value
of π. 1021xdx

Page 6 of 6 Prepared by Asish Das