Professional Documents
Culture Documents
DSGT MCQ 2
DSGT MCQ 2
a) equal to(=)
b) less than(<)
c) greater than(>)
d) not equal to(!=)
In a poset (S, ⪯), if there is no element n∈S with m<n, then which of the following is
true?
a) {v, x, y, z}
b) 1
c) ∅
d) {vx, xy, yz}
Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a
divides b. Number of edges in the Hasse diagram of is ______
a) 6
b) 5
c) 9
d) 4
If a partial order is drawn as a Hasse diagram in which no two edges cross, its
covering graph is called ______
a) upward planar
b) downward planar
c) lattice
d) biconnected components
A Poset in which every pair of elements has both a least upper bound and a
greatest lower bound is termed as _______
a) sublattice
b) lattice
c) trail
d) walk
______ and _______ are the two binary operations defined for lattices.
a) Join, meet
b) Addition, subtraction
c) Union, intersection
d) Multiplication, modulo division
A ________ has a greatest element and a least element which satisfy 0<=a<=1 for
every a in the lattice(say, L).
a) semilattice
b) join semilattice
c) meet semilattice
d) bounded lattice
At a software company, skilled workers have been hired for a project. Out of 75
candidates, 48 of them were software engineer; 35 of them were hardware engineer; 42
of them were network engineer; 18 of them had skills in all three jobs and all of them had
skills in at least one of these jobs. How many candidates were hired who were skilled in
exactly 2 jobs?
a) 69
b) 14
c) 32
d) 8
Draw the Hasse diagram representing the partial ordering {(a, b)| a divides b} on
Q1 5M
{1,2,3,4,6,8,12}
Draw the Hasse diagram of the following sets under the partial ordering relation
divides and indicate those which are chain
Q2 5M
1. A = {2,4,12,24}
2. A = {1,3,5,15,30}
What is the solution of the recurrence relation an - 10an-1 - 25 an-2 =0 with initial
Q3 5M
conditions a0= 1 and a1 = 2 ?