Poset
Poset
Que. No. – 1
If f : R+ → R+, f(x) = x3, then f -1 _____.
(a) does not exist
(b) =x3
(c) = f
(d) =x
Answer:
Option (b)
Que. No. – 2
If f : Z → Z, f(x) = x - 7, then f -1 _____.
(a) does not exist
(b) = f
(c) = x7
(d) = x + 7
Answer:
Option (d)
Que. No. – 3
f f : {1, 2, 3, ..., n} → {2, 4, 6, ..., 2n}, f(n) = 2n, then f -1 _____.
(a) does not exist
(b) = f
(c) = n2
(d) = 4n
Answer:
Option (c)
Que. No. – 4
Let S be the relation on the set A={5,6,7,8}, S={(5,6), (6,6), (5,5), (8,8), (5,7), (7,7), (7,6)}
(a) S is reflexive and symmetric but not transitive
(b) S is reflexibe and transtive but not symmetric
(c) S is symmetric and transtive but not reflexive
(d) S is an equivalence relation
Answer:
Option (b)
Que. No. – 5
For f : R → R, f(x) = x2 + 4x + 5, f is _____.
(a) one - one and onto
(b) one - one but not onto
(c) not one - one but onto
(d) neither one - one nor onto
Answer:
Option (d)
Que. No. – 6
If f : R → R, f(x) = x3 then, f is _____.
(a) one - one and onto
(b) one - one but not onto
(c) not one - one but onto
(d) neither one - one nor onto
Answer:
Option (a)
Que. No. – 7
For f : R → R, f(x) = 5x + 7, f is _____.
Que. No. – 8
A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is ter
a) sublattice
b) lattice
c) trail
d) walk
Answer: b
Que. No. – 9
______ and _______ are the two binary operations defined for lattices.
a) Join, meet
b) Addition, subtraction
c) Union, intersection
d) Multiplication, modulo division
Answer: a
Que. No. – 10
Hasse diagrams are first made by ______
a) A.R. Hasse
b) Helmut Hasse
c) Dennis Hasse
d) T.P. Hasse
Answer: b
Que. No. – 11
The relation ≤ is a partial order if it is ___________
a) reflexive, antisymmetric and transitive
b) reflexive, symmetric
c) asymmetric, transitive
d) irreflexive and transitive
Answer: a
The Cartesian product of two sets A and B is denoted as 𝐴×𝐵 and is defined as
Que. No. – 12