Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Previous GATE Questions
44
votes
10
answers
3211
GATE CSE 2012 | Question: 10
The protocol data unit (PDU) for the application layer in the Internet stack is: Segment Datagram Message Frame
The protocol data unit (PDU) for the application layer in the Internet stack is:SegmentDatagramMessageFrame
gatecse
27.9k
views
gatecse
asked
Aug 5, 2014
Computer Networks
gatecse-2012
computer-networks
application-layer-protocols
easy
+
–
60
votes
4
answers
3212
GATE CSE 2012 | Question: 9
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are One, at $\dfrac{\pi}{2}$ One, at $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{2}$ and $\dfrac{3\pi}{2}$ Two, at $\dfrac{\pi}{4}$ and $\dfrac{3\pi}{2}$
Consider the function $f(x) = \sin(x)$ in the interval $x =\left[\frac{\pi}{4},\frac{7\pi}{4}\right]$. The number and location(s) of the local minima of this function are...
gatecse
13.8k
views
gatecse
asked
Aug 5, 2014
Calculus
gatecse-2012
calculus
maxima-minima
normal
+
–
34
votes
4
answers
3213
GATE CSE 2012 | Question: 8
A process executes the code fork(); fork(); fork(); The total number of child processes created is $3$ $4$ $7$ $8$
A process executes the codefork(); fork(); fork();The total number of child processes created is$3$$4$$7$$8$
gatecse
12.8k
views
gatecse
asked
Aug 5, 2014
Operating System
gatecse-2012
operating-system
easy
fork-system-call
+
–
39
votes
2
answers
3214
GATE CSE 2012 | Question: 7
The decimal value $0.5$ in IEEE single precision floating point representation has fraction bits of $000\dots 000$ and exponent value of $0$ fraction bits of $000\dots 000$ and exponent value of $−1$ fraction bits of $100\dots 000$ and exponent value of $0$ no exact representation
The decimal value $0.5$ in IEEE single precision floating point representation hasfraction bits of $000\dots 000$ and exponent value of $0$fraction bits of $000\dots 000$...
gatecse
11.3k
views
gatecse
asked
Aug 5, 2014
Digital Logic
gatecse-2012
digital-logic
normal
number-representation
ieee-representation
+
–
34
votes
3
answers
3215
GATE CSE 2012 | Question: 6
The truth table ${\begin{array}{|c|c|c|}\hline \textbf{X}& \textbf{Y}& \textbf{(X,Y)} \\\hline 0& 0& 0 \\ \hline 0& 1&0\\ \hline 1& 0& 1 \\\hline 1& 1& 1 \\\hline \end{array}}$ represents the Boolean function $X$ $X + Y$ $X \oplus Y$ $Y$
The truth table ${\begin{array}{|c|c|c|}\hline\textbf{X}& \textbf{Y}& \textbf{(X,Y)} \\\hline0& 0& 0 \\ \hline 0& 1&0\\ \hline1& 0& 1 \\\hline1&...
gatecse
4.3k
views
gatecse
asked
Aug 5, 2014
Digital Logic
gatecse-2012
digital-logic
easy
boolean-algebra
+
–
50
votes
2
answers
3216
GATE CSE 2012 | Question: 5
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is $\Theta(n\log n)$ $\Theta(n2^n)$ $\Theta(n)$ $\Theta(\log n)$
The worst case running time to search for an element in a balanced binary search tree with $n2^{n}$ elements is$\Theta(n\log n)$$\Theta(n2^n)$$\Theta(n)$$\Theta(\log n)$
gatecse
13.3k
views
gatecse
asked
Aug 5, 2014
DS
gatecse-2012
data-structures
normal
binary-search-tree
+
–
23
votes
4
answers
3217
GATE CSE 2012 | Question: 4
Assuming $P \neq NP$, which of the following is TRUE? $NP- \ complete = NP$ $NP-complete \cap P = \phi$ $NP-hard = NP$ $P = NP-complete$
Assuming $P \neq NP$, which of the following is TRUE?$NP- \ complete = NP$$NP-complete \cap P = \phi$$NP-hard = NP$$P = NP-complete$
gatecse
8.9k
views
gatecse
asked
Aug 5, 2014
Theory of Computation
gatecse-2012
theory-of-computation
p-np-npc-nph
+
–
40
votes
5
answers
3218
GATE CSE 2012 | Question: 3
What will be the output of the following C program segment? char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choice B"); case ... : printf ("No Choice"); } No Choice Choice A Choice A Choice B No Choice Program gives no output as it is erroneous
What will be the output of the following C program segment?char inChar = 'A'; switch ( inChar ) { case 'A' : printf ("Choice A \ n"); case 'B' : case 'C' : printf ("Choic...
gatecse
10.8k
views
gatecse
asked
Aug 5, 2014
Programming in C
gatecse-2012
programming
easy
programming-in-c
switch-case
+
–
45
votes
5
answers
3219
GATE CSE 2012 | Question: 2
Which of the following is TRUE? Every relation in $\text{3NF}$ is also in $\text{BCNF}$ A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ is fully functionally dependent on every key of $R$ Every relation in $\text{BCNF}$ is also in $\text{3NF}$ No relation can be in both $\text{BCNF}$ and $\text{3NF}$
Which of the following is TRUE?Every relation in $\text{3NF}$ is also in $\text{BCNF}$A relation $\text{R}$ is in $\text{3NF}$ if every non-prime attribute of $\text{R}$ ...
gatecse
19.6k
views
gatecse
asked
Aug 5, 2014
Databases
gatecse-2012
databases
easy
database-normalization
+
–
33
votes
5
answers
3220
GATE CSE 2012 | Question: 1
Consider the following logical inferences. $I_{1}$: If it rains then the cricket match will not be played. The cricket match was played. Inference: There was no rain. $I_{2}$: If it rains then the cricket match will not be played. It did not rain. Inference: ... $I_{2}$ is a correct inference Both $I_{1}$ and $I_{2}$ are not correct inferences
Consider the following logical inferences.$I_{1}$: If it rains then the cricket match will not be played.The cricket match was played.Inference: There was no rain.$I_{2}...
gatecse
9.0k
views
gatecse
asked
Aug 5, 2014
Mathematical Logic
gatecse-2012
mathematical-logic
easy
logical-reasoning
+
–
Page:
« prev
1
...
150
151
152
153
154
155
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register