GATE CS 2023 (Forenoon) — Question 48

Discrete MathematicsCombinatorics (Counting Rules, Summation Formulas)MCQ2 marks · −2/3 if wrongHard

Let \( U = \{1, 2, \dots, n\} \), where \( n \) is a large positive integer greater than 1000. Let \( k \) be a positive integer less than \( n \). Let \( A, B \) be subsets of \( U \) with \( |A| = |B| = k \) and \( A \cap B = \phi \). We say that a permutation of \( U \) separates \( A \) from \( B \) if one of the following is true. - All members of \( A \) appear in the permutation before any of the members of \( B \). - All members of \( B \) appear in the permutation before any of the members of \( A \). How many permutations of \( U \) separate \( A \) from \( B \)?
  1. A
    \( n! \)
  2. B
    \( \binom{n}{2k} (n - 2k)! \)
  3. C
    \( \binom{n}{2k} (n - 2k)! (k!)^2 \)
  4. D
    \( 2 \binom{n}{2k} (n - 2k)! (k!)^2 \)
Practise the full 2023-FN paper
Challenge a friend: WhatsApp Telegram
From RENYXERAFree All-India Mock — every SundayA full GATE CS paper, exactly 180 minutes, ranked across India with your GATE score.
Practise more on Combinatorics (Counting Rules, Summation Formulas)Timed, in the real exam interface · free to start

A GATE question every morning

One real past-paper question every morning for your branch, answer hidden until you tap. Free on Telegram.

Join
Stuck? Ask in the student group