Print Page | Close Window

gate 2006 question no 24 Printed From: One Stop GATE Category: GATE Previous Years Test Papers - Discuss Here Forum Name: CS Papers Forum Discription: Computer Science Previous Year GATE Papers to can discussed here. URL: http://forum.onestopgate.com/forum_posts.asp?TID=167 Printed Date: 07Feb2025 at 11:35pm Topic: gate 2006 question no 24 Posted By: Vijay007 Subject: gate 2006 question no 24 Date Posted: 02Feb2007 at 5:17pm please solve this with explanation.the answer given is D given a set of elements N={1,2,...,n} and two arbitary subsets A and B of the set N.how many of the n! permutations M from N to N satisfy min(M(A))=min(M(B)) where min(S) is the smallest integer in the set of integers S,and M(S) is the set of integers obtained by applying permutation M to each of the element of S? A) (n-|A U B|)|A||B| B) (|A|^2 + |B|^2)n^2 C) n!(|A intersection B|)/(|A U B|) D) |A intersection B|^2*permutation(n,|A U B|)

Print Page | Close Window