Assignment – 10
Consider there are n students in a class. There can be a tie among the marks of the students. In how
many ways these n students can be ranked in an exam. List all the ways.
For example:
2 students {a,b}
Possible ways: 3
(i) Rank-1: a, Rank-2: b
(ii) Rank-1: b, Rank-2: a
(iii) Rank-1: a,b
3 students {a,b,c}
Possible ways: 13
(i) Rank-1: a, Rank-2: b, Rank-3: c
(ii) Rank-1: a, Rank-2: c, Rank-3: b
(iii) Rank-1: b, Rank-2: a, Rank-3: c
(iv) Rank-1: b, Rank-2: c, Rank-3: a
(v) Rank-1: c, Rank-2: a, Rank-3: b
(vi) Rank-1: c, Rank-2: b, Rank-3: a
(vii) Rank-1: a, Rank-2: b,c
(viii) Rank-1: b,c, Rank-2: a
(ix) Rank-1: b, Rank-2: a,c
(x) Rank-1: a,c, Rank-2: b
(xi) Rank-1: c, Rank-2: a,b
(xii) Rank-1: a,b, Rank-2: c
(xiii) Rank-1: a,b,c
The name of the program should be assign10_<ROLL_NO>.c.