Web Page

Syllabus: Propositional and first order logic.

$$\scriptsize{\overset{{\large{\textbf{Mark Distribution in Previous GATE}}}}{\begin{array}{|c|c|c|c|c|c|c|c|}\hline
\textbf{Year}&\textbf{2024-1}&\textbf{2024-2}&\textbf{2023}& \textbf{2022}& \textbf{2021-1}&\textbf{2021-2}&\textbf{Minimum}&\textbf{Average}&\textbf{Maximum}
\\\hline\textbf{1 Mark Count}&0&1&1& 0 & 1&1&0&0.67&1
\\\hline\textbf{2 Marks Count}&0&0&0&0 & 0&0&0&0&0
\\\hline\textbf{Total Marks}& 0&1&1& 0 & 1&1&\bf{0}&\bf{0.67}&\bf{1}\\\hline
\end{array}}}$$

Hot questions in Mathematical Logic

2 votes
1 answer
586
A complement of a cyclic graph on 5 vertices , has an Hamiltonian circuit . (True/False)
2 votes
2 answers
590
1. (∀x (p(x) → q(x)) and (∀x p(x) → ∀x q(x))2.∃x p(x)∧∃x q(x) and ∃x (p(x)∧q(x))3.(∀x (p(x) ↔ q(x)) and (∀x p(x) ↔ ∀x q(x))are logically eq...
0 votes
1 answer
592
Which recurrence relation satisfy the sequence: 2, 3, 4, . . ., for n ≥ 1.A ) T(N) = 2 T(N-1) - T(N-2) B)T(N) = T(N-1) + T(N-2)C)T(N) = N+1D)None of these
3 votes
1 answer
594
2 votes
1 answer
595
Let G be the graph defined as the the Hasse diagram for the ⊆ relation on the set P{1,2,...,n}.(n>0).Determine how many edges are there in G.
0 votes
2 answers
596
2 votes
1 answer
598
0 votes
3 answers
599
1 votes
1 answer
600
The notation $\exists ! x P(x)$ denotes the proposition “there exists a unique $x$ such that $P(x)$ is true”. Give the truth values of the following statements : I)${...