Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gatecse-2007
33
votes
4
answers
61
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 \}$ ... 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
Kathleen
asked
in
Linear Algebra
Sep 21, 2014
by
Kathleen
16.5k
views
gatecse-2007
linear-algebra
normal
vector-space
41
votes
3
answers
62
GATE CSE 2007 | Question: 26
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:
Kathleen
asked
in
Set Theory & Algebra
Sep 21, 2014
by
Kathleen
13.4k
views
gatecse-2007
set-theory&algebra
normal
partial-order
descriptive
43
votes
12
answers
63
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 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
Kathleen
asked
in
Probability
Sep 21, 2014
by
Kathleen
15.1k
views
gatecse-2007
probability
easy
uniform-distribution
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
Kathleen
asked
in
Graph Theory
Sep 21, 2014
by
Kathleen
25.2k
views
gatecse-2007
graph-theory
normal
graph-connectivity
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 )$
Kathleen
asked
in
Mathematical Logic
Sep 21, 2014
by
Kathleen
8.9k
views
gatecse-2007
mathematical-logic
easy
first-order-logic
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$
Kathleen
asked
in
Set Theory & Algebra
Sep 21, 2014
by
Kathleen
19.6k
views
gatecse-2007
group-theory
normal
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
Kathleen
asked
in
Computer Networks
Sep 21, 2014
by
Kathleen
12.2k
views
gatecse-2007
computer-networks
network-protocols
application-layer-protocols
easy
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
Kathleen
asked
in
Computer Networks
Sep 21, 2014
by
Kathleen
11.6k
views
gatecse-2007
computer-networks
ethernet
manchester-encoding
normal
out-of-gate-syllabus
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.
Kathleen
asked
in
Compiler Design
Sep 21, 2014
by
Kathleen
9.6k
views
gatecse-2007
compiler-design
parsing
normal
38
votes
4
answers
70
GATE CSE 2007 | Question: 17
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 ... be scheduled on different processors in a multi-processor system. Blocking one kernel level thread blocks all related threads.
Kathleen
asked
in
Operating System
Sep 21, 2014
by
Kathleen
21.0k
views
gatecse-2007
operating-system
threads
normal
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$
Kathleen
asked
in
Operating System
Sep 21, 2014
by
Kathleen
9.7k
views
gatecse-2007
operating-system
process-scheduling
normal
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
Kathleen
asked
in
Algorithms
Sep 21, 2014
by
Kathleen
10.8k
views
gatecse-2007
algorithms
sorting
time-complexity
easy
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$
Kathleen
asked
in
DS
Sep 21, 2014
by
Kathleen
31.6k
views
gatecse-2007
data-structures
binary-tree
normal
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}$
Kathleen
asked
in
DS
Sep 21, 2014
by
Kathleen
25.7k
views
gatecse-2007
data-structures
binary-tree
easy
25
votes
4
answers
75
GATE CSE 2007 | Question: 11, ISRO2009-36, ISRO2016-21
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 ... $256$ Mbyte, $19$ bits $256$ Mbyte, $28$ bits $512$ Mbyte, $20$ bits $64$ Gbyte, $28$ bits
Kathleen
asked
in
Operating System
Sep 21, 2014
by
Kathleen
20.6k
views
gatecse-2007
operating-system
disk
normal
isro2016
22
votes
1
answer
76
GATE CSE 2007 | Question: 10
Consider a $4$-way set associative cache consisting of $128$ lines with a line size of $64$ words. The CPU generates a $20-bit$ 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$
Kathleen
asked
in
CO and Architecture
Sep 21, 2014
by
Kathleen
13.1k
views
gatecse-2007
co-and-architecture
cache-memory
normal
18
votes
1
answer
77
GATE CSE 2007 | Question: 9
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
Kathleen
asked
in
Digital Logic
Sep 21, 2014
by
Kathleen
3.2k
views
gatecse-2007
digital-logic
normal
min-sum-of-products-form
k-map
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$
Kathleen
asked
in
Digital Logic
Sep 21, 2014
by
Kathleen
21.2k
views
gatecse-2007
digital-logic
normal
isro2011
decoder
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
Kathleen
asked
in
Theory of Computation
Sep 21, 2014
by
Kathleen
15.3k
views
gatecse-2007
theory-of-computation
easy
regular-language
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
Kathleen
asked
in
Theory of Computation
Sep 21, 2014
by
Kathleen
5.6k
views
gatecse-2007
theory-of-computation
decidability
normal
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
Kathleen
asked
in
Graph Theory
Sep 21, 2014
by
Kathleen
10.2k
views
gatecse-2007
graph-theory
normal
out-of-syllabus-now
34
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}$
Kathleen
asked
in
Set Theory & Algebra
Sep 21, 2014
by
Kathleen
10.0k
views
gatecse-2007
combinatory
functions
normal
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$
Kathleen
asked
in
Set Theory & Algebra
Sep 21, 2014
by
Kathleen
8.5k
views
gatecse-2007
set-theory&algebra
normal
relations
16
votes
2
answers
84
GATE CSE 2007 | Question: 1
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.
Kathleen
asked
in
Calculus
Sep 21, 2014
by
Kathleen
6.4k
views
gatecse-2007
calculus
continuity
differentiation
easy
79
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$
priya
asked
in
Linear Algebra
Sep 2, 2014
by
priya
16.6k
views
gatecse-2007
eigen-value
linear-algebra
difficult
Page:
« prev
1
2
3
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged gatecse-2007
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...