Register

Recent questions tagged gatecse-2016-set2

36 votes
5 answers
34
GATE CSE 2016 Set 2 | Question: 02
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(-x))$ is $10$, then the degree of $(g(x) - g(-x))$ is __________.
User Avatar
21 votes
4 answers
35
GATE CSE 2016 Set 2 | Question: 14
The Floyd-Warshall algorithm for all-pair shortest paths computation is based on Greedy paradigm. Divide-and-conquer paradigm. Dynamic Programming paradigm. Neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
The Floyd-Warshall algorithm for all-pair shortest paths computation is based onGreedy paradigm.Divide-and-conquer paradigm.Dynamic Programming paradigm.Neither Greedy no...
User Avatar
102 votes
11 answers
37
GATE CSE 2016 Set 2 | Question: 01
Consider the following expressions: $false$ $Q$ $true$ $P\vee Q$ $\neg Q\vee P$ The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$ is ___________.
Consider the following expressions:$false$$Q$$true$$P\vee Q$$\neg Q\vee P$The number of expressions given above that are logically implied by $P \wedge (P \Rightarrow Q)$...
User Avatar
29 votes
7 answers
38
GATE CSE 2016 Set 2 | Question: 12
The value printed by the following program is _______. void f (int * p, int m) { m = m + 5; *p = *p + m; return; } void main () { int i=5, j=10; f (&i, j); printf ("%d", i+j); }
The value printed by the following program is _______.void f (int * p, int m) { m = m + 5; *p = *p + m; return; } void main () { int i=5, j=10; f (&i, j); p...
User Avatar
27 votes
5 answers
44
GATE CSE 2016 Set 2 | Question: 23
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires. Anarkali's public key. Salim's public key. Salim's private key. Anarkali's private key.
Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires.Anarkali's public key.Salim's public key.Salim's private key.Ana...
User Avatar
43 votes
4 answers
45
GATE CSE 2016 Set 2 | Question: 03
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
User Avatar
39 votes
2 answers
47
GATE CSE 2016 Set 2 | Question: 06
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{-1}\right)^{T}$ is _________.
Suppose that the eigenvalues of matrix $A$ are $1, 2, 4$. The determinant of $\left(A^{-1}\right)^{T}$ is _________.
User Avatar
22 votes
1 answer
48
GATE CSE 2016 Set 2 | Question: 19
Match the following: ... $ iv}$ $\text{P $\leftrightarrow$ iv, Q $\leftrightarrow$ i, R $\leftrightarrow$ ii, S $\leftrightarrow$ iii}$
Match the following:$$\begin{array}{ll|ll}\hline \text{(P)} & \text{Lexical analysis} & \text{(i)} & \text{Leftmost derivation} \\\hline \text{(Q)} & \text{Top down pars...
User Avatar
34 votes
4 answers
50
GATE CSE 2016 Set 2 | Question: 09
Let $X$ be the number of distinct $16$-bit integers in $2's$ complement representation. Let $Y$ be the number of distinct $16$-bit integers in sign magnitude representation Then $X - Y$ is______.
Let $X$ be the number of distinct $16$-bit integers in $2's$ complement representation. Let $Y$ be the number of distinct $16$-bit integers in sign magnitude representati...
User Avatar
Page: