The GATE Grind

GATE 2007 CS – Question 2

Engineering Mathematics · Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices · 1 mark · Multiple choice

S has n elements. How many ordered pairs are in the largest and smallest equivalence relations on S respectively?

  1. n and n
  2. $n^2$ and n
  3. $n^2$ and0
  4. n and1

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (B) $n^2$ and n

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices questions

All Discrete Mathematics: Sets, Relations, Functions, Partial Orders and Lattices questions →