GATE CS 2014 Set 3 — Question 48
Four fair six-sided dice are rolled. The probability that the sum of the results being 22 is \(\dfrac{X}{1296}\). The value of \(X\) is ______.
GATE exam stream
GATE CS — Computer Science & IT
174 questions and papers
GATE CS 2014 Set 3 — Question 15
The function \(f(x) = x\sin x\) satisfies the following equation: \(f''(x) + f(x) + t\cos x = 0\). The value of \(t\) is ______.
GATE CS 2014 Set 1 — Question 5
Each of the nine words in the sentence “The quick brown fox jumps over the lazy dog” is written on a separate piece of paper. These nine pieces…
GATE CS 2010 — Question 22
What is the value of \(\displaystyle\lim_{n \to \infty}\left(1 - \frac{1}{n}\right)^{2n}\) ?
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?
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?
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.