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 gate20151
0
votes
0
answers
1
Gate 2015
Let G(V,E) an undirected graph with positive edge weight . Dijkstra algorithm source shortest path algorithm can be implemented using binary heap data structures with time complexity ______? A. O(V^2) B. O(E+V log V) C. O((E+V) log V)
asked
Sep 17, 2018
in
Algorithms
by
karandave
(
7
points)

52
views
gate20151
algorithms
graphalgorithms
dijkstrasalgorithm
0
votes
2
answers
2
Gate 2015
Int main() { unsigned int x[4][3]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}} Printf("%u%u%u",x+3,*(x+3),*(x+2)+3); } Assume that address of x is 2000 And intrger requires four byte of memory Answer is 2036,2036,2036 My question is why *(x+3) give address of that location .why not value which present at that location.and please suggest some good source to learn about this concept
asked
Jul 9, 2018
in
Programming
by
Vraj_sharma24
(
25
points)

102
views
gate20151
+47
votes
3
answers
3
GATE2015155
The least number of temporary variables required to create a threeaddress code in static single assignment form for the expression $q + r / 3 + s  t * 5 + u * v/w$ is__________________.
asked
Feb 14, 2015
in
Compiler Design
by
makhdoom ghaya
Boss
(
41.2k
points)

8.2k
views
gate20151
compilerdesign
intermediatecode
normal
numericalanswers
+16
votes
3
answers
4
GATE2015154
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is_______________.
asked
Feb 14, 2015
in
Graph Theory
by
makhdoom ghaya
Boss
(
41.2k
points)

4.7k
views
gate20151
graphtheory
graphconnectivity
normal
graphplanarity
outofsyllabusnow
numericalanswers
+18
votes
3
answers
5
GATE2015153
Suppose that the stopandwait protocol is used on a link with a bit rate of $64$ $\text{kilobits}$ per second and $20$ $\text{milliseconds}$ propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least $50$ $\text{%}$ is_________________.
asked
Feb 14, 2015
in
Computer Networks
by
makhdoom ghaya
Boss
(
41.2k
points)

7.5k
views
gate20151
computernetworks
stopandwait
normal
numericalanswers
+35
votes
8
answers
6
GATE2015152
Consider the DFAs $M$ and $N$ given above. The number of states in a minimal DFA that accept the language $L(M) \cap L(N)$ is_____________.
asked
Feb 14, 2015
in
Theory of Computation
by
makhdoom ghaya
Boss
(
41.2k
points)

3.7k
views
gate20151
theoryofcomputation
finiteautomata
easy
numericalanswers
+36
votes
3
answers
7
GATE2015151
Consider the NPDA ... is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
asked
Feb 13, 2015
in
Theory of Computation
by
makhdoom ghaya
Boss
(
41.2k
points)

6.2k
views
gate20151
theoryofcomputation
pushdownautomata
normal
+30
votes
2
answers
8
GATE2015150
A variable x is said to be live at a statement $s_{i}$ in a program if the following three conditions hold simultaneously: There exists a statement $S_{j}$ that uses $x$ There is a path from $S_{i}$ to $S_{j}$ in the flow graph corresponding to the program The path has no intervening ... of the above control flow graph are $\text{p, s, u}$ $\text{r, s, u}$ $\text{r, u}$ $\text{q, v}$
asked
Feb 13, 2015
in
Compiler Design
by
makhdoom ghaya
Boss
(
41.2k
points)

5.2k
views
gate20151
compilerdesign
livevariable
normal
+29
votes
3
answers
9
GATE2015149
Let a$_{n}$ represent the number of bit strings of length n containing two consecutive $1$s. What is the recurrence relation for $a_{n}$? $a_{n  2} + a_{n  1} + 2^{n  2}$ $a_{n  2} + 2a_{n  1} + 2^{n  2}$ $2a_{n  2} + a_{n  1} + 2^{n  2}$ $2a_{n  2} + 2a_{n  1} + 2^{n  2}$
asked
Feb 13, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
41.2k
points)

3.1k
views
gate20151
algorithms
recurrence
normal
+30
votes
6
answers
10
GATE2015148
Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in the disk. The ... each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is__________________
asked
Feb 13, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
41.2k
points)

5.8k
views
gate20151
operatingsystem
disks
normal
numericalanswers
+18
votes
2
answers
11
GATE2015147
Consider a main memory with fivepage frames and the following sequence of page references: $\text{3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3}$. Which one of the following is true with respect to page replacement policies First In First Out ( ... page faults FIFO incurs $2$ more page faults than LRU LRU incurs $2$ more page faults than FIFO FIFO incurs $1$ more page faults than LRU
asked
Feb 13, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
41.2k
points)

2.3k
views
gate20151
operatingsystem
pagereplacement
normal
+49
votes
8
answers
12
GATE2015146
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3$, $7$ and $20$ milliseconds, ... the 1st millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
asked
Feb 13, 2015
in
Operating System
by
makhdoom ghaya
Boss
(
41.2k
points)

7.9k
views
gate20151
operatingsystem
processschedule
normal
numericalanswers
+22
votes
6
answers
13
GATE2015145
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the resultant BFS ... $T$, then which one of the following CANNOT be the value of $d(u)  d(v)$? $1$ $0$ $1$ $2$
asked
Feb 13, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
41.2k
points)

4.4k
views
gate20151
algorithms
graphalgorithms
normal
+12
votes
2
answers
14
GATE2015144
Compute the value of: $\large \int_{\frac{1}{\pi}}^{\frac{2}{\pi}}\frac{\cos(1/x)}{x^{2}}dx$
asked
Feb 13, 2015
in
Calculus
by
makhdoom ghaya
Boss
(
41.2k
points)

2.1k
views
gate20151
calculus
integration
normal
numericalanswers
+37
votes
5
answers
15
GATE2015143
The graph shown below has $8$ edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight $36$ and contains the edges: $\{(A, C), (B, C), (B, E), (E, F), (D, F)\}$. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all $8$ edges of this graph is_______________.
asked
Feb 13, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
41.2k
points)

4.9k
views
gate20151
algorithms
spanningtree
normal
numericalanswers
+6
votes
3
answers
16
GATE2015142
Consider the following C program segment. while (first <= last) { if (array[middle] < search) first = middle + 1; else if (array[middle] == search) found = TRUE; else last = middle  1; middle = (first + last)/2; } if (first > last) notpresent = TRUE; The cyclomatic complexity of the program segment is_______________.
asked
Feb 13, 2015
in
IS&Software Engineering
by
makhdoom ghaya
Boss
(
41.2k
points)

2k
views
gate20151
is&softwareengineering
cyclomaticcomplexity
normal
outofsyllabusnow
numericalanswers
+23
votes
5
answers
17
GATE2015141
Consider an EntityRelationship $(ER)$ model in which entity sets E$_{1}$ and E$_{2}$ are connected by an m:n relationship R$_{12}$. E$_{1}$ and E$_{3}$ are connected by a 1 : n (1 on the side of E$_{1}$ and n on ... If a relational model is derived from the above $ER$ model, then the minimum number of relations that would be generated if all relation are in $3NF$ is________________.
asked
Feb 13, 2015
in
Databases
by
makhdoom ghaya
Boss
(
41.2k
points)

4k
views
gate20151
databases
erdiagram
normal
numericalanswers
+43
votes
4
answers
18
GATE2015140
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decreasekey operations on a set of data items with keys ... use, if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min  heap Sorted array Sorted doubly linked list
asked
Feb 13, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
41.2k
points)

6.1k
views
gate20151
algorithms
datastructure
normal
timecomplexity
+45
votes
7
answers
19
GATE2015139
Consider the operations $\textit{f (X, Y, Z) = X'YZ + XY' + Y'Z'}$ and $\textit{g (X, Y, Z) = X'YZ + X'YZ' + XY}$ Which one of the following is correct? Both $\left\{\textit{f} \right\}$ and $\left\{ \textit{g}\right\}$ are ... Only $\left\{ \textit{g}\right\}$ is functionally complete Neither $\left\{ \textit{f}\right\}$ nor $\left\{\textit{g}\right\}$ is functionally complete
asked
Feb 13, 2015
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
41.2k
points)

6.7k
views
gate20151
settheory&algebra
functions
difficult
+27
votes
3
answers
20
GATE2015138
Consider a nonpipelined processor with a clock rate of $2.5$ $GHz$ and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to $2$ $GHz$. Assume that there are no stalls in the pipeline. The speedup achieved in this pipelined processor is_______________.
asked
Feb 13, 2015
in
CO & Architecture
by
makhdoom ghaya
Boss
(
41.2k
points)

8.4k
views
gate20151
coandarchitecture
pipelining
normal
numericalanswers
+21
votes
8
answers
21
GATE2015137
A positive edgetriggered D flipflop is connected to a positive edgetriggered JK flipflop as follows. The Q output of the D flipflop is connected to both the J and K inputs of the JK flipflop, while the Q output of the JK flipflop is connected ... mode of the JK flipflops. Both the flipflops have nonzero propagation delays. 0110110... 0100100... 011101110... 011001100...
asked
Feb 13, 2015
in
Digital Logic
by
makhdoom ghaya
Boss
(
41.2k
points)

3.8k
views
gate20151
digitallogic
flipflop
normal
+17
votes
3
answers
22
GATE2015136
Consider the following $2 \times 2$ matrix $A$ where two elements are unknown and are marked by $a$ and $b$. The eigenvalues of this matrix are 1 and 7. What are the values of $a$ and $b$? $\qquad A = \bigl(\begin{smallmatrix}1 & 4\\ b&a \end{smallmatrix}\bigr)$ $a = 6, b = 4$ $a = 4, b = 6$ $a = 3, b = 5$ $a = 5, b = 3 $
asked
Feb 13, 2015
in
Linear Algebra
by
makhdoom ghaya
Boss
(
41.2k
points)

1.5k
views
gate20151
linearalgebra
eigenvalue
normal
+56
votes
3
answers
23
GATE2015135
What is the output of the following C code? Assume that the address of $x$ is $2000$ (in decimal) and an integer requires four bytes of memory. int main () { unsigned int x [4] [3] = {{1, 2, 3}, {4, 5, 6}, {7, 8, 9}, {10, 11, 12}}; printf ("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3); } $2036, 2036, 2036$ $2012, 4, 2204$ $2036, 10, 10$ $2012, 4, 6$
asked
Feb 13, 2015
in
Programming
by
makhdoom ghaya
Boss
(
41.2k
points)

6.6k
views
gate20151
programming
programminginc
normal
+38
votes
5
answers
24
GATE2015134
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
asked
Feb 13, 2015
in
Set Theory & Algebra
by
makhdoom ghaya
Boss
(
41.2k
points)

4.6k
views
gate20151
settheory&algebra
normal
lattice
+37
votes
6
answers
25
GATE2015133
Consider the following pseudo code, where $x$ and $y$ are positive integers. begin q := 0 r := x while r ≥ y do begin r := r  y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is $\{ r = qx + y \wedge r < y\}$ $\{ x = qy + r \wedge r < y\}$ $\{ y = qx + r \wedge 0 < r < y\}$ $\{ q + 1 < r  y \wedge y > 0\}$
asked
Feb 13, 2015
in
Programming
by
makhdoom ghaya
Boss
(
41.2k
points)

2.9k
views
gate20151
programming
loopinvariants
normal
+18
votes
2
answers
26
GATE2015132
Consider a max heap, represented by the array: $40, 30, 20, 10, 15, 16, 17, 8, 4$. Array index $1$ $2$ $3$ $4$ $5$ $6$ $7$ $8$ $9$ Value $40$ $30$ $20$ $10$ $15$ $16$ $17$ $8$ $4$ Now consider that a value $35$ ... $40, 30, 20, 10, 35, 16, 17, 8, 4, 15$ $40, 35, 20, 10, 15, 16, 17, 8, 4, 30$
asked
Feb 13, 2015
in
DS
by
makhdoom ghaya
Boss
(
41.2k
points)

1.3k
views
gate20151
datastructure
heap
easy
+29
votes
5
answers
27
GATE2015131
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) ++p; for (k = 1; k < p; k = k * 2) ++q; } return q; } Which one of the following most closely approximates the return value of the function fun1? $n^3$ $n(\log n)^2$ $n \log n$ $n \log(\log n)$
asked
Feb 13, 2015
in
Algorithms
by
makhdoom ghaya
Boss
(
41.2k
points)

3.8k
views
gate20151
algorithms
normal
identifyfunction
+21
votes
8
answers
28
GATE2015129
Consider a LAN with four nodes $S_1, S_2, S_3,$ and $S_4$. Time is divided into fixedsize slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node ... $0.4$ respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is__________________.
asked
Feb 13, 2015
in
Computer Networks
by
makhdoom ghaya
Boss
(
41.2k
points)

3.4k
views
gate20151
computernetworks
normal
numericalanswers
congestioncontrol
+27
votes
5
answers
29
GATE2015126
$\sum\limits_{x=1}^{99}\frac{1}{x(x+1)}$ = __________________.
asked
Feb 13, 2015
in
Combinatory
by
makhdoom ghaya
Boss
(
41.2k
points)

1.9k
views
gate20151
permutationsandcombinations
normal
numericalanswers
summation
+16
votes
4
answers
30
GATE2015121
Suppose that everyone in a group on $N$ people wants to communicate secretly with the $(\text{N  1})$ others using symmetric Key cryptographic system. The communication between any two person should not be decodable by the others in the group. The numbers of keys required in the system ... to satisfy the confidentiality requirement is $2N$ $N(N1)$ $\dfrac{N(N1)}{2}$ $(N1)^{2}$
asked
Feb 13, 2015
in
Computer Networks
by
makhdoom ghaya
Boss
(
41.2k
points)

2.2k
views
gate20151
computernetworks
networksecurity
normal
Page:
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
Official keys are out now.
JEST 2019 MEMORY BASED QUESTION PAPER
Relax... But....
Barc : Arjun Sir
JEST Sample Question
Follow @csegate
Recent questions tagged gate20151
Recent Blog Comments
yes, probably I think we can also claim or...
Agreed. And i see some people who have even...
@
As far as I read from various sources, GOAPS will...
ask the same question of the jest exam on GO and...
47,910
questions
52,287
answers
182,227
comments
67,728
users