# When are the members of two sets more common relatively?

+1 vote
When are the members of two sets more common relatively?

(a) Jaccard Index is Closer to 1

(b) Jaccard Index is Closer to 0

(c) Jaccard Index is Closer to -1

(d) Jaccard Index is Farther to 1

Query is from Hash Tables topic in division Hash Tables of Data Structures & Algorithms I

I got this question during an online exam.

+1 vote
by (786k points)
selected by

The correct option is (a) Jaccard Index is Closer to 1

Easy explanation - Jaccard Coefficient Index is defined as the ratio of total elements of intersection and union of two sets. For two disjoint sets, the value of the Jaccard index is zero. The members of two set more common relatively when the Jaccard Index is Closer to 1.

+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote
+1 vote