The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate2007
GATE Computer Science 2007 questions and solutions
+15
votes
1
answer
1
GATE200729
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
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.8k
points)

1.5k
views
gate2007
theoryofcomputation
finiteautomata
normal
+1
vote
0
answers
2
GATE200728
Consider the series $x_{n+1} = \frac{x_n}{2}+\frac{9}{8x_n},x_0 = 0.5$ obtained from the NewtonRaphson method. The series converges to 1.5 $\sqrt{2}$ 1.6 1.4
asked
Sep 22, 2014
in
IS&Software Engineering
by
Kathleen
Veteran
(
59.8k
points)

280
views
gate2007
numericalmethods
newtonraphson
normal
outofsyllabusnow
+17
votes
3
answers
3
GATE200727
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 \}$ ... a linearly independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above
asked
Sep 22, 2014
in
Linear Algebra
by
Kathleen
Veteran
(
59.8k
points)

2.8k
views
gate2007
linearalgebra
normal
vectorspace
+22
votes
2
answers
4
GATE200726
Consider the set $S =\{ a , b , c , d\}.$ Consider the following $4$ partitions $π_1,π_2,π_3,π_4$ on $S : π_1 =\{\overline{abcd}\},\quad π_2 =\{\overline{ab}, \overline{cd}\},$ ... $π_i \prec π_j$ if and only if $π_i$ refines $π_j$. The poset diagram for $(S',\prec)$ is:
asked
Sep 22, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.8k
points)

3.3k
views
gate2007
settheory&algebra
normal
partialorder
descriptive
+20
votes
7
answers
5
GATE200724
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 than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these
asked
Sep 22, 2014
in
Probability
by
Kathleen
Veteran
(
59.8k
points)

3.9k
views
gate2007
probability
easy
+37
votes
5
answers
6
GATE200723
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
asked
Sep 22, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.8k
points)

4.9k
views
gate2007
graphtheory
normal
graphconnectivity
eulergraph
+22
votes
5
answers
7
GATE200722
$\def\graph{\text{ Graph}} \def\connected{\text{ Connected}}$ Let $\graph(x)$ be a predicate which denotes that $x$ is a graph. Let $\connected(x)$ be a predicate which denotes that $x$ is connected. Which of the following first order logic sentences DOES NOT represent the ... $\forall x \, \Bigl ( \graph(x) \implies \lnot \connected(x) \Bigr )$
asked
Sep 22, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
59.8k
points)

2.5k
views
gate2007
mathematicallogic
easy
firstorderlogic
+21
votes
4
answers
8
GATE200721
How many different nonisomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
asked
Sep 22, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.8k
points)

4.9k
views
gate2007
groups
normal
+19
votes
6
answers
9
GATE200720
Which one of the following uses UDP as the transport protocol? HTTP Telnet DNS SMTP
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.8k
points)

1.8k
views
gate2007
computernetworks
networkprotocols
applicationlayerprotocols
easy
+11
votes
3
answers
10
GATE200719
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
asked
Sep 22, 2014
in
Computer Networks
by
Kathleen
Veteran
(
59.8k
points)

3.3k
views
gate2007
computernetworks
ethernet
manchesterencoding
normal
+11
votes
3
answers
11
GATE200718
Which one of the following is a topdown parser? Recursive descent parser. Operator precedence parser. An LR(k) parser. An LALR(k) parser.
asked
Sep 22, 2014
in
Compiler Design
by
Kathleen
Veteran
(
59.8k
points)

1.6k
views
gate2007
compilerdesign
parsing
normal
+22
votes
2
answers
12
GATE200717
Consider the following statements about user level threads and kernel level threads. Which one of the following statements is FALSE? Context switch time is longer for kernel level threads than for user level threads. User level threads do not need any ... can be scheduled on different processors in a multiprocessor system. Blocking one kernel level thread blocks all related threads.
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.8k
points)

3k
views
gate2007
operatingsystem
threads
normal
+19
votes
2
answers
13
GATE200716
Group 1 contains some CPU scheduling algorithms and Group 2 contains some applications. Match entries in Group 1 to entries in Group 2. Group I Group II (P) Gang Scheduling (1) Guaranteed Scheduling (Q) Rate Monotonic Scheduling (2) Realtime Scheduling (R) Fair Share Scheduling (3) Thread Scheduling ... P3; Q2; R1 P1; Q2; R3 P2; Q3; R1 P1; Q3; R2
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.8k
points)

2.4k
views
gate2007
operatingsystem
processschedule
normal
+12
votes
3
answers
14
GATE200714
Which of the following sorting algorithms has the lowest worsecase complexity? Merge sort Bubble sort Quick sort Selection sort
asked
Sep 22, 2014
in
Algorithms
by
Kathleen
Veteran
(
59.8k
points)

1.6k
views
gate2007
algorithms
sorting
timecomplexity
easy
+20
votes
2
answers
15
GATE200713
The maximum number of binary trees that can be formed with three unlabeled nodes is: $1$ $5$ $4$ $3$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
59.8k
points)

4.5k
views
gate2007
datastructure
binarytree
normal
+13
votes
3
answers
16
GATE200712
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^{h1} 1$ $2^{h+1} 1$ $2^{h+1}$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
59.8k
points)

4.3k
views
gate2007
datastructure
binarytree
easy
+14
votes
3
answers
17
GATE200711, ISRO200936, ISRO201621
Consider a disk pack with $16$ surfaces, $128$ tracks per surface and $256$ sectors per track. $512$ bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in ... : $256$ Mbyte, $19$ bits $256$ Mbyte, $28$ bits $512$ Mbyte, $20$ bits $64$ Gbyte, $28$ bits
asked
Sep 22, 2014
in
Operating System
by
Kathleen
Veteran
(
59.8k
points)

5.3k
views
gate2007
operatingsystem
disks
normal
isro2016
+12
votes
1
answer
18
GATE200710
Consider a $4$way set associative cache consisting of $128$ lines with a line size of $64$ words. The CPU generates a $20bit$ address of a word in main memory. The number of bits in the TAG, LINE and WORD fields are respectively: $9, 6, 5$ $7, 7, 6$ $7, 5, 8$ $9, 5, 6$
asked
Sep 22, 2014
in
CO & Architecture
by
Kathleen
Veteran
(
59.8k
points)

2.8k
views
gate2007
coandarchitecture
cachememory
normal
+12
votes
1
answer
19
GATE20079
Consider the following Boolean function of four variables: $f(w, x, y, z) = \Sigma(1, 3, 4, 6, 9, 11, 12, 14)$ The function is independent of one variables. independent of two variables. independent of three variables. dependent on all variables
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.8k
points)

904
views
gate2007
digitallogic
normal
minsumofproductsform
+16
votes
4
answers
20
GATE20078, ISRO201131
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$
asked
Sep 22, 2014
in
Digital Logic
by
Kathleen
Veteran
(
59.8k
points)

6.6k
views
gate2007
digitallogic
normal
isro2011
decoder
+20
votes
1
answer
21
GATE20077
Which of the following is TRUE? Every subset of a regular set is regular Every finite subset of a nonregular set is regular The union of two nonregular sets is not regular Infinite union of finite sets is regular
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.8k
points)

3k
views
gate2007
theoryofcomputation
easy
regularlanguages
+13
votes
2
answers
22
GATE20076
Which of the following problems is undecidable? Membership problem for CFGs Ambiguity problem for CFGs Finiteness problem for FSAs Equivalence problem for FSAs
asked
Sep 22, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
59.8k
points)

1.4k
views
gate2007
theoryofcomputation
decidability
normal
+15
votes
3
answers
23
GATE20074
Let $G$ be the nonplanar 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
asked
Sep 22, 2014
in
Graph Theory
by
Kathleen
Veteran
(
59.8k
points)

2.6k
views
gate2007
graphtheory
normal
outofsyllabusnow
+19
votes
4
answers
24
GATE20073
What is the maximum number of different Boolean functions involving $n$ Boolean variables? $n^2$ $2^n$ $2^{2^n}$ $2^{n^2}$
asked
Sep 22, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.8k
points)

1.9k
views
gate2007
permutationsandcombinations
functions
normal
+17
votes
2
answers
25
GATE20072
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$
asked
Sep 22, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
59.8k
points)

2.3k
views
gate2007
settheory&algebra
normal
relations
+7
votes
2
answers
26
GATE20071
Consider the following two statements about the function $f(x)=\left\vert x\right\vert$: P. $f(x)$ is continuous for all real values of $x$. Q. $f(x)$ is differentiable for all real values of $x$ . Which of the following is TRUE? $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are true. Both $P$ and $Q$ are false.
asked
Sep 22, 2014
in
Calculus
by
Kathleen
Veteran
(
59.8k
points)

1.3k
views
gate2007
calculus
continuity
differentiability
easy
+37
votes
2
answers
27
GATE200725
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$
asked
Sep 2, 2014
in
Linear Algebra
by
priya
(
53
points)

2.8k
views
gate2007
eigenvalue
linearalgebra
difficult
Page:
« prev
1
2
3
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIT Kanpur MS Interview experience
My GATE preparation and what you can learn from it
IIT Bombay RA (2019) Programming Questions
COAP Round 1 has started
MTECH (COUURSE WORK) AI INTERVIEW EXPERIENCE 2019
Follow @csegate
Recent questions tagged gate2007
Recent Blog Comments
Thank you Sir (and now added).
Congrats 👍 You should add where you got...
You want to test yourself or the test...
HI congratulations, I have some question, Why...
This time questions were too easy. Many students...
49,397
questions
53,564
answers
185,727
comments
70,837
users