GATE CS 2014 Set 3 — Question 51
Which one of the following propositional logic formulas is TRUE when exactly two of \(p\), \(q\) and \(r\) are TRUE?
Subject-wise GATE questions
Discrete Mathematics
12 questions and papers
GATE CS 2016 Set 1 — Question 49
Consider the following expressions:(i) false(ii) \(Q\)(iii) true(iv) \(P \vee Q\)(v) \(\neg Q \vee P\)The number of expressions given above that are logically implied by \(P \wedge (P \Rightarrow Q)\) is ______.
GATE CS 2016 Set 2 — Question 40
The coefficient of \(x^{12}\) in \((x^{3} + x^{4} + x^{5} + x^{6} + \cdots)^{3}\) is ______.
GATE CS 2017 Set 1 — Question 48
The number of integers between 1 and 500 (both inclusive) that are divisible by 3 or 5 or 7 is ______.
GATE CS 2009 — Question 12
What is the chromatic number of an \(n\)-vertex simple connected graph which does not contain any odd-length cycle? Assume \(n \geq 2\).
GATE CS 2015 Set 2 — Question 17
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is TRUE?
GATE CS 2014 Set 1 — Question 20
The maximum number of edges in a bipartite graph on 12 vertices is ______.
GATE CS 2014 Set 3 — Question 13
If \(G\) is a forest with \(n\) vertices and \(k\) connected components, how many edges does \(G\) have?
GATE CS 2015 Set 2 — Question 25
Let \(R\) be the relation on the set of positive integers such that \(aRb\) if and only if \(a\) and \(b\) are distinct and have a common divisor…
GATE CS 2005 — Question 42
Let \(R\) and \(S\) be any two equivalence relations on a non-empty set \(A\). Which one of the following statements is TRUE?
Answers and explanations unlock on sign-in
Every question here is free to read. A free account adds the verified key, the worked solution and your progress.