retagged by
533 views

2 Answers

1 votes
1 votes

Similar question: https://gateoverflow.in/333214/gate2020-cs-17

So, the total number of relations over a set of  $n$  elements is:  $2^{n^{2}}$

No. of elements excluding the diagonal elements:  $n^{2}-n$

These elements can either be chosen or not chosen. (we have to chose diagonal elements.So only 1 way to chose them all)

So, the total number of reflexive relations possible over a set of  $n$  elements is:  $2\times2\times....(n^{2}-n)times$  $=$   $2^{n^{2}-n}$

For this question,  $n=5$  $\Rightarrow$  answer is :  $2^{25-5}=2^{20}$

Option C is correct.

Answer:

Related questions

3 votes
3 votes
1 answer
1
1 votes
1 votes
1 answer
3
admin asked Mar 30, 2020
452 views
The relation $\{(1,2),(1,3)(3,1),(1,1),(3,3),(3,2),(1,4),(4,2),(3,4)\}$ is ReflexiveTransitiveSymmetricAsymmetric
0 votes
0 votes
1 answer
4
admin asked Mar 31, 2020
6,492 views
Given a class named student, which of the following is a valid constructor declaration for the class?Student student(){}Private final student(){}Student(student s){}Void ...