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-2015-set2
51
votes
7
answers
31
GATE CSE 2015 Set 2 | Question: 26
Let $f(x)=x^{-\left(\frac{1}{3}\right)}$ and $A$ denote the area of region bounded by $f(x)$ and the X-axis, when $x$ varies from $-1$ to $1$. Which of the following statements is/are TRUE? $f$ is continuous in $[-1, 1]$ $f$ is not bounded in $[-1, 1]$ $A$ is nonzero and finite II only III only II and III only I, II and III
go_editor
asked
in
Calculus
Feb 12, 2015
by
go_editor
17.1k
views
gatecse-2015-set2
continuity
functions
normal
55
votes
5
answers
32
GATE CSE 2015 Set 2 | Question: 25
A computer system implements a $40\;\text{-bit}$ virtual address, page size of $8\;\text{kilobytes}$, and a $128\text{-entry}$ translation look-aside buffer $\text{(TLB)}$ organized into $32$ sets each having $4$ ways. Assume that the $\text{TLB}$ tag does not store any process id. The minimum length of the $\text{TLB}$ tag in bits is ______.
go_editor
asked
in
Operating System
Feb 12, 2015
by
go_editor
21.5k
views
gatecse-2015-set2
operating-system
virtual-memory
easy
numerical-answers
35
votes
4
answers
33
GATE CSE 2015 Set 2 | Question: 24
Assume that for a certain processor, a read request takes $50\:\text{nanoseconds}$ on a cache miss and $5\:\text{nanoseconds}$ on a cache hit. Suppose while running a program, it was observed that $80\%$ of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ______.
go_editor
asked
in
CO and Architecture
Feb 12, 2015
by
go_editor
13.8k
views
gatecse-2015-set2
co-and-architecture
cache-memory
easy
numerical-answers
49
votes
10
answers
34
GATE CSE 2015 Set 2 | Question: 23
A system has $6$ identical resources and $N$ processes competing for them. Each process can request at most $2$ requests. Which one of the following values of $N$ could lead to a deadlock? $1$ $2$ $3$ $4$
go_editor
asked
in
Operating System
Feb 12, 2015
by
go_editor
34.0k
views
gatecse-2015-set2
operating-system
resource-allocation
easy
61
votes
6
answers
35
GATE CSE 2015 Set 2 | Question: 22
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in this list that is neither maximum nor minimum is $\Theta(n \log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta(1)$
go_editor
asked
in
Algorithms
Feb 12, 2015
by
go_editor
17.5k
views
gatecse-2015-set2
algorithms
time-complexity
easy
48
votes
7
answers
36
GATE CSE 2015 Set 2 | Question: 21
Consider the following statements. The complement of every Turing decidable language is Turing decidable There exists some language which is in NP but is not Turing decidable If L is a language in NP, L is Turing decidable Which of the above statements is/are true? Only II Only III Only I and II Only I and III
go_editor
asked
in
Theory of Computation
Feb 12, 2015
by
go_editor
15.3k
views
gatecse-2015-set2
theory-of-computation
decidability
easy
27
votes
4
answers
37
GATE CSE 2015 Set 2 | Question: 20
Identify the correct order in which a server process must invoke the function calls accept, bind, listen, and recv according to UNIX socket API. $\textsf{listen, accept, bind, recv}$ $\textsf{bind, listen, accept, recv}$ $\textsf{bind, accept, listen, recv}$ $\textsf{accept, listen, bind, recv}$
go_editor
asked
in
Computer Networks
Feb 12, 2015
by
go_editor
9.7k
views
gatecse-2015-set2
computer-networks
sockets
easy
34
votes
3
answers
38
GATE CSE 2015 Set 2 | Question: 19
Match the following: ... $\text{P-2, Q-4, R-1, S-3}$ $\text{P-2, Q-3, R-4, S-1}$
go_editor
asked
in
Compiler Design
Feb 12, 2015
by
go_editor
6.9k
views
gatecse-2015-set2
compiler-design
normal
compilation-phases
match-the-following
23
votes
6
answers
39
GATE CSE 2015 Set 2 | Question: 18
The cardinality of the power set of $\{0, 1, 2, \dots , 10\}$ is _______
go_editor
asked
in
Set Theory & Algebra
Feb 12, 2015
by
go_editor
5.1k
views
gatecse-2015-set2
set-theory&algebra
set-theory
easy
numerical-answers
62
votes
4
answers
40
GATE CSE 2015 Set 2 | Question: 17
Consider a complete binary tree where the left and right subtrees of the root are max-heaps. The lower bound for the number of operations to convert the tree to a heap is $\Omega(\log n)$ $\Omega(n)$ $\Omega(n \log n)$ $\Omega(n^2)$
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
16.2k
views
gatecse-2015-set2
data-structures
binary-heap
normal
38
votes
2
answers
41
GATE CSE 2015 Set 2 | Question: 16
Let $R$ be the relation on the set of positive integers such that $aRb$ and only if $a$ and $b$ are distinct and let have a common divisor other than $1.$ Which one of the following statements about $R$ is true? $R$ is ... but not symmetric not transitive $R$ is transitive but not reflexive and not symmetric $R$ is symmetric but not reflexive and not transitive
go_editor
asked
in
Set Theory & Algebra
Feb 12, 2015
by
go_editor
7.6k
views
gatecse-2015-set2
set-theory&algebra
relations
normal
41
votes
4
answers
42
GATE CSE 2015 Set 2 | Question: 15
Consider the following function written in the C programming langauge : void foo(char *a) { if (*a && *a != ' ') { foo(a+1); putchar(*a); } } The output of the above function on input "$ABCD \ EFGH$" is $ABCD \ EFGH$ $ABCD$ $HGFE \ DCBA$ $DCBA$
go_editor
asked
in
Programming in C
Feb 12, 2015
by
go_editor
14.4k
views
gatecse-2015-set2
programming
programming-in-c
normal
recursion
44
votes
1
answer
43
GATE CSE 2015 Set 2 | Question: 14
In the context of abstract-syntax-tree (AST) and control-flow-graph (CFG), which one of the following is TRUE? In both AST and CFG, let node $N_2$ be the successor of node $N_1$. In the input program, the code corresponding to $N_2$ ... an AST and a CFG depends on the input program Each node in AST and CFG corresponds to at most one statement in the input program
go_editor
asked
in
Compiler Design
Feb 12, 2015
by
go_editor
13.1k
views
gatecse-2015-set2
compiler-design
easy
abstract-syntax-tree
9
votes
5
answers
44
GATE CSE 2015 Set 2 | Question: 13
Which of the following statements is NOT correct about HTTP cookies? A cookie is a piece of code that has the potential to compromise the security of an Internet user A cookie gains entry to the user's work area through an HTTP header A cookie has an expiry date and time Cookies can be used to track the browsing pattern of a user at a particular site
go_editor
asked
in
Web Technologies
Feb 12, 2015
by
go_editor
8.0k
views
gatecse-2015-set2
web-technologies
easy
4
votes
3
answers
45
GATE CSE 2015 Set 2 | Question: 12
Consider the basic COCOMO model where $E$ is the effort applied in person-months, $D$ is the development time in chronological months, $KLOC$ is the estimated number of delivered lines of code (in thousands) and $a_b, b_b, c_b, d_b$ have their useful meanings. The basic ... $E=a_b exp(b_b), D=c_b (KLOC) exp(d_b)$ $E=a_b exp(d_b), D=c_b (KLOC) exp(b_b)$
go_editor
asked
in
IS&Software Engineering
Feb 12, 2015
by
go_editor
3.9k
views
gatecse-2015-set2
is&software-engineering
cocomo-model
normal
non-gate
62
votes
12
answers
46
GATE CSE 2015 Set 2 | Question: 11
Consider the following C function. int fun(int n) { int x=1, k; if (n==1) return x; for (k=1; k<n; ++k) x = x + fun(k) * fun (n-k); return x; } The return value of $fun(5)$ is ______.
go_editor
asked
in
Algorithms
Feb 12, 2015
by
go_editor
21.0k
views
gatecse-2015-set2
algorithms
identify-function
recurrence-relation
normal
numerical-answers
35
votes
12
answers
47
GATE CSE 2015 Set 2 | Question: 10
A binary tree T has $20$ leaves. The number of nodes in T having two children is ______.
go_editor
asked
in
DS
Feb 12, 2015
by
go_editor
30.1k
views
gatecse-2015-set2
data-structures
binary-tree
normal
numerical-answers
18
votes
2
answers
48
GATE CSE 2015 Set 2 | Question: 9
The number of divisors of $2100$ is ____.
go_editor
asked
in
Set Theory & Algebra
Feb 12, 2015
by
go_editor
8.9k
views
gatecse-2015-set2
set-theory&algebra
number-theory
easy
numerical-answers
36
votes
4
answers
49
GATE CSE 2015 Set 2 | Question: 8
A link has transmission speed of $10^6$ bits/sec. It uses data packets of size $1000$ $\text{bytes}$ each. Assume that the acknowledgment has negligible transmission delay and that its propagation delay is the same as the data propagation delay. ... $\text{%}$. The value of the one way propagation delay (in milliseconds) is_____.
go_editor
asked
in
Computer Networks
Feb 12, 2015
by
go_editor
11.8k
views
gatecse-2015-set2
computer-networks
mac-protocol
stop-and-wait
normal
numerical-answers
79
votes
8
answers
50
GATE CSE 2015 Set 2 | Question: 7
The minimum number of $\text{JK}$ flip-flops required to construct a synchronous counter with the count sequence $(0, 0, 1, 1, 2, 2, 3, 3, 0, 0, \ldots)$ is _______.
go_editor
asked
in
Digital Logic
Feb 12, 2015
by
go_editor
36.8k
views
gatecse-2015-set2
digital-logic
digital-counter
normal
numerical-answers
44
votes
3
answers
51
GATE CSE 2015 Set 2 | Question: 6
With reference to the B+ tree index of order $1$ shown below, the minimum number of nodes (including the Root node) that must be fetched in order to satisfy the following query. "Get all records with a search key greater than or equal to $7$ and less than $15$ " is ______.
go_editor
asked
in
Databases
Feb 12, 2015
by
go_editor
13.2k
views
gatecse-2015-set2
databases
b-tree
normal
numerical-answers
23
votes
3
answers
52
GATE CSE 2015 Set 2 | Question: 5
The larger of the two eigenvalues of the matrix $\begin{bmatrix} 4 & 5 \\ 2 & 1 \end{bmatrix}$ is _______.
go_editor
asked
in
Linear Algebra
Feb 12, 2015
by
go_editor
7.5k
views
gatecse-2015-set2
linear-algebra
eigen-value
easy
numerical-answers
4
votes
1
answer
53
GATE CSE 2015 Set 2 | Question: 4
A software requirements specification (SRS) document should avoid discussing which one of the following? User interface issues Non-functional requirements Design specification Interfaces with third party software
go_editor
asked
in
IS&Software Engineering
Feb 12, 2015
by
go_editor
7.5k
views
gatecse-2015-set2
is&software-engineering
normal
non-gate
33
votes
6
answers
54
GATE CSE 2015 Set 2 | Question: 3
Consider the following two statements. $S_1$: If a candidate is known to be corrupt, then he will not be elected $S_2$: If a candidate is kind, he will be elected Which one of the following statements follows from $S_1$ and $S_2$ as per sound inference ... If a person is kind, he is not known to be corrupt If a person is not kind, he is not known to be corrupt
go_editor
asked
in
Mathematical Logic
Feb 12, 2015
by
go_editor
8.8k
views
gatecse-2015-set2
mathematical-logic
normal
logical-reasoning
16
votes
2
answers
55
GATE CSE 2015 Set 2 | Question: 2
Consider two decision problems $Q_1, Q_2$ such that $Q_1$ reduces in polynomial time to 3-SAT and 3-SAT reduces in polynomial time to $Q_2$. Then which one of the following is consistent with the above statement? $Q_1$ is in NP, $Q_2$ is NP hard. $Q_2$ is in NP, $Q_1$ is NP hard. Both $Q_1$ and $Q_2$ are in NP. Both $Q_1$ and $Q_2$ are in NP hard.
go_editor
asked
in
Theory of Computation
Feb 12, 2015
by
go_editor
6.4k
views
gatecse-2015-set2
algorithms
p-np-npc-nph
easy
out-of-syllabus-now
33
votes
4
answers
56
GATE CSE 2015 Set 2 | Question: 1
Consider the following transaction involving two bank accounts $x$ and $y$. read(x); x:=x-50; write (x); read(y); y:=y+50; write(y) The constraint that the sum of the accounts $x$ and $y$ should remain constant is that of Atomicity Consistency Isolation Durability
go_editor
asked
in
Databases
Feb 12, 2015
by
go_editor
14.1k
views
gatecse-2015-set2
databases
transaction-and-concurrency
easy
18
votes
4
answers
57
GATE CSE 2015 Set 2 | Question: GA-10
Out of the following $4$ sentences, select the most suitable sentence with respect to grammar and usage: Since the report lacked needed information, it was of no use to them. The report was useless to them because there were no needed ... it was not real useful to them. Since the report lacked needed information, it would not had been useful to them.
go_editor
asked
in
Verbal Aptitude
Feb 12, 2015
by
go_editor
4.4k
views
gatecse-2015-set2
verbal-aptitude
normal
english-grammar
grammatical-error
35
votes
1
answer
58
GATE CSE 2015 Set 2 | Question: GA-9
If $p, q, r, s$ are distinct integers such that: $f (p, q, r, s) = \text{ max } (p, q, r, s)$ $g (p, q, r, s) = \text{ min } (p, q, r, s)$ ... operations are valid with two variable functions of the form $f(p, q)$ What is the value of $fg \left(h \left(2, 5, 7, 3\right), 4, 6, 8\right)$?
go_editor
asked
in
Quantitative Aptitude
Feb 12, 2015
by
go_editor
6.2k
views
gatecse-2015-set2
functions
normal
numerical-answers
29
votes
4
answers
59
GATE CSE 2015 Set 2 | Question: GA-8
In a triangle $PQR, PS$ is the angle bisector of $\angle QPR \text{ and } \angle QPS =60^\circ$. What is the length of $PS$ ? $\left(\dfrac{(q+r)} {qr}\right)$ $\left(\dfrac {qr} {q+r}\right)$ $\large \sqrt {(q^2 + r^2)}$ $\left(\dfrac{(q+r)^2} {qr}\right)$
go_editor
asked
in
Quantitative Aptitude
Feb 12, 2015
by
go_editor
11.0k
views
gatecse-2015-set2
quantitative-aptitude
geometry
difficult
triangles
33
votes
6
answers
60
GATE CSE 2015 Set 2 | Question: GA-7
Four branches of a company are located at $\text{M, N, O}$ and $\text{P. M}$ is north of $\text{N}$ at a distance of $4\;\text{km; P}$ is south of $\text{O}$ at a distance of $2\;\text{km; N}$ is southeast of $\text{O}$ by $1\;\text{km}$. What is the distance between $\text{M}$ and $\text{P}$ in $\text{km}$? $5.34$ $6.74$ $28.5$ $45.49$
go_editor
asked
in
Analytical Aptitude
Feb 12, 2015
by
go_editor
13.3k
views
gatecse-2015-set2
analytical-aptitude
normal
direction-sense
Page:
« prev
1
2
3
next »
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-2015-set2
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:...