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

  1. Lorin Ahmed

    A partial Order <= is defined on the set S={x, a1, a2, a3,…, an, y} as x<=ai and ai<=y. for all i, where n >=1. The number of totaL orders on the set S which contains the partial order <= is:
    (A) n!
    (B) n+2
    (C) n
    (D) 1

    I think the answer is B.

    Does anybody else know the answer…