Noida Institute of Engineering and Technology, Greater

Noida

Recurrence Relations and Combination(CO5)

Unit: 5

Discrete Mathematics
BHUSHAN
(AMCA 0105)
MCA Department
MCA 1st Semester

BHUSHAN BMCA 0105 and DM UNIT 5

1
11/20/24
 Noida Institute of Engineering and Technology, Greater
Noida
Brief Profile of Mr. BHUSHAN

• Mr. BHUSHAN is an eminent personality in the field of

computer science education, serving NIET Greater Noida as
Assistant Professor.
• He have 2+ years experience as I.T Professional
• He has guided around 30 PG thesis and projects of MCA
Students
• Online certification course on C++ Programming a Practical
Approach and Design analysis and Algorithms by Electronics.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 2

 Noida Institute of Engineering and Technology, Greater
Noida

Evaluation Scheme First Semester

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 3

 Noida Institute of Engineering and Technology, Greater
Noida
Course Contents / Syllabus
UNIT-I Set Theory, Relations & Functions 8 hours

Set Theory: Introduction, Size of sets and cardinals, Venn diagrams,

Combination of sets, Multisets, Ordered pairs, Set identities and Proofs of
some general identities on sets.
Relations & Functions: Definition, Operations on relations, Composite
relations, Properties of relations, Equality of relations, Partial order relation
and Recursive definition of relation. Functions - Definition, Classification
of functions, Operations on functions, Recursively defined functions and
Growth of Functions.
Natural Numbers: Introduction, Piano’s axioms, Mathematical Induction,
Strong Induction and Induction with Nonzero Base cases.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 4

 Noida Institute of Engineering and Technology, Greater
Noida

Course Contents / Syllabus

Posets, Hasse Diagram, Lattices and 8 hours
UNIT-2
Graph:
Posets, Hasse Diagram and Lattices: Introduction, Partial order sets,
Combination of partial order sets, Hasse diagram, Introduction of lattices,
Properties of lattices – Bounded, Complemented, Modular and Complete
lattice.
Graphs: Definition and terminology, Representation of graphs, Multigraphs,
Bipartite graphs, Planar graphs, Isomorphism and Homeomorphism of
graphs, Euler and Hamiltonian paths, Graph coloring
Trees: Definition, Binary tree, Binary tree traversal (BFS and DFS), Binary
search tree.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 5

 Noida Institute of Engineering and Technology, Greater
Noida
Course Contents / Syllabus
UNIT-3 Algebraic Structures, Rings and Fields 8 hours

Algebraic Structures: Introduction to algebraic Structures and properties.

Types of algebraic structures: Semi group, Monoid, Group, Abelian group
and Properties of group. Subgroup, Cyclic group, Cosets, Permutation and
Symmetric groups, Homomorphism and Isomorphism of groups.

Numerical Differentiation and Integration: Introduction, Numerical

Differentiation, Numerical Integration, Trapezoidal rule, Simpson’s rules

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 6

 Noida Institute of Engineering and Technology, Greater
Noida

Course Contents / Syllabus

UNIT-4 Propositional & Predicate Logic 8 hours

Propositional & Predicate Logic: Propositions well formed formula, Truth

tables, Tautology, Contradiction, Algebra of propositions, Theory of
Inference and Natural Deduction.

Frequency :Chart Different frequency chart like Histogram, Frequency

curve, Pi-chart.

Regression analysis: Linear and Non-linear regression, Multiple regressions.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 7

 Noida Institute of Engineering and Technology, Greater
Noida

Course Contents / Syllabus

UNIT 5 Recurrence Relations & Combinatorics 8 hours
Recurrence Relations and Generating Function: Introduction and
properties of Generating Function, Growth of functions, Recurrences from
algorithms, Simple Recurrence relation with constant coefficients and Linear
recurrence relation without constant coefficients. Methods of solving
recurrences
Combinatorics: Introduction, Counting Techniques, Pigeonhole Principle,
Pólya’s Counting Theory.
Testing of Hypothesis: Test of significance, Chi-square test, t-test, F-Test
Application to medicine, agriculture etc
Time series and forecasting: Moving averages, smoothening of curves,
forecasting models and methods

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 8

 Noida Institute of Engineering and Technology, Greater
Noida

Text Books :
1. Discrete Mathematics and Its Applications, Kenneth H. Rosen,
McGraw-Hill, 2006.
2. Discrete Mathematical Structures, B. Kolman, R. C. Busby, and S. C.
Ross, Prentice Hall, 2004.
3. Koshy, Discrete Structures, Elsevier Pub. 2008 Kenneth H. Rosen,
Discrete Mathematics and Its Applications, 6/e, McGraw-Hill, 2006.
Reference :
1. Discrete and Combinatorial Mathematics, R.P. Grimaldi, Addison
Wesley, 2004.
2. Discrete Mathematical Structures, Y N Singh, Wiley-India, First Edition,
2010.
3. Grewal B. S., “Numerical methods in Engineering and Science”,
Khanna Publishers, Delhi, 43rd Edition 2015.
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 9
 Noida Institute of Engineering and Technology, Greater
Noida

Online Link :
https://www.youtube.com/watch?
v=9AUCdsmBGmA&list=PL0862D1A947252D20&index=10

https://www.youtube.com/watch?
v=oU60TuGHxe0&list=PL0862D1A947252D20&index=11

https://www.youtube.com/watch?
v=_BIKq9Xo_5A&list=PL0862D1A947252D20&index=13

https://www.youtube.com/watch?
v=gs0dQF3pGqM&list=PLmXKhU9FNesTpQNP_OpXN7WaPwGx7NWsq

https://www.youtube.com/watch?v=Yk6-ZBb9vh4

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 10

 Noida Institute of Engineering and Technology, Greater
Noida

Course code AMCA0105 L T P Credits

Course title Discrete Mathematics 3 00 3

Course Objective
To develop mathematical ability in understanding mathematical
1 reasoning, ability to perform combinatorial analysis and
knowledge about discrete structures.
2 Perform operations on discrete mathematics such as sets,
functions and relations.
3 Verify the correctness of an argument using symbolic logic and
truth tables.
4 Solve problems using counting techniques and Combinatorics.
5 To improve formal reasoning skills acquisition and
mathematical knowledge.
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 11
 Noida Institute of Engineering and Technology, Greater
Noida

Course Outcome: At the end of course , the student will be able to:
CO1 Use mathematical and logical notation to define and formally reason about K1,K2
basic discrete structures such as Sets, Relations, Functions and Induction.

Apply mathematical arguments using logical connectives and quantifiers to

CO2 check the validity of an argument through truth tables and propositional and K1,K4
predicate logic.

CO3 Identify and prove properties of Algebraic Structures like Groups, Rings and K3
Fields

CO4 Apply the concept of Combinatorics to solve basic problems in discrete K2

mathematics

CO5 Formulate and solve recurrences and recursive functions K2,K4

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 12

 Noida Institute of Engineering and Technology, Greater
Noida

Program Outcomes
Program outcomes examine what a • Computational Knowledge
program or process is to do, achieve, • Problem Analysis
or accomplish for its own • Design /Development of Solutions
improvement and/or in support of • Conduct investigations of complex
institutional or divisional goals: Computing problems
generally numbers, needs, or • Modern Tool Usage
satisfaction driven. They can address
• Professional Ethics
quality, quantity, fiscal sustainability,
• Life-long Learning
facilities and infrastructure, or
• Project management and finance
growth.
• Communication Efficacy
• Societal and Environmental
Concern
• Individual and Team Work
• Innovation and Entrepreneurship

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 13

 Noida Institute of Engineering and Technology, Greater
Noida
PROGRAM EDUCATIONAL OBJECTIVES(PEO)

PEO 1: To produce successful post graduates for industry, government,

academia and PEO and research for lifelong learning to fulfill their goals .

PEO 2: To develop ethical leaders with strong communication ability

who will excel as individual and team in a society.

PEO 3: To produce successful innovative professional with computing

and analytical ability to design and develop system with entrepreneurial
aptitude.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 14

 CO-PO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12
3 3 2 3 2 2 2 2
CO 1

3 3 2 3 3 2 2 2
CO 2

3 3 3 3 2 3 2 2 2
CO 3

3 3 3 3 2 3 2 3 2
CO 4

3 3 3 2 2 2 3 2
CO 5

Scale H- High (3), M-Medium (2), L- Low (1)

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 15
 CO-PEO Mapping
PO PO PO PO PO PO PO PO PO PO PO PO
1 2 3 4 5 6 7 8 9 10 11 12

3 3 2 3 3 2 2 2 2 2
PEO 1

3 3 2 3 2 3 3 2 2 2
PEO 2

3 3 3 3 2 3 2 2 2 2
PEO 3

Scale H- High (3), M-Medium (2), L- Low (1)

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 16
 Result Analysis

Year Percentage
2020-21 97%
2019-20 100%
2018-19 100%

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 17

 Prerequisite and Recap

• Basic Understanding of mathematics

• Understand the concept of permutation and combination and their
similarity and difference
• Recurrence relation fundamental
• Recursive function
• Propositional & Predicate Logic

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 18

 Objective of Recurrence Relation(CO5)
The procedure for finding the terms of a sequence in a recursive manner
is it is solve by recurrence relation.

It is a way to define a sequence or array in terms of itself by using

recurrence relation.

Recurrence relation are help in solve the asymptotic notation then it

should be also used in analysis of program in term of time and space
complexity.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 19

 Recurrence Relation
A recurrence relation is an equation that recursively defines a sequence
where the next term is a function of the previous terms. First few term are
called initial condition of recurrence relation

Example 1 Fibonacci series Fn = Fn−1+ Fn−2

Example 2 an = an−1+ 2 with a0 = 1

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 20

 Linear Recurrence Relation

A linear recurrence equation of degree k or order k is a recurrence equation

which is in the format
xn = A1xn−1+A2xn−2+A3xn−3+…..+Akxn - k (An is a constant and Ak≠0) on a
sequence of numbers as a first-degree polynomial.

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 + 2 an−2 + 3 an−2
a3 = a0 + 2a1 + 3a2
= 1 + 2(6) + 3(10) = 43

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 21

 Linear Recurrence Relation

Linear recurrences has following types

Linear homogeneous recurrences

Linear non-homogeneous recurrences

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 22

 Linear homogeneous recurrences

A linear homogenous recurrence relation of degree k with constant

coefficients is a recurrence relation of the form

An = c1 An-1 + c2 An-2 + … + ck An-k,

where c1, c2, …, ck are real numbers, and ck ≠ 0.

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

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 23

 Example Linear homogeneous recurrences

Determine if the following recurrence relations are linear homogeneous

recurrence relations with constant coefficients.

Example 1 Pn = (1.11) Pn-1 a linear homogeneous recurrence relation

of degree one

Example 2 Fn = Fn-1 + Fn-2 a linear homogeneous recurrence relation

of degree two

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 24

 Solution of linear Recurrence Relation
We can find any solution of the form an = r n that satisfies the
recurrence relation.

Recurrence relation are given in that form

An = c1 An-1 + c2 An-2 + …………………. + ck An-k

Put the values an = rn in above recurrence relation

rn = c1rn-1 - c2rn-2 - … - ckrn-k

rn - c1rn-1 - c2rn-2 - … - ckrn-k = 0

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 25

 Solution of linear Recurrence Relation
dividing both sides by rn-k

rk - c1rk-1 - c2rk-2 - … - ck = 0

This equation is called the characteristic equation .

Its example characteristic equation is r2 - r - 1 = 0

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 26

 Solution of linear Recurrence Relation
Question1 What is the solution of the recurrence relation
an = an-1 + 2an-2 with a0=2 and a1=7?

Solution: Since it is linear homogeneous recurrence, first find its

characteristic equation
r2 - r - 2 = 0

(r+1)(r-2) = 0

r1 = 2 and r2 = -1

So, an = A2n + B(-1)n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 27

 Solution of linear Recurrence Relation

Now we should find A and B using initial conditions.

Put n = 0 and 1 in above equation

a0 = A + B = 2
a1 = 2A - B = 7
Solve above these equation A = 3 and B = -1

an = 3.2n - (-1)n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 28

 Solution of linear Recurrence Relation

Question 2 What is the solution of the recurrence relation

an = 6an-1 - 9an-2 with a0=1 and a1=6?

Solution: First find its characteristic equation

r2 - 6r + 9 = 0
(r - 3)2 = 0 r1 = 3

So, by theorem an = (A + Bn) (3)n is a solution.

Now we should find constants using initial conditions.

A = 1 and B= 1

an = 3n + n3n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 29

 Solution of linear Recurrence Relation

Question 3 What is the solution of the recurrence relation

an = -3an-1 - 3an-2 - an-3 with a0=1, a1=-2 and a2=-1?

Solution Find its characteristic equation

r3 + 3r2 + 3r + 1 = 0
(r + 1)3 = 0 then r1= -1
Then an = (A + B n + Cn2)(-1)n is a solution.
Now we should find constants using initial conditions. And find the
value of A, B and C
A = 1 B = 3 C = -2
Then put the value of A, B and C in above equation

an = (1 + 3n - 2n2) (-1)n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 30

 Solution of linear Recurrence Relation

Question 4 What is the solution of the recurrence relation

an = 8an-2 - 16an-4 , for n>=4,
with a0=1, a1=4, a2=28 and a3=32?

Solution: Find its characteristic equation

r4 - 8r2 + 16 = 0

(r2 - 4)2 = (r-2)2 (r+2)2 = 0

r1 = 2 and r2 = -2

an = (A + Bn)(2)n + (C + Dn)(-2)n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 31

 Solution of linear Recurrence Relation

Now we should find constants using initial conditions.

A = 1, B = 2, C= 0 and D=1

an = (1 + 2n) 2n + n (-2)n is a solution.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 32

 Linear non-homogeneous recurrences
A linear non-homogenous recurrence relation with constant coefficients is
a recurrence relation of the form

an = c1 an-1 + c2 an-2 + ………….. + ck an-k+ f(n)

where c1, c2, …….., ck are real numbers, and f(n) is a function depending
only on n.
The recurrence relation

an = c1 an-1 + c2 an-2 + ………….. + ck an-k is called the associated

homogeneous recurrence relation.

This recurrence includes k initial conditions.

a0 = C0 a1 = C1… ak = Ck

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 33

 Linear non-homogeneous recurrences
The following recurrence relations are linear non homogeneous
recurrence relations.

Example 1 an = an-1 + 2n

Example 2 an = an-1 + an-2 + n2 + n + 1

Example 3 an = an-1 + an-4 + n!

Example 4 an = an-6 + n2n

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 34

 Linear non-homogeneous recurrences

Q1 What is the solution of the recurrence relation

an = 2an-1 - an-2 + 2n for n>=2,
with a0=1 and a1=2?

Solution: Since it is linear non-homogeneous recurrence, b n

is similar to f(n) then bn = c2n + d

bn = 2bn-1 - bn-2 + 2n

c2n + d = 2(c2n-1 + d) - (c2n-2 + d) + 2n

c2n + d = c2n + 2d - c2n-2 - d + 2n

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 35

 Linear non-homogeneous recurrences

0 = (-4c + 4c - c + 4)2n-2 + (-d + 2d -d)

c = 4 and d=0

then bn = 4.2n.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 36

 Prerequisite and Recap of Combinatorics

Student is understands the concept of homogeneous and non

homogeneous recurrence relation

Student is understands the concept of linear and non linear recurrence

relation

Student is understands the solving the recurrence relation by various

methods

Student is understands the concept of permutation and combination.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 37

 Objective of Combinatorics

 Combinatorics is an area of mathematics primarily concerned with

counting.

 To learn about countale sets as like Counting Principle,

Permutations, and Combinations.

 Combinatorics is a branch of mathematics that studies usually finite

collections of objects that satisfy specified criteria.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 38

 Combinatorics

Combinatorics is an area of mathematics primarily concerned with

counting, both as a means and an end in obtaining results, and certain
properties of finite structures. It is closely related to many other areas
of mathematics and has many applications ranging from logic to
statistical physics, from evolutionary biology to computer science.

It is also called combinatorial mathematics, the field of mathematics

concerned with problems of selection, arrangement, and operation
within a finite or discrete system.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 39

 Pigeonhole Principle
In 1834, German mathematician, Peter Gustav Lejeune Dirichlet, stated
a principle which he called the drawer principle. Now, it is known as the
pigeonhole principle.

Pigeonhole Principle states that if there are fewer pigeon holes than
total number of pigeons and each pigeon is put in a pigeon hole, then
there must be at least one pigeon hole with more than one pigeon. If n
pigeons are put into m pigeonholes where n > m, there's a hole with
more than one pigeon.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 40

 Pigeonhole Principle
Suppose that there are 10 pigeons, and there are 9 pigeonholes

In the evening, each pigeon will pick one of the pigeonholes to stay

In one of the pigeonholes, there will be at least two pigeons

If k is a positive integer and k + 1 objects are placed into k boxes, then
at least one of the boxes will contain two ore more objects

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 41

 Pigeonhole Principle

Example – 1: A bag contains 10 red marbles, 10 white marbles, and 10

blue marbles. What is the minimum no. of marbles you have to choose
randomly from the bag to ensure that we get 4 marbles of same color?

Solution: Apply pigeonhole principle.

No. of colors (pigeonholes) n = 3
No. of marbles (pigeons) K+1 = 4
Therefore the minimum no. of marbles required = Kn+1
By simplifying we get Kn+1 = 10.
Verification: ceil[Average] is [Kn+1/n] = 4
[Kn+1/3] = 4
Kn+1 = 10
i.e., 3 red + 3 white + 3 blue + 1(red or white or blue) = 10

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 42

 Pigeonhole Principle

Example – 2: In a computer science department, a student club can be

formed with either 10 members from first year or 8 members from second
year or 6 from third year or 4 from final year. What is the minimum no.
of students we have to choose randomly from department to ensure that a
student club is formed?

Solution: we can directly apply from the above formula where,

q1 =10, q2 =8, q3 =6, q4 =4 and n=4
Therefore the minimum number of students required to ensure
department club to be formed is
10 + 8 + 6 + 4 – 4 + 1 = 25

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 43

 Prerequisite and Recap of Hypothesis

 A Hypothesis Test evaluates two mutually exclusive statements

about a population to determine which statement is best supported
by the sample data.

 A Statistic is a summary description of a characteristic or

measure of the sample and the Sample Statistic is used as an
estimate of the population parameter.

 A Sampling Distribution is a probability distribution of a statistic

obtained through a large number of samples drawn from a
specific population.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 44

 Objective of Hypothesis

 A Hypothesis Test evaluates two mutually exclusive statements about a

population to determine which statement is best supported by the
sample data.

 A Statistic is a summary description of a characteristic or measure of

the sample and the Sample Statistic is used as an estimate of the
population parameter.

 A Sampling Distribution is a probability distribution of a statistic

obtained through a large number of samples drawn from a specific
population.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 45

 Sampling
 A finite subset of a universe is called a sample.

 A sample is thus a small portion of the universe.

 The number of individuals in a sample is called the sample size.

 The process of selecting a sample from a universe is called sampling.

 The fundamental object of sampling is to get as much information as

possible of the whole universe by examining only a part of it

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 46

 Test of Significance
An important aspect of the sampling theory is to study the test of
significance which will enable us to decide, on the basis of the results
of the sample, whether

 The deviation between the observed sample statistic and the

hypothetical parameter value .

 The deviation between two sample statistics is significant or might be

attributed due to chance or the fluctuations of the sampling.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 47

 Test of Significance
 For applying the tests of significance, we first set up a hypothesis which
is a definite statement about the population parameter called Null
hypothesis denoted by H0.

 Any hypothesis which is complementary to the null hypothesis (H 0) is

called an Alternative hypothesis denoted by H 1

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 48

 Level of Significance
 The probability of the value of the variety falling in the critical region is
known as level of significance. The probability α that a random value of
the statistic t belongs to the critical region is known as the level of
significance.

 P(t ∈ ω| H0) = α

 the level of significance is the size of the type I error or the maximum
producer’s risk.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 49

 Testing of Hypothesis

What Is Hypothesis Testing in Statistics?

Hypothesis Testing is a type of statistical analysis in which you put your

assumptions about a population parameter to the test.

It is used to estimate the relationship between 2 statistical variables.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 50

 Null Hypothesis and Alternate Hypothesis

The Null Hypothesis is the assumption that the event will not occur.

A null hypothesis has no bearing on the study's outcome unless it is

rejected.

H0 is the symbol for it, and it is pronounced H-naught.

The Alternate Hypothesis is the logical opposite of the null

hypothesis.

The acceptance of the alternative hypothesis follows the rejection of

the null hypothesis and H1 is the symbol for it.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 51

 Null Hypothesis and Alternate Hypothesis

A sanitizer manufacturer claims that its product kills 95 percent of

germs on average.

To put this company's claim to the test, create a null and alternate
hypothesis.

H0 (Null Hypothesis) Average = 95%.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 52

 Null Hypothesis and Alternate Hypothesis

Alternative Hypothesis denoted by H1.

Another straightforward example to understand this concept is

determining whether or not a coin is fair and balanced.

The null hypothesis states that the probability of a show of heads is

equal to the likelihood of a show of tails.

In contrast, the alternate theory states that the probability of a show of
heads and tails would be very different.

Simple Hypothesis: A simple hypothesis specifies an exact value for the

parameter.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 53

 Chi Square Test
 When a coin is tossed 200 times, the theoretical considerations lead us
to expect 100 heads and 100 tails.

 But in practice, these results are rarely achieved. The quantity χ2 (a

Greek letter, pronounced as chi-square) describes the magnitude of
discrepancy between theory and observation.

 If χ = 0, the observed and expected frequencies completely coincide.

The greater the discrepancy between the observed and expected
frequencies, the greater is the value of χ2.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 54

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 55

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 56

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 57

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 58

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 59

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 60

 Chi Square Test

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 61

 Time Series
 A time series is a series of data points indexed in time order.

 Most commonly, a time series is a sequence taken at successive

equally spaced points in time.

 It is a sequence of discrete-time data.

 Time series tracks the movement of the chosen data points, such as a
security's price, over a specified period of time with data points
recorded at regular intervals.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 62

 Time Series
It has collect different types of data.

 Daily

 Monthly

 Quarterly

 Yearly

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 63

 Time Series

Tim
Timee
Series
Series

Sm No
No Yes
Yes
Smoothing
oothing Trend?
Trend
Trend
Methods
Methods Trend? Models
Models

Moving
Moving Exponential
Exponential
Average
Average Sm
Smoothing
oothing

Auto-
Auto-
Linear
Linear Quadratic
Quadratic Exponential
Exponential Regressive
Regressive

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 64

 Moving Averages
Moving Average is the most commonly used trend following
indicators.

They do not predict price direction, but rather smoothen out the price
data and define the current direction with a lag.

It filters out the “noise” from random price fluctuations thus makes it
easier to spot a trend.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 65

 Moving Averages

Simple Moving Average :

The most common type of moving average is the simple moving

average.

 It is simply takes the sum of all of the past closing prices over a time
period and divides the result by the total number of prices used in the
calculation.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 66

 Moving Averages

Linear Weighted Average :

The linear weighted average is the least common moving average.

 It takes the sum of all closing prices, multiplies them by the position
of the data point, and divides by the number of periods.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 67

 Moving Averages

Exponential Moving Average :

The exponential moving average leverages a more complex

calculation to smooth data and place a higher weight on more recent
data points.

Traders should remember that the EMA is more responsive to new

information relative to the simple moving average.

This makes it the moving average of choice for many technical traders

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 68

 T-test

 A t-test is a statistical test that is used to compare the means of two

groups.

 It is often used in hypothesis testing to determine whether a process

or treatment actually has an effect on the population of interest, or
whether two groups are different from one another.

 You want to know whether the mean petal length of iris flowers
differs according to their species.

 You find two different species of irises growing in a garden and

measure 25 petals of each species.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 69

 T-test

 You can test the difference between these two groups using a t-test
and null and alterative hypothesis.

 The null hypothesis (H0) is that the true difference between these
group means is zero.

 The alternate hypothesis (Ha) is that the true difference is different

from zero.

 t-test can only be used when comparing the means of two groups.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 70

 T-test

 If you want to compare more than two groups, or if you want to do

multiple pairwise comparisons, use an ANOVA test or a post-hoc test.

 The t-test is a Parametric test of difference, meaning that it makes the

same assumptions about your data as other parametric tests.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 71

 F-test

F test can be defined as a test that uses the f test statistic to check
whether the variances of two samples (or populations) are equal to the
same value.

To conduct an F-test, the population should follow an f distribution

and the samples must be independent events.

On conducting the hypothesis test, if the results of the F-test are
statistically significant then the null hypothesis can be rejected
otherwise it cannot be rejected.

The F-test is used to check the equality of variances using hypothesis

testing.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 72

 F-test

 The f test statistic or simply the f statistic is a value that is compared

with the critical value to check if the null hypothesis should be rejected
or not.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 73

 Forecasting Method
• Forecasting refers to the practice of predicting what will happen in
the future by taking into consideration events in the past and present.

• Basically, it is a decision-making tool that helps businesses cope

with the impact of the future’s uncertainty by examining historical
data and trends.

• It is a planning tool that enables businesses to chart their next moves

and create budgets that will hopefully cover whatever uncertainties
may occur.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 74

 Forecasting Methods

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 75

 Faculty Video Links, Youtube & NPTEL
Video Links and Online Courses Details
• Youtube/other Video Links
• https://www.youtube.com/watch?v=Dsi7x-A89Mw&list=PL0862D1
A94725 2D20&index=28
• https://www.youtube.com/watch?v=74l6t4_4pDg&list=PL0862D1A
947252D20&index=29
• https://www.youtube.com/watch?v=4d2XEn1j_q4&list=PL0862D1
A947252D20&index=30
• https://www.youtube.com/watch?v=qvw1GX93JSY&list=PL0862D
1A947252D20&index=32
• https://www.youtube.com/watch?v=ImLM1Vsr35c&list=PL0862D1
A947252D20&index=33

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 76

 Daily Quiz
Q1 Consider the recurrence relation a1=4, an=5n+an-1. The value of a64 is
_________
(a) 10399 (b) 23760 (c) 75100 (d) 53700
Q2 Determine the solution of the recurrence relation
Fn = 20Fn-1 − 25Fn-2 where F0 = 4 and F1 =14.
(a) an = 14*5n-1
(b) an = 7/2*2n−1/2*6n
(c) an = 7/2*2n−3/4*6n+1
(d) an = 3*2n−1/2*3n
Q3 Find the value of a4 for the recurrence relation an=2an-1+3, with a0=6.
(a) 320 (b) 221 (c) 141 (d) 65

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 77

 Daily Quiz
Q4 The solution to the recurrence relation an=an-1+2n, with initial term
a0=2 are _________
(a) 4n+7 (b) 2(1+n) (c) 3n2 (d) 5*(n+1)/2
Q5 What is the solution to the recurrence relation a n=5an-1+6an-2?
(a) 2n2 (b) 6n (c) (3/2)n (d) n!*3
Q6 Determine the value of a2 for the recurrence relation
an = 17an-1 + 30n with a0=3.
(a) 4387 (b) 5484 (c) 238 (d) 1437
Q7 Determine the solution for the recurrence relation
an = 6an-1−8an-2 provided initial conditions a0=3 and a1=5.
(a) an = 4 * 2n – 3n
(b) an = 3 * 7n – 5*3n
(c) an = 5 * 7n
(d) an = 3! * 5n

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 78

 Weekly Assignment
Q 1 Find the fifth term of (x + y)8
Q2 What do you mean by simple graph with example?
Q 3 Find the first four terms each of the following recurrence relation
ak = 2aK-1+k For all integers k >= 2, a1 = 1
Q4 Solve the recurrence relation an - an-1+2an-2 =0 then find the
particular solution ao = 0 and a1 = 1
Q 5 Find N if 2P ( N, 2) + 50 =P (2N, 2)
Q 6 Solve the recurrence relation an+2 - 5an+1+6an =2 with initial
condition ao = 1 and a1 = -1
Q7 Find the recurrence relation with initial condition for the following:

2, 10, 50, 250, …….

Q8 Solve the recurrence relation yn+2 - Yn+1 - 2yn =n2
Q9 Define Polya`s counting theory.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 79

 Weekly Assignment

Q10 Find the first four terms each of the following recurrence relation
ak = aK-1+ 3aK-2 For all integers k >= 2, a0 = 1, a1 = 2
Q11 Solve the recurrence relation 2ar-5ar-1+2ar-2 =0 then find the
particular solution ao = 0 and a1 = 1
Q12 Find N if P ( N, 4) = 42 P (N, 2)
Q13 Solve the recurrence relation yn+2 - Yn+1 - 2yn =n2
Q14 Construct a binary tree from the given two Travels
In order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
Post order 1, 4, 3, 2, 6, 8, 9, 11, 10, 7, 5
Q15 If NC5 = 20 NC4, find N

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 80

 MCQ s

Q1 A number is selected from the first 20 natural numbers. Find the

probability that it would be divisible by 3 or 7?
(a) 1946 (b) 2467 (c) 1237 (d) 720
Q2 If spinner has 3 equal sectors colored yellow, blue and red, then the
probability of landing on red or yellow after spinning this spinner is
_______
(a) 23 (b) 47 (c) 617 (d) 2347
Q3 In a secondary examination, 75% of the students have passed in History
and 65% in Mathematics, while 50% passed in both History and
Mathematics. If 35 candidates failed in both the subjects, what is the total
number of candidates sit for that exam?
(a) 658 (b) 398 (c) 764 (d) 350

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 81

 MCQ s

Q4 In a Press Conference, there are 450 foreign journalists. 275 people can
speak German, 250 people can speak English, 200 people can speak
Chinese and 260 people can speak Japanese. Find the maximum number of
foreigners who cannot speak at least one language.
(a) 401 (b) 129 (c) 324 (d) 415
Q5 How many positive integers less than or equal to 100 are divisible by 2,
4 or 5?
(a) 12.3 (b) 87.2 (c) 45.3 (d) 78.2
Q6 There is a class of 40 students out of which 16 are girls. There are 27
students who are right-handed. How many minimum numbers of girls who
are left-handed in this class?
(a) 17 (b) 56 (c) 23 (d) 3

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 82

 Glossary Questions
QAttempt all parts Fill in The Blanks,
Hints(Recurrence Relation, Linear Recurrence Relation,
Quadratic Equation, Combinatorics)
a …………is a branch of mathematics which is about counting – and
we will discover many exciting examples of “things” you can count.

b A …………are factoring, using the square roots, completing the

square and the quadratic formula.

c A …………… is a function or a sequence such that each term is a

linear combination of previous terms.

d A …………… is an equation that uses recursion to relate terms in a

sequence or elements in an array.

.
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 83
 Glossary Questions
QAttempt all parts Fill in The Blanks,
Hints(Pigeonhole Principle, Hypothesis testing, Moving Average ,
Chi-Square Test)
a The ………….. states that if n items are put into m containers, with n>m,
then at least one container must contain more than one item.

b …………… is an act in statistics whereby an analyst tests an assumption

regarding a population parameter.

c ................ is a calculation to analyze data points by creating a series of

averages of different subsets of the full data set.

d A ………… for independence compares two variables in a contingency

table to see if they are related.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 84

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 85

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 86

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 87

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 88

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 89

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 90

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 91

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 92

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 93

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 94

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 95

 Old Question Papers

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 96

 Expected Questions for University Exam
Q1 Find the middle term of (2x - 5)6
Q2 What do you mean by Planner graph with example?
Q 3 Find the first four terms each of the following recurrence relation
ak = aK-1+ 3aK-2 For all integers k >= 2, a0 = 1, a1 = 2
Q 4 Solve the recurrence relation 2ar-5ar-1+2ar-2 =0 then find the particular
solution ao = 0 and a1 = 1
Q5 Find N if P ( N, 4) = 42 P (N, 2)
Q 6 Solve the recurrence relation yn+2 - Yn+1 - 2yn =n2
Q7 Construct a binary tree from the given two Travels
In order 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11
Post order 1, 4, 3, 2, 6, 8, 9, 11, 10, 7, 5
Q8 If NC5 = 20 NC4, find N
Q9 Find the recurrence relation with initial condition for the following
1, 1, 3, 5, 8. 13. 21, …..
Q10 Define Pigeon hole Principle.
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 97
 Summary
After completion this unit student must be understand the concept
Recurrence Relations and their its solution. The permutation and
combination may be used in help us visualize the problem then we want
to find how many possible solution then select the best one of them.

11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 98

 References

1. Discrete Mathematics and Its Applications, Kenneth H. Rosen,

McGraw-Hill, 2006.

2. Discrete Mathematical Structures, B. Kolman, R. C. Busby, and S. C.

Ross, Prentice Hall, 2004.

3. Discrete and Combinatorial Mathematics, R.P. Grimaldi, Addison

Wesley, 2004.

4. Discrete Mathematical Structures, Y N Singh, Wiley-India, First

Edition, 2010.

1.
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 99
11/20/24 BHUSHAN BMCA 0105 and DM UNIT 5 100