The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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 gate2013
+55
votes
5
answers
1
GATE201330
The number of elements that can be sorted in $\Theta(\log n)$ time using heap sort is $\Theta(1)$ $\Theta(\sqrt{\log} n)$ $\Theta(\frac{\log n}{\log \log n})$ $\Theta(\log n)$
asked
Sep 24, 2014
in
Algorithms
by
Arjun
Veteran
(
420k
points)

7.8k
views
gate2013
algorithms
sorting
normal
+37
votes
5
answers
2
GATE201329
Consider a hard disk with $16$ recording surfaces $(015)$ having 16384 cylinders $(016383)$ and each cylinder contains $64$ sectors $(063)$. Data storage capacity in each sector is $512$ bytes. Data are organized cylinderwise and the addressing format is < ... the cylinder number of the last sector of the file, if it is stored in a contiguous manner? $1281$ $1282$ $1283$ $1284$
asked
Sep 24, 2014
in
Operating System
by
Arjun
Veteran
(
420k
points)

7.7k
views
gate2013
operatingsystem
disks
normal
+23
votes
4
answers
3
GATE201328
Consider the following sequence of microoperations. MBR ← PC MAR ← X PC ← Y Memory ← MBR Which one of the following is a possible operation performed by this sequence? Instruction fetch Operand fetch Conditional branch Initiation of interrupt service
asked
Sep 24, 2014
in
CO and Architecture
by
Arjun
Veteran
(
420k
points)

4.2k
views
gate2013
coandarchitecture
microprogramming
normal
+26
votes
6
answers
4
GATE201327
What is the logical translation of the following statement? "None of my friends are perfect." $∃x(F (x)∧ ¬P(x))$ $∃ x(¬ F (x)∧ P(x))$ $ ∃x(¬F (x)∧¬P(x))$ $ ¬∃ x(F (x)∧ P(x))$
asked
Sep 24, 2014
in
Mathematical Logic
by
Arjun
Veteran
(
420k
points)

3.1k
views
gate2013
mathematicallogic
easy
firstorderlogic
+35
votes
3
answers
5
GATE201326
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if $e$ and $e'$ ... graph of a planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
asked
Sep 24, 2014
in
Graph Theory
by
Arjun
Veteran
(
420k
points)

4.1k
views
gate2013
graphtheory
normal
linegraph
+17
votes
2
answers
6
GATE201325
Which of the following statements is/are TRUE for undirected graphs? P: Number of odd degree vertices is even. Q: Sum of degrees of all vertices is even. P only Q only Both P and Q Neither P nor Q
asked
Sep 24, 2014
in
Graph Theory
by
Arjun
Veteran
(
420k
points)

2.6k
views
gate2013
graphtheory
easy
degreeofgraph
+29
votes
3
answers
7
GATE201324
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
asked
Sep 24, 2014
in
Probability
by
Arjun
Veteran
(
420k
points)

4.8k
views
gate2013
probability
expectation
normal
+2
votes
2
answers
8
GATE201323
Function $f$ is known at the following points: $x$ 0 0.3 0.6 0.9 1.2 1.5 1.8 2.1 2.4 2.7 3.0 $f(x)$ 0 0.09 0.36 0.81 1.44 2.25 3.24 4.41 5.76 7.29 9.00 The value of $\int_{0}^{3} f(x) \text{d}x$ computed using the trapezoidal rule is (A) 8.983 (B) 9.003 (C) 9.017 (D) 9.045
asked
Sep 24, 2014
in
Numerical Methods
by
Arjun
Veteran
(
420k
points)

791
views
gate2013
numericalmethods
trapezoidalrule
nongate
+7
votes
3
answers
9
GATE201322
Which one of the following functions is continuous at $x = 3?$ $f(x) = \begin{cases} 2,&\text{if $x = 3$ } \\ x1& \text{if $x > 3$}\\ \frac{x+3}{3}&\text{if $x < 3$ } \end{cases}$ $f(x) = \begin{cases} 4,&\text{if $ ... $} \end{cases}$ $f(x) = \begin{cases} \frac{1}{x^327}&\text{if $x \neq 3$ } \end{cases}$
asked
Sep 24, 2014
in
Calculus
by
Arjun
Veteran
(
420k
points)

1.8k
views
gate2013
calculus
continuity
normal
+20
votes
5
answers
10
GATE201321
Which one of the following expressions does NOT represent exclusive NOR of $x$ and $y$? $xy + x′ y′$ $x\oplus y′$ $x′\oplus y$ $x′\oplus y′$
asked
Sep 24, 2014
in
Digital Logic
by
Arjun
Veteran
(
420k
points)

1.9k
views
gate2013
digitallogic
easy
booleanalgebra
+34
votes
2
answers
11
GATE201320
In a $k$way set associative cache, the cache is divided into $v$ sets, each of which consists of $k$ lines. The lines of a set are placed in sequence one after another. The lines in set $s$ are sequenced before the lines in set $(s+1)$. The main memory blocks are numbered 0 onwards. The main memory ... $(j \text{ mod } k) * v \text{ to } (j \text{ mod } k) * v + (v1) $
asked
Sep 23, 2014
in
CO and Architecture
by
Arjun
Veteran
(
420k
points)

4.3k
views
gate2013
coandarchitecture
cachememory
normal
+21
votes
3
answers
12
GATE201319
What is the time complexity of BellmanFord singlesource shortest path algorithm on a complete graph of n vertices? $\theta(n^2)$ $\theta(n^2\log n)$ $\theta(n^3)$ $\theta(n^3\log n)$
asked
Sep 23, 2014
in
Algorithms
by
Arjun
Veteran
(
420k
points)

3.5k
views
gate2013
algorithms
graphalgorithms
normal
+13
votes
1
answer
13
GATE201318
Which of the following statements are TRUE? The problem of determining whether there exists a cycle in an undirected graph is in $P$. The problem of determining whether there exists a cycle in an undirected graph is in $NP$. If a problem A is $NPComplete$, there exists a nondeterministic polynomial time ... solve $A$ $1$, $2$ and $3$ $1$ and $2$ only $2$ and $3$ only $1$ and $3$ only
asked
Sep 23, 2014
in
Theory of Computation
by
Arjun
Veteran
(
420k
points)

1.8k
views
gate2013
theoryofcomputation
pnpnpcnph
normal
+23
votes
3
answers
14
GATE201317
Which of the following statements is/are FALSE? For every nondeterministic Turing machine, there exists an equivalent deterministic Turing machine. Turing recognizable languages are closed under union and complementation. Turing decidable languages are closed under intersection and ... languages are closed under union and intersection. 1 and 4 only 1 and 3 only 2 only 3 only
asked
Sep 23, 2014
in
Theory of Computation
by
Arjun
Veteran
(
420k
points)

3.2k
views
gate2013
theoryofcomputation
normal
closureproperty
+34
votes
6
answers
15
GATE201316
Three concurrent processes $X$, $Y$, and $Z$ execute three different code segments that access and update certain shared variables. Process $X$ executes the $P$ operation (i.e., $wait$) on semaphores $a$, $b$ and $c$; process $Y$ executes the $P$ operation on semaphores $b$, $c$ and $d$; process $Z$ executes the ... $X:$ $P(a)P(b)P(c)$ $Y:$ $P(c)P(b)P(d)$ $Z:$ $P(c)P(d)P(a)$
asked
Sep 23, 2014
in
Operating System
by
Arjun
Veteran
(
420k
points)

4.5k
views
gate2013
operatingsystem
resourceallocation
normal
+25
votes
2
answers
16
GATE201315
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index
asked
Sep 23, 2014
in
Databases
by
Arjun
Veteran
(
420k
points)

3.5k
views
gate2013
databases
indexing
normal
+23
votes
5
answers
17
GATE201314
Assume that source S and destination D are connected through two intermediate routers labeled R. Determine how many times each packet has to visit the network layer and the data link layer during a transmission from S to D. Network layer  $4$ times and Data link layer  $4$ ... layer  $4$ times and Data link layer  $6$ times Network layer  $2$ times and Data link layer  $6$ times
asked
Sep 23, 2014
in
Computer Networks
by
Arjun
Veteran
(
420k
points)

4.4k
views
gate2013
computernetworks
networklayering
normal
+19
votes
2
answers
18
GATE201313
Using public key cryptography, $X$ adds a digital signature σ to message $M$, encrypts $<M, \sigma>$, and sends it to $Y$, where it is decrypted. Which one of the following sequences of keys is used for the operations? Encryption: $X's$ private key followed ... Encryption: $X's$ private key followed by $Y's$ public key; Decryption: $Y's$ private key followed by $X's$ public key
asked
Sep 23, 2014
in
Computer Networks
by
Arjun
Veteran
(
420k
points)

2.7k
views
gate2013
computernetworks
networksecurity
normal
+17
votes
4
answers
19
GATE201312
The transport layer protocols used for real time multimedia, file transfer, DNS and email, respectively are TCP, UDP, UDP and TCP UDP, TCP, TCP and UDP UDP, TCP, UDP and TCP TCP, UDP, TCP and UDP
asked
Sep 23, 2014
in
Computer Networks
by
Arjun
Veteran
(
420k
points)

2.6k
views
gate2013
computernetworks
tcp
udp
easy
+2
votes
2
answers
20
GATE201311
Match the problem domains in GROUP I with the solution technologies in GROUP II. GROUP I GROUP II (P) Service oriented computing (1) Interoperability (Q) Heterogeneous communicating systems (2) BPMN (R) Information representation (3) Publishfindbind (S) Process description (4) XML (A) P1, Q2, R3, S4 (B) P3, Q4, R2, S1 (C) P3, Q1, R4, S2 (D) P4, Q3, R2, S1
asked
Sep 23, 2014
in
IS&Software Engineering
by
Arjun
Veteran
(
420k
points)

697
views
gate2013
is&softwareengineering
normal
+25
votes
4
answers
21
GATE201310
A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with zero (the lowest priority). The scheduler reevaluates the process priorities every $T$ time units and decides the next process to ... algorithm is equivalent to the shortestjobfirst algorithm. This algorithm is equivalent to the shortestremainingtimefirst algorithm.
asked
Sep 23, 2014
in
Operating System
by
Arjun
Veteran
(
420k
points)

4.4k
views
gate2013
operatingsystem
processschedule
normal
+47
votes
6
answers
22
GATE20139
What is the maximum number of reduce moves that can be taken by a bottomup parser for a grammar with no epsilon and unitproduction (i.e., of type $A \rightarrow \epsilon$ and $A \rightarrow a$) to parse a string with $n$ tokens? $n/2$ $n1$ $2n1$ $2^{n}$
asked
Sep 23, 2014
in
Compiler Design
by
Arjun
Veteran
(
420k
points)

6.2k
views
gate2013
compilerdesign
parsing
normal
+31
votes
5
answers
23
GATE20138
Consider the languages $L_1 = \phi$ and $L_2 = \{a\}$. Which one of the following represents $L_1 {L_2}^* \cup {L_1}^*$ ? $\{\epsilon\}$ $\phi$ $a^*$ $\{\epsilon, a\}$
asked
Sep 23, 2014
in
Theory of Computation
by
Arjun
Veteran
(
420k
points)

4.6k
views
gate2013
theoryofcomputation
normal
regularlanguages
+24
votes
4
answers
24
GATE20137
Which one of the following is the tightest upper bound that represents the time complexity of inserting an object into a binary search tree of $n$ nodes? $O(1)$ $O(\log n)$ $O(n)$ $O(n \log n)$
asked
Sep 23, 2014
in
DS
by
Arjun
Veteran
(
420k
points)

3k
views
gate2013
datastructure
easy
binarysearchtree
+17
votes
1
answer
25
GATE20136
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort? $O(\log n$) $O(n$) $O(n \log n$) $O(n^{2}$)
asked
Sep 23, 2014
in
Algorithms
by
Arjun
Veteran
(
420k
points)

1.9k
views
gate2013
algorithms
sorting
easy
+18
votes
2
answers
26
GATE20135
In the following truth table, $V = 1$ ... What function does the truth table represent? Priority encoder Decoder Multiplexer Demultiplexer
asked
Sep 23, 2014
in
Digital Logic
by
Arjun
Veteran
(
420k
points)

1.8k
views
gate2013
digitallogic
normal
digitalcircuits
+13
votes
2
answers
27
GATE20134
The smallest integer that can be represented by an $8bit$ number in $2's$ complement form is $256$ $128$ $127$ $0$
asked
Sep 23, 2014
in
Digital Logic
by
Arjun
Veteran
(
420k
points)

2.8k
views
gate2013
digitallogic
numberrepresentation
easy
+19
votes
3
answers
28
GATE20133
Which one of the following does NOT equal $\begin{vmatrix} 1 & x & x^{2}\\ 1& y & y^{2}\\ 1 & z & z^{2} \end{vmatrix} \quad ?$ $\begin{vmatrix} 1& x(x+1)& x+1\\ 1& y(y+1) & y+1\\ 1& z(z+1) & z+1 \end{vmatrix}$ ... $\begin{vmatrix} 2& x+y & x^{2}+y^{2}\\ 2 & y+z & y^{2}+z^{2}\\ 1 & z & z^{2} \end{vmatrix}$
asked
Sep 23, 2014
in
Linear Algebra
by
Arjun
Veteran
(
420k
points)

2k
views
gate2013
linearalgebra
normal
determinant
+55
votes
6
answers
29
GATE201352
A computer uses $46bit$ virtual address, $32bit$ physical address, and a threelevel paged page table organization. The page table base register stores the base address of the firstlevel table $(T1)$, which occupies exactly one page. Each entry of $T1$ stores the base address of a ... block size is $64$ bytes. What is the size of a page in $KB$ in this computer? $2$ $4$ $8$ $16$
asked
Sep 10, 2014
in
Operating System
by
kanikool
(
59
points)

12.4k
views
gate2013
operatingsystem
virtualmemory
normal
+56
votes
6
answers
30
GATE201345
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are ... taken during the execution of this program, the time (in ns) needed to complete the program is $132$ $165$ $176$ $328$
asked
Sep 6, 2014
in
CO and Architecture
by
Kriss Singh
(
155
points)

13.4k
views
gate2013
normal
coandarchitecture
pipelining
Page:
« prev
1
2
3
next »
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
Standard Videos for Calculus
Standard Videos for Linear Algebra
Standard Videos for Graph Theory
Standard Videos for Combinatory
Standard Videos for Set Theory & Algebra
Follow @csegate
Recent questions tagged gate2013
Recent Blog Comments
I will add the videos link soon.
video link ?
I think no need to add GO classroom content...
For combinatorics , can add balls and bin...
Yes, and it is really helpful for us. Thanks
50,288
questions
55,719
answers
192,115
comments
90,138
users