Gate CS-2006 Question Paper With Solutions

Q. 55 Given a set of elements N = {1, 2, …, n} and two arbitrary subsets A⊆N and B⊆N, how many of the n! permutations π from N to N satisfy min(π(A)) = min(π(B)), where min(S) is the smallest integer in the set of integers S, and π(S) is the set of integers obtained by applying permutation π to each element of S?

Gate CS-2006 Question Paper With Solutions

Answer: (C)

Explanation:

Gate CS-2006 Question Paper With Solutions

Learn More:   Gate CS-2014-3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here