Name of the student:- Kolla Preethi

Course Name :- Mathematical foundation for computer application

Course Code: 21VMT0C101
Assignment:-2

Q1) For the given Hasse diagram

Find the GLB and LUB of following pairs 1. (g, j) 2. (d, h)
Solution:
1. (g, j)
GLB of (g,j)
LB (g,j)= { }
Therefore, GLB of(g,j)= { }
LUB of (g,j)
UB of (g,j)
Element g is related to:-
{g,k,l,n} Element j is related to:-
{j,i,n,m} UB of(g,j)={n}
Therefore LUB of (g,j)={n}.
2. (d, h)
GLB of (d,h)
LB of (d,h)
Elements related to d={d,b,a}
Elements related to h={h}
LB = { }
Therefore GLB of (d,h) ={ }
LUB of (d,h)
Elements related to d={ }
Elements related to h= {n}
Therefore LUB of (d,h)={ }
Q2 ) Suppose we have 5 alphabets (a, b, c, d, e) and 5 envelops ( 𝐸1, 𝐸2, 𝐸3,
𝐸4, 𝐸5 ) In how many ways we can place such that
1. At least one letter is wrongly placed
Solution:
For at least one letter wrongly placed in envelope:-
Total alphabets=5(a,b,c,d,e)
Total envelopes=5(E1,E2,E3,E4,E5)
The possibility of all alphabets in correct envelopes=1
No. of ways at least 1 in incorrect envelope = Total- all alphabets in correct
envelopes
 5!-1= 120 – 1 = 119
ways Q2.a)
2. At least one letter is correctly placed
Solution:
When at least one alphabet is correctly placed in envelope
 Total – incorrect placement for all
 Incorrect placement for all= dn=!n=!5=44
 Total= 5!=120
 120 – 44 =76 ways.

Q3.) Find the solution of the second order homogeneous recurrence

relation:-
𝑎𝑛 + 2 𝑎𝑛−1 - 3𝑎𝑛−2 = 0, n ≥ 2
With 𝑎0 = 1 & 𝑎1 = 2

Solution:
an + 2an-1 – 3an-2 =0, n>=2 with a0=1 & a1=2
On comparing with
Cnan + Cn-1an-1 + Cn-2an-2=0, n>=2
Given Recurrence Relation is 2nd order Homogeneous Recurrence Relation with
Cn=1, Cn-1=2 , Cn-2=-3
It’s auxiliary form:-
Cnk^2 + Cn-1k + Cn-2=0
K^2 + 2k – 3=0
K^2 + 3k – k - 3=0
K(k+3) – 1(k+3)=0
K= 1,-3
K1=1, k2=-3
The roots are real and distinct , the general solution for real and distinct
roots are:-
an= A(k1)^n + B (k2)^n
an=A(1)^n + B(-3)^n] eqn
1 Let n=0
a0=A(1) ^0 + B(-3)^0
1=A+B] eqn 2

Let n=1
a1=A(1)^1 + B(-3)^1