Discrete Mathematics
Set Theory & Algebra
Marks 1Marks 2Marks 5
Linear Algebra
Marks 1Marks 2
Combinatorics
Marks 1Marks 2
Mathematical Logic
Marks 1Marks 2Marks 5
Probability
Marks 1Marks 2
1
GATE CSE 2025 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Let $P(x)$ be an arbitrary predicate over the domain of natural numbers. Which ONE of the following statements is TRUE?

A
$(P(0) \wedge(\forall x[P(x+1)])) \Rightarrow(\forall x P(x))$
B
$(P(0) \wedge(\forall x[P(x) \Rightarrow P(x-1)])) \Rightarrow(\forall x P(x))$
C
$(P(1000) \wedge(\forall x[P(x) \Rightarrow P(x-1)])) \Rightarrow(\forall x P(x))$
D
$(P(1000) \wedge(\forall x[P(x) \Rightarrow P(x+1)])) \Rightarrow(\forall x P(x))$
2
GATE CSE 2024 Set 2
MCQ (Single Correct Answer)
+1
-0.33

Let p and q be the following propositions:

p: Fail grade can be given.

q: Student scores more than 50% marks.

Consider the statement: “Fail grade cannot be given when student scores more than 50% marks.”

Which one of the following is the CORRECT representation of the above statement in propositional logic?

A

q → ¬ p

B

q → p

C

p → q

D

¬ p → q

3
GATE CSE 2023
MCQ (More than One Correct Answer)
+1
-0

Geetha has a conjecture about integers, which is of the form

$$\forall x\left( {P(x) \Rightarrow \exists yQ(x,y)} \right)$$,

where P is a statement about integers, and Q is a statement about pairs of integers. Which of the following (one or more) option(s) would imply Geetha's conjecture?

A
$$\exists x\left( {P(x) \wedge \forall yQ(x,y)} \right)$$
B
$$\forall x\forall yQ(x,y)$$
C
$$\exists y\forall x\left( {P(x) \Rightarrow Q(x,y)} \right)$$
D
$$\exists x\left( {P(x) \wedge \exists yQ(x,y)} \right)$$
4
GATE CSE 2021 Set 2
MCQ (More than One Correct Answer)
+1
-0

Choose the correct choice(s) regarding the following propositional logic assertion S:

S : ((P ∧ Q)→ R)→ ((P ∧ Q)→ (Q → R))

A
The antecedent of S is logically equivalent to the consequent of S.
B
S is a tautology
C
S is a contradiction
D
S is neither a tautology nor a contradiction.
GATE CSE Subjects
Theory of Computation
Operating Systems
Algorithms
Digital Logic
Database Management System
Data Structures
Computer Networks
Software Engineering
Compiler Design
Web Technologies
General Aptitude
Discrete Mathematics
Programming Languages
Computer Organization