1
GATE CSE 2015 Set 2
MCQ (Single Correct Answer)
+1
-0.3
Consider the following two statements.
$$S1:$$ If a candidate is known to be corrupt, then he will not be elected
$$S2:$$ If a candidate is kind, he will be elected
Which one of the following statements follows from $$S1$$ and $$S2$$ as per sound inference rules of logic?
2
GATE CSE 2014 Set 3
MCQ (Single Correct Answer)
+1
-0.3
Consider the following statements:
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good
L: P implies Q
M: Q implies P
N: P is equivalent to Q
P: Good mobile phones are not cheap
Q: Cheap mobile phones are not good
L: P implies Q
M: Q implies P
N: P is equivalent to Q
Which of the following about L, M, and N is Correct?
3
GATE CSE 2014 Set 1
MCQ (Single Correct Answer)
+1
-0.3
Consider the statement
"Not all that glitters is gold"
Predicate glitters$$(x)$$ is true if $$x$$ glitters and
predicate gold$$(x)$$ is true if $$x$$ is gold.
"Not all that glitters is gold"
Predicate glitters$$(x)$$ is true if $$x$$ glitters and
predicate gold$$(x)$$ is true if $$x$$ is gold.
Which one of the following logical formulae represents the above statement?
4
GATE CSE 2012
MCQ (Single Correct Answer)
+1
-0.3
The truth table
Represents the Boolean function
Questions Asked from Mathematical Logic (Marks 1)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2024 Set 2 (1)
GATE CSE 2023 (1)
GATE CSE 2021 Set 2 (1)
GATE CSE 2021 Set 1 (1)
GATE CSE 2016 Set 1 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 3 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2012 (3)
GATE CSE 2008 (1)
GATE CSE 2004 (2)
GATE CSE 2002 (1)
GATE CSE 2001 (1)
GATE CSE 1998 (1)
GATE CSE 1993 (1)
GATE CSE 1992 (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