GATE | GATE CS 1997 | Question 41

A partial order ≤ is defined on the set S= {x, a₁, a₂,…..a_n, y} as x < a_i for all i and a_i ≤ y for all i, where n≥1. The number of total orders on the set S which contain the partial order ≤ is
(A) n!
(B) n+2
(C) n
(D) 1


Answer: (A)

Explanation:

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save