Discrete Mathematics Types Relations Online Exam Quiz

Discrete Mathematics Types Relations GK Quiz. Question and Answers related to Discrete Mathematics Types Relations. MCQ (Multiple Choice Questions with answers about Discrete Mathematics Types Relations

Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?

Options

A : {(a,b) | a >= b and a, b belong to {1, 2, 3}}

B : {(a,b) | a > b and a, b belong to {1, 2, 3}}

C : {(a,b) | a <= b and a, b belong to {1, 2, 3}}

D : {(a,b) | a = b and a, b belong to {1, 2, 3}}

View Answer

Let A and B be two non-empty relations on a set S. Which of the following statements is false?

Options

A : A and B are transitive ? A?B is transitive

B : A and B are symmetric ? A?B is symmetric

C : A and B are transitive ? A?B is not transitive

D : A and B are reflexive ? A?B is reflexive

View Answer

Let R be a relation between A and B. R is asymmetric if and only if ________

Options

A : Intersection of D(A) and R is empty, where D(A) represents diagonal of set

B : R-1 is a subset of R, where R-1 represents inverse of R

C : Intersection of R and R-1 is D(A)

D : D(A) is a subset of R, where D(A) represents diagonal of set

View Answer

Let S be a set of n>0 elements. Let be the number Br of binary relations on S and let Bf be the number of functions from S to S. The expression for Br and Bf, in terms of n should be ____________

Options

A : n2 and 2(n+1)2

B : n3 and n(n+1)

C : n and n(n+6)

D : 2(n*n) and nn

View Answer

Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational numbers,then R’ is _________

Options

A : not equivalence relation

B : an equivalence relation

C : transitive and asymmetry relation

D : reflexive and antisymmetric relation

View Answer

Let A be a set of k (k>0) elements. Which is larger between the number of binary relations (say, Nr) on A and the number of functions (say, Nf) from A to A?

Options

A : number of relations

B : number of functions

C : the element set

D : number of subsets of the relation

View Answer

The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________

Options

A : O(n)

B : O(logn)

C : O(n(n+(3/2)))

D : O(n3)

View Answer

The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________

Options

A : reflective, symmetric and transitive

B : irreflexive, symmetric and transitive

C : neither reflective, nor irreflexive but transitive

D : irreflexive and antisymmetric

View Answer

Determine the characteristics of the relation aRb if a2 = b2.

Options

A : Transitive and symmetric

B : Reflexive and asymmetry

C : Trichotomy, antisymmetry, and irreflexive

D : Symmetric, Reflexive, and transitive

View Answer

Chemical Engineering Basics - Part 1 more Online Exam Quiz

Discrete Mathematics Subsets

Discrete Mathematics Terms Binomial Expansion

Discrete Mathematics Test

Discrete Mathematics Tree Traversal

Discrete Mathematics Types Algorithms

Discrete Mathematics Venn Diagram

Discrete Mathematics Written Test

Electric Drives Acceleration Time

Electric Drives Ac Motor Systems

Electric Drives Application Modified Characteristics