Quiznetik

Discrete Structure (DS) | Set 3

1. The Relation is----------if a has relation with b and b has relation with a.

A. Reflexive

B. Symmetric

C. Transitive

D. None

Correct : B. Symmetric

2. If a has relation with b and b has relation with c then a has relation with c is………………..Relation.

A. Reflexive

B. Symmetric

C. Transitive

D. None

Correct : C. Transitive

3. Types of function Mappings are-----

A. One to one

B. Many to one

C. Into, Onto

D. All

Correct : D. All

4. The Transitive Closure of a relation R is denoted by----

A. R*

B. R

C. R+

D. RR

Correct : A. R*

5. The alternative method to find transitive closure of R* is-------.

A. R*

B. RR

C. Warshall’s Algorithm

D. R

Correct : C. Warshall’s Algorithm

6. Poset is a------

A. Positive set

B. p-set

C. P*

D. Partially Ordered set

Correct : D. Partially Ordered set

7. If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called -------

A. Poset

B. p-set

C. Positive set

D. None

Correct : A. Poset

8. Let (A, ≤) be a poset. A subset of A is known as ------if every pair of elements in the subset are related.

A. Chain

B. Antichains

C. Group

D. Lattice.

Correct : A. Chain

9. The number of elements in the chain is called as------

A. Chain

B. Antichains

C. None

D. Length of chain

Correct : D. Length of chain

10. A ------ is a poset (A, ≤) in which every subset {a, b} of A, has a least upper bound and a greatest lower bound.

A. Chain

B. Lattice.

C. Antichains

D. Group

Correct : B. Lattice.

11. Pigeon Hole Principle says that if there are many pigeons and a few pigeon holes, then there must be some pigeon holes occupied by--------------

A. Two or more pigeons.

B. Pigeons

C. One only

D. None

Correct : A. Two or more pigeons.

12. Digraph can be represented by-----

A. Hasse diagrams

B. Digraph

C. Graph

D. None

Correct : A. Hasse diagrams