1
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
Consider the following well-formed formulae:
$${\rm I}.$$ $$\,\,\neg \forall x\left( {P\left( x \right)} \right)$$
$${\rm I}{\rm I}.\,\,\,\,\,\,\neg \exists x\left( {P\left( x \right)} \right)$$
$${\rm I}{\rm I}{\rm I}.\,\,\,\,\,\,\neg \exists x\left( {\neg P\left( x \right)} \right)$$
$${\rm I}V.\,\,\,\,\,\,\exists x\left( {\neg P\left( x \right)} \right)$$
Which of the above are equivalent?
2
GATE CSE 2009
MCQ (Single Correct Answer)
+2
-0.6
The binary operation ◻ is defined as follows:
Which one of the following is equivalence to $$P \vee Q$$?
3
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
If $$P$$, $$Q$$, $$R$$ are Boolean variables, then $$(P + \bar{Q}) (P.\bar{Q} + P.R) (\bar{P}.\bar{R} + \bar{Q})$$ simplifies to
4
GATE CSE 2008
MCQ (Single Correct Answer)
+2
-0.6
Let fsa and $$pda$$ be two predicates such that fsa$$(x)$$ means $$x$$ is a finite state automation, and pda$$(y)$$ means that $$y$$ is a pushdown automation. Let $$equivalent$$ be another predicate such that $$equivalent$$$$(a,b)$$ means $$a$$ and $$b$$ are equivalent. Which of the following first order logic statements represents the following:
Each finite state automation has an equivalent pushdown automation.
Questions Asked from Mathematical Logic (Marks 2)
Number in Brackets after Paper Indicates No. of Questions
GATE CSE 2021 Set 1 (1)
GATE CSE 2020 (1)
GATE CSE 2018 (1)
GATE CSE 2016 Set 2 (1)
GATE CSE 2015 Set 2 (1)
GATE CSE 2014 Set 2 (1)
GATE CSE 2014 Set 3 (1)
GATE CSE 2014 Set 1 (1)
GATE CSE 2013 (2)
GATE CSE 2011 (1)
GATE CSE 2010 (1)
GATE CSE 2009 (3)
GATE CSE 2008 (5)
GATE CSE 2007 (1)
GATE CSE 2006 (5)
GATE CSE 2005 (3)
GATE CSE 2004 (2)
GATE CSE 2003 (1)
GATE CSE 2000 (1)
GATE CSE 1996 (1)
GATE CSE 1995 (1)
GATE CSE 1994 (1)
GATE CSE 1990 (1)
GATE CSE Subjects
Discrete Mathematics
Programming Languages
Theory of Computation
Operating Systems
Computer Organization
Database Management System
Data Structures
Computer Networks
Algorithms
Compiler Design
Software Engineering
Web Technologies
General Aptitude