Active TopicsActive Topics  Display List of Forum MembersMemberlist  CalendarCalendar  Search The ForumSearch  HelpHelp
  RegisterRegister  LoginLogin
 One Stop GATE ForumGATE Previous Years Test Papers - Discuss HereCS Papers
Message Icon Topic: gate 2006 question no 24 Post Reply Post New Topic
Author Message
Vijay007
Newbie
Newbie


Joined: 02Feb2007
Online Status: Offline
Posts: 19
Quote Vijay007 Replybullet Topic: gate 2006 question no 24
    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|)



Post Resume: Click here to Upload your Resume & Apply for Jobs

IP IP Logged
Post Reply Post New Topic
Printable version Printable version

Forum Jump
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot delete your posts in this forum
You cannot edit your posts in this forum
You cannot create polls in this forum
You cannot vote in polls in this forum

GET LATEST FRESHERS JOBS IN YOUR MAIL





This page was generated in 0.063 seconds.
Vyom is an ISO 9001:2000 Certified Organization

© Vyom Technosoft Pvt. Ltd. All Rights Reserved.

Job Interview Questions | Girls Magazine | DLL, OCX File Errors | Freshers Jobs | Placement Papers | More Papers