Wednesday, April 21, 2021 4:20 PM

ar-ar-2 =0 is a recurrence relation having degree 0 2 3 2

ar+2 - 5ar-2 =0 is a recurrence relation having degree 1 2 4 3
an= an-1+ 2an-2 with a9= 3 and a10=5 then a7 is 2 1 3 2
an= an-1+ 2an-2 with a9= 3 and a10=5 then a11 is 11 1 3 1
If the recurrence relation is given by ar-7ar-1 +12ar-2 =o 1 3 4 3
then it's largest characteristic root is
If the recurrence relation is given by ar-7ar-1 +12ar-2 =o 1 3 4 2
then it's smallest characteristic root is
If the recurrence relation is given by ar-2ar-1 +ar-2 =o 1,-1 1,1 1,2 2
then it's characteristic roots are
If the recurrence relation is given by ar- ar-2 =o then it's 1,-1 1,1 1,2 1
characteristic roots are
If the given recurrence relation is homogeneous having A(2)r +B(3)r+c(3)r A(2)r +(B+r C) (3)r none of these 2
roots 2,3,3 then ar will be
If the given recurrence relation is nonhomogeneous A A(2)r +(B+r C) (3)r none of these 1
having roots 2,3,3 and f( r) = 2 then particular solution is
ar(p) is
If the given recurrence relation is nonhomogeneous A A(2)r +(B+r C) (1)r Ar2 +Br3 3
having roots 2,1,1 and f( r) = 7r then particular solution
is ar(p) is
If the given recurrence relation is nonhomogeneous A (7r) A(2)r none of these 1
having roots 2,3,3 and f( r) = 7r then particular solution
is ar(p) is
If the given recurrence relation is nonhomogeneous A (7r) A(2)r none of these 3
having roots 1,3,7 and f( r) = 7r then particular solution
is ar(p) is
If the given recurrence relation is homogeneous having A(2)r +B(3)r+c(5)r A(2)r +(B+r 5C) (3)r none of these 1
roots 2,3,5 then ar will be
If the given recurrence relation is nonhomogeneous A r2 A(2)r +(B+r C) (3)r none of these 3
having roots 2,3,1 and f( r) = r2then particular solution is
ar(p) is
If the given recurrence relation is nonhomogeneous of one term of that two terms of that three term of that 3
degree 3 then to find total solution is ar one should recurrence relation recurrence relation recurrence relation
know
A relation R defined on set S is reflexive , symmetric and partial order relation total order relation equivalance relation 3
transitive then R is
A relation R defined on set S is reflexive , antisymmetric and partial order relation total order relation equivalance relation 1
transitive then R is
A relation R defined on set S whenever ( a,b) € R then (b,a) € R antisymmetric symmetric transitive 2
then relation R is
A relation R defined on set S and for every pair of elements if ( a,b) antisymmetric symmetric transitive 1
€ R and (b,a) € R then a=b relation R is
Let A= set of natural numbers and a≤ b iff a divides b then this symmetric partial order equivalance relation 2
relation is
Let A= set of nonzero integers and a≤ b iff a divides b then this antisymmetric symmetric not antisymmetric 3
relation is
Let A= set of natural numbers and a≤ b iff a divides b then with POSET TOSET can not predict 1
respect to this relation set A is
Let A= set of natural numbers and a≤ b iff a < b then with respect to POSET Not POSET can not predict 2
this relation set A is
A POSET in which every pair {a,b} of elements has l.u.b and g.l.b then Lattice TOSET Hasse diagram 1
it is called as a
Let L is a lattice then L is POSET L need not be POSET 1
Let L be lattice then for elements a,b,c in L the law ( a ꓦ b) ꓦ c= a ꓦ Associative law Absorption law Distributive law 1
( b ꓦ c ) is called as
Let L be lattice then for elements a,b in L the law a ꓦ (aꓥb) = a is Associative law Absorption law Distributive law 2
called as
Every complemented lattice is always distributive not distributive may or may not be 3
distributive
example of a modular lattice which is not distibutive is diamond pentagon Hexagon 1
Pentagon is example of a lattice which is distributive and distributive but not complemented but not 3

revision Page 1
Pentagon is example of a lattice which is distributive and distributive but not complemented but not 3
complemented complemented distributive
In Lattice D20 complement of element 2 is 10 20 does not exist 3
In lattice D20 atoms are 2 and 4 2 and 5 4 and 10 2
In lattice D8 atoms are 1 and 2 2 and 4 only 2 3
Lattice B2xB2 is example of Boolean Algebra Complemented but not Distributive but not 1
distributive lattice complemented lattice
In Lattice D20 complement of element 4 is 10 5 2 2
Disjuctive Normal form (DNF) is join of minterms meet of maxterms join of maxterms 1
Conjuctive Normal form (CNF) is join of minterms meet of maxterms join of maxterms 2
Pentagon is an example of non complemented non distributive lattice Boolean Algebra 2
lattice
If a lattice is distributive then It is modular It is complemented It is Boolean Algebra 1
If a lattice is modular then It is always It is never distributive It may or may not be 3
distributive distributive
If L is a lattice then every pair {a,b} of elements has l.u.b and g.l.b . TRUE FALSE 1
Let L= set of natural numbers and for elements a,b in L ,a≤ b iff a not a Lattice bounded Lattice unbounded Lattice 3
divides b then L is
Let L= set of nonzero integers for elements a,b in L , a≤ b iff a divides not a Lattice bounded Lattice unbounded Lattice 1
b then L is
Let A= {1,2,3,4,5} and for a,b in L a≤b iff a≥b then minimal element 1 2 5 5
is
Let s={a,b,c} and A is power ser of S and A1 ≤ A2 iff A1 is subset of 1 3 6 2
A2 then number of atoms are
Let s={a,b,c} and A is power ser of S and A1 ≤ A2 iff A1 is subset of {b} {c} {b,c} 3
A2 then comlpement of {a} is

revision Page 2