Reply To: Computer Science and Information Technology (CS)- Doubts [GATE 2012]

  1. @ Lorin Ahmed:
    According to me the answer should be c.
    Totally ordered set (TOS) is one in which there exists an ordering among every pair of elements. So the TOS for the problem are: (x,a1,y) (x,a2,y) (x,a3,y)….(x,an,y). Any set involving more than one ‘a’ cannot be totally ordered because no ordering exists between the a’s. So total n TOS.