Register

Recent questions tagged out-of-gate-syllabus

19 votes
4 answers
94
GATE CSE 2014 Set 1 | Question: 24
Which of the following are used to generate a message digest by the network security protocols? RSA SHA-$1$ DES MD5 I and III only II and III only II and IV only III and IV only
Which of the following are used to generate a message digest by the network security protocols?RSASHA-$1$DESMD5I and III onlyII and III onlyII and IV onlyIII and IV only
User Avatar
16 votes
3 answers
99
GATE CSE 2007 | Question: 19
In Ethernet when Manchester encoding is used, the bit rate is: Half the baud rate Twice the baud rate Same as the baud rate None of the above
In Ethernet when Manchester encoding is used, the bit rate is:Half the baud rateTwice the baud rateSame as the baud rateNone of the above
User Avatar
15 votes
7 answers
100
GATE CSE 2004 | Question: 30, ISRO2017-10
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$ both $\text{NP}$ complete $\text{NP}$-complete and in $\text{P}$ respectively undecidable and $\text{NP}$ complete respectively
The problem $\text{3-SAT}$ and $\text{2-SAT}$ are both in $\text{P}$both $\text{NP}$ complete$\text{NP}$-complete and in $\text{P}$ respectivelyundecidable and $\text{NP}...
User Avatar
0 votes
0 answers
106
GATE CSE 1993 | Question: 02.8
Given $\vec v= x\cos ^2y \hat i + x^2e^z\hat j+ z\sin^2y\hat k$ and $S$ the surface of a unit cube with one corner at the origin and edges parallel to the coordinate axes, the value of integral $\int^1 \int_s \vec V. \hat n dS$ is __________.
Given $\vec v= x\cos ^2y \hat i + x^2e^z\hat j+ z\sin^2y\hat k$ and $S$ the surface of a unit cube with one corner at the origin and edges parallel to the coordinate axes...
User Avatar
4 votes
2 answers
107
GATE CSE 1993 | Question: 02.6
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
The value of the double integral $\int^{1}_{0} \int_{0}^{\frac{1}{x}} \frac {x}{1+y^2} dxdy$ is_________.
User Avatar
1 votes
1 answer
109
GATE CSE 1993 | Question: 02.3
If the linear velocity $\vec V$ is given by $\vec V = x^2y\,\hat i + xyz\,\hat j – yz^2\,\hat k$ The angular velocity $\vec \omega$ at the point $(1, 1, -1)$ is ________
If the linear velocity $\vec V$ is given by $$\vec V = x^2y\,\hat i + xyz\,\hat j – yz^2\,\hat k$$The angular velocity $\vec \omega$ at the point $(1, 1, -1)$ is ______...
User Avatar
1 votes
0 answers
110
GATE CSE 1993 | Question: 02.2
The radius of convergence of the power series$\sum_{}^{\infty} \frac{(3m)!}{(m!)^3}x^{3m}$ is: _____________
The radius of convergence of the power series$$\sum_{}^{\infty} \frac{(3m)!}{(m!)^3}x^{3m}$$ is: _____________
User Avatar
1 votes
1 answer
111
GATE CSE 1993 | Question: 01.7
The function $f\left(x,y\right) = x^2y - 3xy + 2y +x$ has no local extremum one local minimum but no local maximum one local maximum but no local minimum one local minimum and one local maximum
The function $f\left(x,y\right) = x^2y - 3xy + 2y +x$ hasno local extremumone local minimum but no local maximumone local maximum but no local minimumone local minimum an...
User Avatar
1 votes
1 answer
113
GATE CSE 1993 | Question: 01.3
Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree $1$ $2$ $3$ $4$
Simpson's rule for integration gives exact result when $f(x)$ is a polynomial of degree$1$$2$$3$$4$
User Avatar
9 votes
2 answers
117
GATE CSE 1992 | Question: 03,v
Start and stop bits do not contain any "information" but are used in serial communication for Error detection Error correction Synchronization Slowing down the communications.
Start and stop bits do not contain any "information" but are used in serial communication forError detectionError correctionSynchronizationSlowing down the communications...
User Avatar
9 votes
3 answers
119
GATE CSE 1992 | Question: 02,vi
Which of the following problems is not $\text{NP}$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
Which of the following problems is not $\text{NP}$-hard?Hamiltonian circuit problemThe $0/1$ Knapsack problemFinding bi-connected components of a graphThe graph coloring ...
User Avatar
Page: