1
GATE CSE 2023
MCQ (Single Correct Answer)
+2
-0.67
Let $$U = \{ 1,2,....,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?
2
GATE CSE 2020
Numerical
+2
-0
The number of permutations of the characters in LILAC so that no character appears in its original position, if the two L’s are indistinguishable, is _______.
Your input ____
3
GATE CSE 2016 Set 1
Numerical
+2
-0
The coefficient of $${x^{12}}$$ in $${\left( {{x^3} + {x^4} + {x^5} + {x^6} + ...} \right)^3}\,\,\,\,\,\,$$ is _____________.
Your input ____
4
GATE CSE 2014 Set 2
Numerical
+2
-0
The number of distinct positive integral factors of 2014 is _______ .
Your input ____
Questions Asked from Combinatorics (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2023 (1)
GATE CSE 2020 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 1 (2)
GATE CSE 2008 (5)
GATE CSE 2007 (2)
GATE CSE 2006 (3)
GATE CSE 2005 (3)
GATE CSE 2004 (3)
GATE CSE 2001 (1)
GATE CSE 1999 (1)
GATE CSE 1998 (2)
GATE CSE 1996 (1)
GATE CSE 1994 (1)
GATE CSE 1989 (1)
GATE CSE 1988 (1)
GATE CSE 1987 (1)
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages