Register

Recent questions tagged gatecse-2007

76 votes
5 answers
64
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
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...
User Avatar
43 votes
8 answers
65
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$ ... $\forall x \, \Bigl ( \text{ Graph}(x) \implies \lnot \text{ Connected}(x) \Bigr )$
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 follo...
User Avatar
60 votes
5 answers
66
GATE CSE 2007 | Question: 21
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
How many different non-isomorphic Abelian groups of order $4$ are there?$2$$3$$4$$5$
User Avatar
30 votes
5 answers
67
GATE CSE 2007 | Question: 20
Which one of the following uses UDP as the transport protocol? HTTP Telnet DNS SMTP
Which one of the following uses UDP as the transport protocol?HTTPTelnetDNSSMTP
User Avatar
16 votes
3 answers
68
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
3 answers
69
GATE CSE 2007 | Question: 18
Which one of the following is a top-down parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
Which one of the following is a top-down parser?Recursive descent parser.Operator precedence parser.An LR(k) parser.An LALR(k) parser.
User Avatar
37 votes
2 answers
71
GATE CSE 2007 | Question: 16
Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. ... $P-3; Q-2; R-1$ $P-1; Q-2; R-3$ $P-2; Q-3; R-1$ $P-1; Q-3; R-2$
Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2.$$\begin{array}{|ll|ll|} \hline \rl...
User Avatar
24 votes
4 answers
72
GATE CSE 2007 | Question: 14
Which of the following sorting algorithms has the lowest worse-case complexity? Merge sort Bubble sort Quick sort Selection sort
Which of the following sorting algorithms has the lowest worse-case complexity?Merge sortBubble sortQuick sortSelection sort
User Avatar
29 votes
3 answers
73
GATE CSE 2007 | Question: 13
The maximum number of binary trees that can be formed with three unlabeled nodes is: $1$ $5$ $4$ $3$
The maximum number of binary trees that can be formed with three unlabeled nodes is:$1$$5$$4$$3$
User Avatar
26 votes
4 answers
74
GATE CSE 2007 | Question: 12
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is: $2^h -1$ $2^{h-1} -1$ $2^{h+1} -1$ $2^{h+1}$
The height of a binary tree is the maximum number of edges in any root to leaf path. The maximum number of nodes in a binary tree of height $h$ is:$2^h -1$$2^{h-1} -1$$2^...
User Avatar
34 votes
5 answers
78
GATE CSE 2007 | Question: 8, ISRO2011-31
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates? $7$ $8$ $9$ $10$
How many $3$-to-$8$ line decoders with an enable input are needed to construct a $6$-to-$64$ line decoder without using any other logic gates?$7$$8$$9$$10$
User Avatar
38 votes
3 answers
79
GATE CSE 2007 | Question: 7
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a non-regular set is regular The union of two non-regular sets is not regular Infinite union of finite sets is regular
Which of the following is TRUE?Every subset of a regular set is regularEvery finite subset of a non-regular set is regularThe union of two non-regular sets is not regular...
User Avatar
25 votes
2 answers
80
GATE CSE 2007 | Question: 6
Which of the following problems is undecidable? Membership problem for CFGs Ambiguity problem for CFGs Finiteness problem for FSAs Equivalence problem for FSAs
Which of the following problems is undecidable?Membership problem for CFGsAmbiguity problem for CFGsFiniteness problem for FSAsEquivalence problem for FSAs
User Avatar
19 votes
3 answers
81
GATE CSE 2007 | Question: 4
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has 9 edges and 5 vertices 9 edges and 6 vertices 10 edges and 5 vertices 10 edges and 6 vertices
Let $G$ be the non-planar graph with the minimum possible number of edges. Then $G$ has9 edges and 5 vertices9 edges and 6 vertices10 edges and 5 vertices10 edges and 6 v...
User Avatar
35 votes
4 answers
82
GATE CSE 2007 | Question: 3
What is the maximum number of different Boolean functions involving $n$ Boolean variables? $n^2$ $2^n$ $2^{2^n}$ $2^{n^2}$
What is the maximum number of different Boolean functions involving $n$ Boolean variables?$n^2$$2^n$$2^{2^n}$$2^{n^2}$
User Avatar
26 votes
3 answers
83
GATE CSE 2007 | Question: 2
Let $S$ be a set of $n$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $S$ are: $n$ and $n$ $n^2$ and $n$ $n^2$ and $0$ $n$ and $1$
Let $S$ be a set of $n$ elements. The number of ordered pairs in the largest and the smallest equivalence relations on $S$ are:$n$ and $n$$n^2$ and $n$$n^2$ and $0$$n$ an...
User Avatar
81 votes
5 answers
85
GATE CSE 2007 | Question: 25
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $I$ is the $4 \times 4$ identity matrix? $-5$ $-7$ $2$ $1$
Let A be a $4 \times 4$ matrix with eigen values -5,-2,1,4. Which of the following is an eigen value of the matrix$\begin{bmatrix} A & I \\ I & A \end{bmatrix}$, where $...
User Avatar
Page: