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
Recent questions
#58781
7.9k
views
3
answers
17
votes
GATE CSE 2007 | Question: 39, UGCNET-June2015-II: 22
The inorder and preorder traversal of a binary tree are$\text{d b e a f c g}$ and $\text{a b d e c f g}$ ... $\text{d e f g b c a}$
Kathleen
7.9k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
binary-tree
normal
ugcnetcse-june2015-paper2
+
–
#58782
17.0k
views
4
answers
33
votes
GATE CSE 2007 | Question: 38, ISRO2016-27
The following postfix expression with single digit operands is evaluated using a stack:$8 \ 2 \ 3 \ {}^\hat{} ∕ \ 2 \ 3 * + 5 \ 1 * -$Note that $^\hat{}$ is ... $ is evaluated are$6, 1$5, 7$3, 2$1, 5$
Kathleen
17.0k
views
Kathleen
asked
Sep 21, 2014
DS
gatecse-2007
data-structures
stack
normal
infix-prefix
isro2016
+
–
#58783
16.5k
views
4
answers
33
votes
GATE CSE 2007 | Question: 37, ISRO2009-37
Consider a pipelined processor with the following four stages:IF: Instruction FetchID: Instruction Decode and Operand FetchEX: ExecuteWB: Write BackThe IF, ID and WB stages take one clock ... $-$R4} \\ \end{array}$$7$8$10$14$
Kathleen
16.5k
views
Kathleen
asked
Sep 21, 2014
CO and Architecture
gatecse-2007
co-and-architecture
pipelining
normal
isro2009
+
–
#58784
20.1k
views
6
answers
66
votes
GATE CSE 2007 | Question: 36
The control signal functions of a $4$-$bit$ binary counter are given below (where $X$ ... 3, 4$0, 3, 4, 5$0, 1, 2, 3, 4$0, 1, 2, 3, 4, 5$
Kathleen
20.1k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
circuit-output
normal
+
–
#58785
13.4k
views
3
answers
58
votes
GATE CSE 2007 | Question: 35
In a look-ahead carry generator, the carry generate function $G_i$ and the carry propagate function $P_i$ for inputs $A_i$ and $B_i$ ... $ as its outputs are respectively:$6, 3$10, 4$6, 4$10, 5$
Kathleen
13.4k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
carry-generator
adder
+
–
#58786
32.2k
views
9
answers
70
votes
GATE CSE 2007 | Question: 34
Suppose only one multiplexer and one inverter are allowed to be used to implement any Boolean function of $n$ variables. What is the minimum size of the multiplexer needed?$2^n$ line to ... $1$line$2^{n-2}$ line to $1$line
Kathleen
32.2k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
multiplexer
+
–
#58787
9.3k
views
5
answers
43
votes
GATE CSE 2007 | Question: 33
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$ ... and $R$ are valid.Only $P$ and $R$ are valid.All $P$, $Q$, $R$ are valid.
Kathleen
9.3k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
#58788
11.1k
views
6
answers
44
votes
GATE CSE 2007 | Question: 32
Let $f(w, x, y, z) = \sum {\left(0,4,5,7,8,9,13,15\right)}$. Which of the following expressions are NOT equivalent to $f$?P: $x'y'z' + w'xy' + wy'z + xz$ ... $x'y'z' + wx'y'+ w'y$P onlyQ and SR and SS only
Kathleen
11.1k
views
Kathleen
asked
Sep 21, 2014
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
#58789
14.4k
views
2
answers
39
votes
GATE CSE 2007 | Question: 31
Which of the following languages is regular?$\left\{ww^R \mid w \in \{0, 1\}^+\right\}$\left\{ww^Rx \mid x,w \in \{0, 1\}^+\right\}$\left\{wxw^R \mid x, w \in \{0, 1\}^+\right\}$\left\{xww^R \mid x, w \in \{0, 1\}^+\right\}$
Kathleen
14.4k
views
Kathleen
asked
Sep 21, 2014
Theory of Computation
gatecse-2007
theory-of-computation
normal
regular-language
+
–
#58790
8.6k
views
4
answers
26
votes
GATE CSE 2007 | Question: 30
The language $L=\left\{0^i21^i \mid i \geq 0\right\}$ over the alphabet $\left\{0, 1, 2\right\}$ is:not recursiveis recursive and is a deterministic CFLis a regular languageis not a deterministic CFL but a CFL
Kathleen
8.6k
views
Kathleen
asked
Sep 21, 2014
Theory of Computation
gatecse-2007
theory-of-computation
normal
identify-class-language
+
–
#58791
12.0k
views
4
answers
32
votes
GATE CSE 2007 | Question: 29
A minimum state deterministic finite automaton accepting the language$L=\{w\mid w \in \{0, 1\}^*,$ number of $0$s and $1$s in $w$ are divisible by $3$ and $5$, respectively $\}$ has$15$ states$11$ states$10$ states$9$ states
Kathleen
12.0k
views
Kathleen
asked
Sep 21, 2014
Theory of Computation
gatecse-2007
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
#58792
1.1k
views
0
answers
1
votes
GATE CSE 2007 | Question: 28
Consider the series $x_{n+1} = \frac{x_n}{2}+\frac{9}{8x_n},x_0 = 0.5$ obtained from the Newton-Raphson method. The series converges to1.5$\sqrt{2}$1.61.4
Kathleen
1.1k
views
Kathleen
asked
Sep 21, 2014
IS&Software Engineering
gatecse-2007
numerical-methods
newton-raphson
normal
out-of-syllabus-now
+
–
#58793
17.1k
views
4
answers
34
votes
GATE CSE 2007 | Question: 27
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$. ... therefore is not a basis of $X$.$X$ is not a subspace of $R^3$.None of the above
Kathleen
17.1k
views
Kathleen
asked
Sep 21, 2014
Linear Algebra
gatecse-2007
linear-algebra
normal
vector-space
+
–
#58794
13.8k
views
3
answers
41
votes
GATE CSE 2007 | Question: 26
Consider the set $S =\{ a , b , c , d\}.$ Consider the following $4$ partitions $π_1,π_2,π_3,π_4$ ... $π_i$ refines $π_j$. The poset diagram for $(S',\prec)$ is:
Kathleen
13.8k
views
Kathleen
asked
Sep 21, 2014
Set Theory & Algebra
gatecse-2007
set-theory&algebra
normal
partial-order
descriptive
+
–
#58795
15.7k
views
12
answers
44
votes
GATE CSE 2007 | Question: 24
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position ... (\dfrac{1}{10}\right)$\left(\dfrac{9!}{20!}\right)$None of these
Kathleen
15.7k
views
Kathleen
asked
Sep 21, 2014
Probability
gatecse-2007
probability
easy
uniform-distribution
+
–
#58796
26.0k
views
5
answers
78
votes
GATE CSE 2007 | Question: 23
Which of the following graphs has an Eulerian circuit?Any $k$-regular graph where $k$ is an even number.A complete graph on $90$ vertices.The complement of a cycle on $25$ vertices.None of the above
Kathleen
26.0k
views
Kathleen
asked
Sep 21, 2014
Graph Theory
gatecse-2007
graph-theory
normal
graph-connectivity
+
–
#58797
9.2k
views
8
answers
45
votes
GATE CSE 2007 | Question: 22
Let $\text{ Graph}(x)$ be a predicate which denotes that $x$ is a graph. Let $\text{ Connected}(x)$ be a predicate which denotes that $x$ is connected. Which of the ...
Kathleen
9.2k
views
Kathleen
asked
Sep 21, 2014
Mathematical Logic
gatecse-2007
mathematical-logic
easy
first-order-logic
+
–
#58798
20.1k
views
5
answers
61
votes
GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there?$2$3$4$5$
Kathleen
20.1k
views
Kathleen
asked
Sep 21, 2014
Set Theory & Algebra
gatecse-2007
group-theory
normal
+
–
#58799
12.6k
views
5
answers
30
votes
GATE CSE 2007 | Question: 20
Which one of the following uses UDP as the transport protocol?HTTPTelnetDNSSMTP
Kathleen
12.6k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
network-protocols
application-layer-protocols
easy
+
–
#58800
12.0k
views
3
answers
16
votes
GATE CSE 2007 | Question: 19
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
Kathleen
12.0k
views
Kathleen
asked
Sep 21, 2014
Computer Networks
gatecse-2007
computer-networks
ethernet
manchester-encoding
normal
out-of-gate-syllabus
+
–
Page:
« prev
1
...
2935
2936
2937
2938
2939
2940
2941
2942
2943
2944
2945
...
3251
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register