1
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of binary relations on a set with $$n$$ elements is:
2
GATE CSE 1999
MCQ (Single Correct Answer)
+1
-0.3
The number of binary strings of $$n$$ zeros and $$k$$ ones such that no two ones are adjacent is:
3
GATE CSE 1999
Subjective
+2
-0
(a) Mr. X claims the following:
If a relation R is both symmetric and transitive, then R is reflexive. For this, Mr. X offers the following proof.
"From xRy, using symmetry we get yRx. Now because R is transitive, xRy and yRx togethrer imply xRx. Therefore, R is reflextive."
Briefly point out the flaw in Mr. X' proof.
(b) Give an example of a relation R which is symmetric and transitive but not reflexive.
4
GATE CSE 1999
MCQ (Single Correct Answer)
+2
-0.6
Two girls have picked 10 roses, 15 sunflowers and 14 daffodils. What is the number of ways they can divide the flowers among themselves?
Paper analysis
Total Questions
Algorithms
6
Compiler Design
1
Computer Organization
6
Database Management System
8
Digital Logic
3
Discrete Mathematics
11
Operating Systems
7
Programming Languages
4
Theory of Computation
4
More papers of GATE CSE
GATE CSE 2024 Set 2
GATE CSE 2024 Set 1
GATE CSE 2023
GATE CSE 2022
GATE CSE 2021 Set 2
GATE CSE 2021 Set 1
GATE CSE 2020
GATE CSE 2019
GATE CSE 2018
GATE CSE 2017 Set 2
GATE CSE 2017 Set 1
GATE CSE 2016 Set 2
GATE CSE 2016 Set 1
GATE CSE 2015 Set 3
GATE CSE 2015 Set 2
GATE CSE 2015 Set 1
GATE CSE 2014 Set 2
GATE CSE 2014 Set 3
GATE CSE 2014 Set 1
GATE CSE 2013
GATE CSE 2012
GATE CSE 2011
GATE CSE 2010
GATE CSE 2009
GATE CSE 2008
GATE CSE 2007
GATE CSE 2006
GATE CSE 2005
GATE CSE 2004
GATE CSE 2003
GATE CSE 2002
GATE CSE 2001
GATE CSE 2000
GATE CSE 1999
GATE CSE 1998
GATE CSE 1997
GATE CSE 1996
GATE CSE 1995
GATE CSE 1994
GATE CSE 1993
GATE CSE 1992
GATE CSE 1991
GATE CSE 1990
GATE CSE 1989
GATE CSE 1988
GATE CSE 1987
GATE CSE
Papers
2023
2022
2020
2019
2018
2013
2012
2011
2010
2009
2008
2007
2006
2005
2004
2003
2002
2001
2000
1999
1998
1997
1996
1995
1994
1993
1992
1991
1990
1989
1988
1987