Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most answered questions in Discrete Mathematics
59
votes
7
answers
101
GATE CSE 2003 | Question: 32
Which of the following is a valid first order formula? (Here \(\alpha\) and \(\beta\) are first order formulae with $x$ as their only free variable) $((∀x)[α] ⇒ (∀x)[β]) ⇒ (∀x)[α ⇒ β]$ $(∀x)[α] ⇒ (∃x)[α ∧ β]$ $((∀x)[α ∨ β] ⇒ (∃x)[α]) ⇒ (∀x)[α]$ $(∀x)[α ⇒ β] ⇒ (((∀x)[α]) ⇒ (∀x)[β])$
Kathleen
asked
in
Mathematical Logic
Sep 16, 2014
by
Kathleen
16.8k
views
gatecse-2003
mathematical-logic
first-order-logic
normal
54
votes
7
answers
102
GATE CSE 2009 | Question: 3
Which one of the following is TRUE for any simple connected undirected graph with more than $2$ vertices? No two vertices have the same degree. At least two vertices have the same degree. At least three vertices have the same degree. All vertices have the same degree.
gatecse
asked
in
Graph Theory
Sep 15, 2014
by
gatecse
11.3k
views
gatecse-2009
graph-theory
normal
degree-of-graph
28
votes
7
answers
103
GATE CSE 2009 | Question: 26
Consider the following well-formed formulae: $\neg \forall x(P(x))$ $\neg \exists x(P(x))$ $\neg \exists x(\neg P(x))$ $\exists x(\neg P(x))$ Which of the above are equivalent? $\text{I}$ and $\text{III}$ $\text{I}$ and $\text{IV}$ $\text{II}$ and $\text{III}$ $\text{II}$ and $\text{IV}$
gatecse
asked
in
Mathematical Logic
Sep 15, 2014
by
gatecse
5.5k
views
gatecse-2009
mathematical-logic
normal
first-order-logic
47
votes
7
answers
104
GATE CSE 2000 | Question: 2.7
Let $a, b, c, d$ be propositions. Assume that the equivalence $a ⇔ ( b \vee \neg b)$ and $b ⇔c$ hold. Then the truth-value of the formula $(a ∧ b) → (a ∧ c) ∨ d$ is always True False Same as the truth-value of $b$ Same as the truth-value of $d$
Kathleen
asked
in
Mathematical Logic
Sep 14, 2014
by
Kathleen
12.0k
views
gatecse-2000
mathematical-logic
normal
propositional-logic
30
votes
7
answers
105
GATE CSE 2008 | Question: 31
$P$ and $Q$ are two propositions. Which of the following logical expressions are equivalent? $P ∨ \neg Q$ $\neg(\neg P ∧ Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ \neg Q)$ $(P ∧ Q) ∨ (P ∧ \neg Q) ∨ (\neg P ∧ Q)$ Only I and II Only I, II and III Only I, II and IV All of I, II, III and IV
Kathleen
asked
in
Mathematical Logic
Sep 12, 2014
by
Kathleen
8.4k
views
gatecse-2008
normal
mathematical-logic
propositional-logic
39
votes
7
answers
106
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Kathleen
asked
in
Graph Theory
Sep 11, 2014
by
Kathleen
55.0k
views
gatecse-2008
graph-theory
normal
graph-planarity
49
votes
6
answers
107
GO Classes Weekly Quiz 5 | Propositional Logic | Question: 16
If $\text{F1, F2}$ and $\text{F3}$ are propositional formulae/expressions, over some set of propositional variables, such that $\mathrm{F} 1 \vee F 2 \rightarrow \mathrm{F} 3$ is a contradiction, then which of the following is/are ... is a tautology. $\text{F3}$ is a contradiction. $\text{F1} \mathrm{v} \text{F2}$ is a tautology.
GO Classes
asked
in
Mathematical Logic
Mar 26, 2023
by
GO Classes
1.5k
views
goclasses2024_wq5
goclasses
mathematical-logic
propositional-logic
multiple-selects
2-marks
26
votes
6
answers
108
GATE CSE 2022 | Question: 26
Which one of the following is the closed form for the generating function of the sequence $\{ a_{n} \}_{n \geq 0}$ defined below? $ a_{n} = \left\{\begin{matrix} n + 1, & \text{n is odd} & \\ 1, & \text{otherwise} & \end{matrix}\right.$ ... $\frac{2x}{(1-x^{2})^{2}} + \frac{1}{1-x}$ $\frac{x}{(1-x^{2})^{2}} + \frac{1}{1-x}$
Arjun
asked
in
Combinatory
Feb 15, 2022
by
Arjun
9.3k
views
gatecse-2022
combinatory
generating-functions
2-marks
15
votes
6
answers
109
GATE CSE 2022 | Question: 41
Consider the following recurrence: $\begin{array}{} f(1) & = & 1; \\ f(2n) & = & 2f(n) - 1, & \; \text{for}\; n \geq 1; \\ f(2n+1) & = & 2f(n) + 1, & \; \text{for}\; n \geq 1. \end{array}$ Then, which of the following statements is/are $\text{TRUE}?$ ... $f(2^{n}) = 1$ $f(5 \cdot 2^{n}) = 2^{n+1} + 1$ $f(2^{n} + 1) = 2^{n} + 1$
Arjun
asked
in
Combinatory
Feb 15, 2022
by
Arjun
7.7k
views
gatecse-2022
combinatory
recurrence-relation
multiple-selects
2-marks
25
votes
6
answers
110
GATE CSE 2021 Set 2 | Question: 50
Let $S$ be a set of consisting of $10$ elements. The number of tuples of the form $(A,B)$ such that $A$ and $B$ are subsets of $S$, and $A \subseteq B$ is ___________
Arjun
asked
in
Combinatory
Feb 18, 2021
by
Arjun
11.8k
views
gatecse-2021-set2
combinatory
counting
numerical-answers
2-marks
35
votes
6
answers
111
GATE CSE 2021 Set 1 | Question: 36
Let $G=(V, E)$ be an undirected unweighted connected graph. The diameter of $G$ is defined as: $\text{diam}(G)=\displaystyle \max_{u,v\in V} \{\text{the length of shortest path between $u$ and $v$}\}$ Let $M$ be the adjacency matrix of $G$. Define graph $G_2$ ... $\text{diam}(G_2) = \text{diam}(G)$ $\text{diam}(G)< \text{diam}(G_2)\leq 2\; \text{diam}(G)$
Arjun
asked
in
Graph Theory
Feb 18, 2021
by
Arjun
9.8k
views
gatecse-2021-set1
graph-theory
graph-connectivity
2-marks
2
votes
6
answers
112
UGC NET CSE | January 2017 | Part 3 | Question: 60
The first order logic (FOL) statement $((R\vee Q)\wedge(P\vee \neg Q))$ is equivalent to which of the following? $((R\vee \neg Q)\wedge(P\vee \neg Q)\wedge (R\vee P))$ $((R\vee Q)\wedge(P\vee \neg Q)\wedge (R\vee P))$ $((R\vee Q)\wedge(P\vee \neg Q)\wedge(R\vee \neg P))$ $((R\vee Q)\wedge(P\vee \neg Q)\wedge (\neg R\vee P))$
go_editor
asked
in
Mathematical Logic
Mar 24, 2020
by
go_editor
2.8k
views
ugcnetcse-jan2017-paper3
mathematical-logic
first-order-logic
3
votes
6
answers
113
UGC NET CSE | January 2017 | Part 2 | Question: 6
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that $\begin{array}{c} (P \to Q) \wedge (R \to S) \\ P \vee R \\ \hline Y \\ \hline \end{array}$ $Y$ is the premise : $P \vee R$ $P \vee S$ $Q \vee R$ $Q \vee S$
go_editor
asked
in
Mathematical Logic
Mar 24, 2020
by
go_editor
2.9k
views
ugcnetjan2017ii
discrete-mathematics
propositional-logic
28
votes
6
answers
114
GATE CSE 2020 | Question: 52
Graph $G$ is obtained by adding vertex $s$ to $K_{3,4}$ and making $s$ adjacent to every vertex of $K_{3,4}$. The minimum number of colours required to edge-colour $G$ is _______
Arjun
asked
in
Graph Theory
Feb 12, 2020
by
Arjun
13.5k
views
gatecse-2020
numerical-answers
graph-theory
graph-coloring
2-marks
40
votes
6
answers
115
GATE CSE 2019 | Question: 38
Let $G$ be any connected, weighted, undirected graph. $G$ has a unique minimum spanning tree, if no two edges of $G$ have the same weight. $G$ has a unique minimum spanning tree, if, for every cut of $G$, there is a unique minimum-weight edge crossing the cut. Which of the following statements is/are TRUE? I only II only Both I and II Neither I nor II
Arjun
asked
in
Graph Theory
Feb 7, 2019
by
Arjun
20.4k
views
gatecse-2019
engineering-mathematics
discrete-mathematics
graph-theory
graph-connectivity
2-marks
8
votes
6
answers
116
TIFR CSE 2019 | Part A | Question: 1
Let $X$ be a set with $n$ elements. How many subsets of $X$ have odd cardinality? $n$ $2^n$ $2^{n/2}$ $2^{n-1}$ Can not be determined without knowing whether $n$ is odd or even
Arjun
asked
in
Set Theory & Algebra
Dec 18, 2018
by
Arjun
3.4k
views
tifr2019
engineering-mathematics
discrete-mathematics
set-theory&algebra
set-theory
52
votes
6
answers
117
GATE CSE 2018 | Question: 27
Let $N$ be the set of natural numbers. Consider the following sets, $P:$ Set of Rational numbers (positive and negative) $Q:$ Set of functions from $\{0,1\}$ to $N$ $R:$ Set of functions from $N$ to $\{0, 1\}$ $S:$ Set of finite subsets of $N$ Which of the above sets are countable? $Q$ and $S$ only $P$ and $S$ only $P$ and $R$ only $P, Q$ and $S$ only
gatecse
asked
in
Set Theory & Algebra
Feb 14, 2018
by
gatecse
21.8k
views
gatecse-2018
set-theory&algebra
countable-uncountable-set
normal
2-marks
1
vote
6
answers
118
ISRO-DEC2017-6
The proposition $(P\Rightarrow Q)\wedge (Q\Rightarrow P)$ is a Tautology Contradiction Contingency Absurdity
gatecse
asked
in
Mathematical Logic
Dec 17, 2017
by
gatecse
2.4k
views
isrodec2017
30
votes
6
answers
119
TIFR CSE 2018 | Part A | Question: 9
How many ways are there to assign colours from range $\left\{1,2,\ldots,r\right\}$ to vertices of the following graph so that adjacent vertices receive distinct colours? $r^{4}$ $r^{4} - 4r^{3}$ $r^{4}-5r^{3}+8r^{2}-4r$ $r^{4}-4r^{3}+9r^{2}-3r$ $r^{4}-5r^{3}+10r^{2}-15r$
Rohit Gupta 8
asked
in
Graph Theory
Dec 10, 2017
by
Rohit Gupta 8
4.5k
views
tifr2018
graph-theory
graph-coloring
16
votes
6
answers
120
TIFR CSE 2018 | Part A | Question: 6
What is the minimum number of students needed in a class to guarantee that there are at least $6$ students whose birthdays fall in the same month ? $6$ $23$ $61$ $72$ $91$
Arjun
asked
in
Combinatory
Dec 10, 2017
by
Arjun
3.3k
views
tifr2018
pigeonhole-principle
combinatory
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
...
355
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow