mcs-033-IgnouAssignmentGuru 2017-2018 PDF

BCA MCA BA MA BDP B.COM M.COM B.
SC
http://www.ignouassignmentguru.com
1
IGNOU ASSIGNMENT GURU Page-
/IGNOUASSIGNMENTGURU
BCA MCA BA MA BDP B.COM M.COM B.SC
A.1.
A recursive definition of a sequence specifies
1) Initial conditions
2
2) Recurrence relation
Example:
a0=0 and a1=3 Initial conditions
an = 2an-1 - an-2 Recurrence relation
an = 3n Solution
Linear recurrence: Each term of a sequence is a linear function of

earlier terms in the sequence. For example:
a0 = 1 a1 = 6 a2 = 10
an = an-1 + 2an-2 + 3an-3
a3 = a0 + 2a1 + 3a2
= 1 + 2(6) + 3(10) = 43
Linear recurrences
1. Linear homogeneous recurrences
2. Linear non-homogeneous recurrences
A linear homogenous recurrence relation of degree k with constant coefficients is a
recurrence relation of the form an = c1an-1 + c2an-2 + + ckan-k, where c1, c2, , ck are
real numbers, and ck0.
an is expressed in terms of the previous k terms of the sequence, so its degree is k. This
recurrence includes k initial conditions. a0 = C0 a1 = C1 ak = Ck
A linear non-homogenous recurrence relation with constant coefficients is a
recurrence relation of the form a n = c1an-1 + c2an-2 + + ckan-k+ f(n), where c1, c2, ,
ck are real numbers, and f(n) is a function depending only on n. The recurrence relation
an = c1an-1 + c2an-2 + + ckan-k, is called the associated homogeneous recurrence
relation. This recurrence includes k initial conditions. a 0 = C0 a1 = C1 ak = Ck
A.2.
Homogeneous--- Order 1 and Degree1
Homogeneous---- Order 1 and Degree 0(No Degree)
Non-Homogeneous ----Order 2 and Degree 2
Non-Homogeneous---- Order 1 and Degree1
Homogeneous--- No order and 1 Degree
A.3.
(i) an = an-1 +7
Solution:-- Here a1 = 3 is given
When n = 2,
A2 = a2-1 +7
A2 = a1+7
A2 = 10
(ii) an = 2n an-1 , n>0
Solution:-- Here a0 = 1 is given
When n = 1,
A1 = 2n a1-1
A2 =22 a0
3
A2 = 4*1
A2 = 4
(iii) an = 6 an-1 - 8 an-2 , n>0
Solution:-- Here a1 = 0 and a0 = 1 is given
When n = 2,
A2 = 6 a2-1 - 8 a2-2
A2 = 6 a1 - 8 a0
A2 = 6 *0 - 8 *1
A2 = -8
A.4.
A.5.
According to formula,
An = P( 1 +r/100)
Where A is total amount after n years , r is the rate. P is the amount initially
An =10, 000( 1 + 10/100)

=10,000( 1 +0.1)
=10,000(1.1)
An =10,000(1.1)
now, put n = 1
A1 =10, 000(1.1),
put n =2 ,
4
A2 =10,000(1.1)
in the same way ,

A3 =10, 00(1.1)
you can see that

A2/A1 = A3/A2
so, {An} is in Geometric progression .
now,
amount payable after 5years
A5 =10,000(1.1)^5
=16, 105.1 Rs
A.6.
A.7.
Finding Hamiltonian paths or circuit is a problem similar to the determination of an Eulerian
path or an Eulerian circuits is to determine a path or a circuit that passes through each vertex
in a graph once and only once. Sir William Hamiltonian invented the game All around the
world in which the player is asked to determine a route along the dodecahedron that will
pass through each angular point once and only once.
5
Hamiltons A Voyage Round the World Puzzle In 1857, Irish mathematician Sir William
Rowan Hamilton, invented a puzzle A Voyage round the world. It consisted of a wodden
dodecahedron, with a peg at each vertex of the dodecahedron, and string. The twenty
vertices of the dodecahedron were labeled with different cities in the world.
The object of the puzzle was to start at a city and travel along the edges of the dodecahedron,
visiting each of the other 19 cities exactly once, and end up at the first city.
The solution of Hamiltons puzzle is shown below with dark lines.
Hamiltons paths: A path in the graph is said to be Hamiltonian path if it traverses each of
the vertices once and only once. Path in fig(3.6.20) with dark lines is an Hamiltonian path.
6
A.8.
(i) Diracs
T Theorem 1 (Dirac's Theorem): If G=(V(G),E(G)) is connected graph on n-vertices
so that for every x,yV(G), where xy, and deg(x)+deg(y)n for all x,yV(G), then G is a Hamiltonian graph.
Let's verify Dirac's theorem by testing to see if the following graph is Hamiltonian:
A.8.(ii)
Ore's Theorem
Ore's theorem is a vast improvement to Dirac's theorem:
Theorem 2 (Ore's Theorem): If G=(V(G),E(G)) is connected graph on n-vertices where n3] so that
for [[x,yV(G), where xy, and deg(x)+deg(y)n for each pair of non-adjacent
vertices x and y then G is a Hamiltonian graph.
Recall that two vertices are said to be adjacent if they are connected by an edge. Two
vertices x and y are said to be adjacent if {x,y}E(G). Thus, non-adjacent vertices x and y are vertices
such that {x,y}E(G).
Let's see if this theorem is accurate by testing the graph from earlier, let's call it G. This graph is
on 6 vertices and is clearly Hamiltonian. Let's verify this with Ore's theorem. The only pair of non-adjacent
vertices are c and f, since {c,f}E(G). For G to be Hamiltonian, it must follow that:
7
(1)
deg(c)+deg(f)64+4686
Thus according to Ore's theorem, the graph G is Hamiltonian.
A.8.(iii)
A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is
a graph cycle (i.e., closed loop) through a graph that visits each node exactly once (Skiena
1990, p. 196). A graph possessing a Hamiltonian cycle is said to be a Hamiltonian graph.
By convention, the singleton graph is considered to be Hamiltonian even though it does
not posses a Hamiltonian cycle, while the connected graph on two nodes is not.
SO , both the Graph is Hamilton Circuit because these grapghs contains a cycle containing
all the Vertices.
A.9.
A.10
The argument given is the total number of subsets for a set of nnelements. Combinations, on
the other hand, count the number of subsets of a given size.
For example, consider the set {1, 2, 3}{1, 2, 3}. There are 23=823=8 total subsets (of all
sizes), which are
{, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2, 3}}{, {1}, {2}, {3}, {1, 2}, {1, 3}, {2, 3}, {1, 2
, 3}}
The subsets are symmetric in inclusion/exclusion (and this is why you only have two boxes: the
first box represents inclusion and the second exclusion), for example the set {2}{2} has a
complement, namely {1, 3}{1, 3} where the first set is obtained by keeping 22 while the second
set is obtained by throwing away 22.
Combinations count the subsets of a particular size (nn choose rr counts the number of rr-
element subsets of an nn-element set). In our running example consider how many subsets
of size 22 there are:
8
{{1, 2}, {1, 3}, {2, 3}}{{1, 2}, {1, 3}, {2, 3}}
for a total of (32)(32). The symmetry noted from before is also reflected in the fact that the
binomial coefficients are symmetric
(nr)=(nnr)(nr)=(nnr)
which represents the fact that for every rr-element subset that you keep, there's
corresponding nrnr-element subset that you've thrown away.
Of course the two concepts are intimately related. The total number of subsets is the sum of
the number of subsets of every size.
2n= r=0n (nr)2n=r=0n(nr)

This is in essense what the familiar binomial theorem states.
A.11(i)
(ii)
9
(iii)
10

mcs-033-IgnouAssignmentGuru 2017-2018 PDF

Transféré par

Informations du document

Description originale:

Titre original

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

mcs-033-IgnouAssignmentGuru 2017-2018 PDF

Transféré par

Droits d'auteur :

Formats disponibles

BCA MCA BA MA BDP B.COM M.COM B.

Linear recurrence: Each term of a sequence is a linear function of

An =10, 000( 1 + 10/100)

in the same way ,

you can see that

so, {An} is in Geometric progression .

The solution of Hamiltons puzzle is shown below with dark lines.

Thus according to Ore's theorem, the graph G is Hamiltonian.

2n= r=0n (nr)2n=r=0n(nr)

Vous aimerez peut-être aussi