GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Chat
Previous
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.
Answers by Akash Kanase
User Akash Kanase
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Akash Kanase
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+12
votes
1
GATE200954
A subsequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths m and n, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
answered
Apr 29, 2016
in
Algorithms

745
views
gate2009
normal
algorithms
dynamicprogramming
recursion
+4
votes
2
Which all topics you covered extra?
answered
Apr 12, 2016
in
Study Resources

140
views
preparation
repeatinggate
+2
votes
3
GATE 2016 CSE
SET  1, Normalized Marks  31.39, Category  SC, What can I expect ?
answered
Feb 25, 2016
in
GATE Application

197
views
+19
votes
4
GATE 2016231
Consider a processor with $64$ registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and twelvebit immediate value. Each ... a program has 100 instructions, the amount of memory (in bytes) consumed by the program text is _________.
answered
Feb 14, 2016
in
CO & Architecture

2k
views
gate20162
instructionformat
machineinstructions
co&architecture
normal
numericalanswers
+6
votes
5
GATE 2016248
Q). Consider the following twoprocess synchronization solution. PROCESS 0 Process 1 Entry: loop while (turn ==1); Entry: loop while (turn==0); (critical section) (critical section) Exit: turn=1; Exit turn = ... violates mutual exclusion requirement. C). This solution violates progress requirement. D). This solution violates bounded wait requirement.
answered
Feb 14, 2016
in
Operating System

1.7k
views
gate20162
operatingsystem
processsynchronization
normal
+7
votes
6
GATE 2016236
Consider the following Neworder strategy for traversing a binary tree: Visit the root; Visit the right subtree using Neworder; Visit the left subtree using Neworder; The Neworder traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5  2 ^ 6 7 * 1 +  is ... * 3 4  + 1 * 7 6 ^ 2  5 * 4 3 1 7 6 * + 2 5 4 3 *  ^ 
answered
Feb 14, 2016
in
DS

1.4k
views
gate20162
datastructure
treetraversal
normal
+15
votes
7
GATE 2016254
For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE? (I) At least three nonoverlapping channels are available for transmissions. (II) The RTSCTS mechanism is used for collision detection. (III) Unicast frames are ACKed. All I, II, and III I and III only II and III only II only
answered
Feb 14, 2016
in
Computer Networks

1.6k
views
gate20162
computernetworks
wifi
normal
+18
votes
8
GATE 2016250
A file system uses an inmemory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
answered
Feb 14, 2016
in
CO & Architecture

1.5k
views
gate20162
co&architecture
cachememory
normal
numericalanswers
+13
votes
9
GATE 2016251
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$. $S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right); r_{1} \left(Y\right); w_{2} \left(X\ ... schedule is TRUE? $S$ is nonrecoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
answered
Feb 14, 2016
in
Databases

1.3k
views
gate20162
databases
concurrency
transactions
normal
+4
votes
10
GATE 2016229
The value of the expression $13^{99} (\mod 17)$, in the range $0$ to $16$, is ________.
answered
Feb 14, 2016
in
Digital Logic

2.2k
views
gate20162
digitallogic
modulararithmetic
normal
numericalanswers
+14
votes
11
GATE 2016238
Let $A_{1}, A_{2}, A_{3}$ and $A_{4}$ be four matrices of dimensions $10 \times 5, 5 \times 20, 20 \times 10,$ and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.
answered
Feb 14, 2016
in
Algorithms

1.2k
views
gate20162
dynamicprogramming
matrixchainordering
normal
numericalanswers
+24
votes
12
GATE 2016234
A complete binary minheap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.
answered
Feb 14, 2016
in
DS

1.7k
views
gate20162
datastructure
heap
normal
numericalanswers
+18
votes
13
GATE 2016235
The following function computes $X^{Y}$ for positive integers $X$ and $Y$. int exp (int X, int Y) { int res =1, a = X, b = Y; while (b != 0) { if (b % 2 == 0) {a = a * a; b = b/2; } else {res = res * a; b = b  1; } } return res; } Which one of the following ... $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
answered
Feb 14, 2016
in
Algorithms

867
views
gate20162
algorithms
loopinvariants
normal
+18
votes
14
GATE 2016202
Let $f(x)$ be a polynomial and $g(x)=f'(x)$ be its derivative. If the degree of $(f(x)+f(x))$ is $10$, then the degree of $(g(x)  g(x))$ is __________.
answered
Feb 14, 2016
in
Calculus

1k
views
gate20162
calculus
normal
numericalanswers
+20
votes
15
GATE 2016225
Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted. HTTP GET request, DNS query, TCP SYN DNS query, HTTP GET request, TCP SYN DNS query, TCP SYN, HTTP GET request. TCP SYN, DNS query, HTTP GET request.``
answered
Feb 13, 2016
in
Computer Networks

1.1k
views
gate20162
computernetworks
normal
+20
votes
16
GATE2016227
Which one of the following wellformed formulae in predicate calculus is NOT valid ? $(\forall x p(x) \implies \forall x q(x)) \implies (\exists x \neg p(x) \vee \forall x q(x))$ $(\exists x p(x) \vee \exists x q (x)) \implies \exists x (p(x) \vee q ( ... (x) \wedge \exists x q(x))$ $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
answered
Feb 13, 2016
in
Mathematical Logic

1.9k
views
gate20162
mathematicallogic
firstorderlogic
normal
+13
votes
17
GATE 2016211
Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $nth$ vertex in this BFS traversal, then the maximum possible value of $n$ is _________.
answered
Feb 13, 2016
in
DS

1.1k
views
gate20162
datastructure
bfs
binarytree
normal
numericalanswers
+18
votes
18
GATE 2016213
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in the ascending order, which of the following are TRUE? Quicksort runs in $\Theta (n^2)$ time Bubblesort runs in $\Theta (n^2)$ time Mergesort ... sort runs in $\Theta (n)$ time I and II only I and III only II and IV only I and IV only
answered
Feb 13, 2016
in
Algorithms

1.5k
views
gate20162
algorithms
sorting
timecomplexity
normal
ambiguous
+22
votes
19
GATE 2016215
$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decreasekey operation, a pointer is provided to the record on which the operation is to be performed. An algorithm performs the following ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
answered
Feb 13, 2016
in
DS

2.6k
views
gate20162
datastructure
linkedlists
timecomplexity
normal
+17
votes
20
GATE 2016203
The minimum number of colours that is sufficient to vertexcolour any planar graph is ________.
answered
Feb 13, 2016
in
Graph Theory

1.5k
views
gate20162
graphtheory
graphcoloring
normal
numericalanswers
+13
votes
21
GATE 2016210
A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$bit instruction word has an opcode, two registers operands and an immediate operand. The number of bits available for the immediate operand field is_______.
answered
Feb 13, 2016
in
CO & Architecture

1.1k
views
gate20162
machineinstructions
co&architecture
easy
numericalanswers
+12
votes
22
GATE 2016204
Consider the system, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a ... is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.
answered
Feb 12, 2016
in
Linear Algebra

1.2k
views
gate20162
linearalgebra
systemofequations
normal
+11
votes
23
GATE 2016224
In an Ethernet local area network, which one of the following statements is TRUE? A station stops to sense the channel once it starts transmitting a frame. The purpose of the jamming signal is to pad the frames that ... packet even after the collision is detected. The exponential back off mechanism reduces the probability of collision on retransmissions.
answered
Feb 12, 2016
in
Computer Networks

940
views
gate20162
computernetworks
ethernet
normal
+12
votes
24
GATE 20162GA09
In a $2 \times 4$ rectangle grid shown below, each cell is rectangle. How many rectangles can be observed in the grid? $21$ $27$ $30$ $36$
answered
Feb 12, 2016
in
Numerical Ability

1.9k
views
gate20162
numericalability
normal
+14
votes
25
GATE 2016205
Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than $100$ hours given that it is of Type $1$ is $0.7$, and given that it is of Type $2$ is $0.4$. The probability that an LED bulb chosen uniformly at random lasts more than $100$ hours is _________.
answered
Feb 12, 2016
in
Probability

926
views
gate20162
probability
conditionalprobability
normal
numericalanswers
+7
votes
26
GATE 20162GA06
Among $150$ faculty members in an institute, $55$ are connected with each other through Facebook and $85$ are connected through Whatsapp. $30$ faculty members do not have Facebook or Whatsapp accounts. The numbers of faculty members connected only through Facebook accounts is _______. $35$ $45$ $65$ $90$
answered
Feb 12, 2016
in
Numerical Ability

1.4k
views
gate20162
numericalability
sets
easy
+8
votes
27
GATE 20162GA10
$f(x) = 1  x  1$ $f(x) =1 + x  1$ $f(x) = 2  x  1$ $f(x) = 2 + x  1$
answered
Feb 12, 2016
in
Numerical Ability

708
views
gate20162
numericalability
datainterpretation
normal
+14
votes
28
GATE 20162GA08
All hillstations have a lake. Ooty has two lakes. Which of the statement(s) below is/are logically valid and can be inferred from the above sentences? (i) Ooty is not a hillstation. (ii) No hillstation can have more than one lake. (i) only. (ii) only. Both (i) and (ii) Neither (i) nor (ii)
answered
Feb 12, 2016
in
Verbal Ability

762
views
gate20162
verbalability
logicalreasoning
easy
+2
votes
29
What to do after GATE EXAM
Please suggest some ideas what to do after gate exam.
answered
Feb 11, 2016
in
Others

224
views
0
votes
30
GATE 2015 EC_S03 Q 4
Q.4 Find the missing sequence in the letter series below: A, CD, GHI, ?, UVWXY (A) LMN (B) MNO (C) MNOP (D) NOPQ
answered
Feb 2, 2016
in
Numerical Ability

99
views
aptitude
0
votes
31
GATE 2015 Set 2 Q 1
Choose the appropriate word/phrase, out of the four options given below, to complete the following sentence: Dhoni, as well as the other team members of Indian team, ____________present on the occasion. (A) were (B) was (C) has (D) have
answered
Feb 1, 2016
in
Verbal Ability

332
views
gate2015aptiset2
aptitude
verbalability
englishgrammar
+3
votes
32
GATE1994_18
State whether the following statements are True or False with reasons for your answer A subroutine cannot always be used to replace a macro in an assembly language program. A symbol declared as ‘external’ in an assembly language program is assigned an address outside the program by the assembler itself.
answered
Jan 16, 2016
in
Compiler Design

174
views
gate1994
compilerdesign
normal
+1
vote
33
TestBook Live Test Q N0 47
Consider $\rm STUDENT$ table with following tuples: SName CPI Deepak 8.7 Dilip 9.7 Kaustav 8.5 Pallab 9.8 Sourav 8.7 Swapnil 8.5 (SELECT * FROM STUDENT S1 WHERE 3 >= (SELECT COUNT(*) FROM STUDENT S2 WHERE S1.CPI <= S2. ... ) How many number of tuples are there in the output ? I'm getting $2$ as the answer, while the given answer is $4$.
answered
Jan 16, 2016
in
Databases

92
views
testseries
databases
testbook
0
votes
34
What could be the revised weightage per subject in GATE 2016 CS?
answered
Jan 15, 2016
in
Compiler Design

386
views
gate
marks
distribution
wieghtage
+2
votes
35
Synchronisation
Consider the methods used by processes P1 and P2 for accessing their critical sections whenever needed, as given below. The initial values of shared boolean variables S1 and S2 are randomly assigned. Method used by P1 Method used by P2 ... way they are getting blocked out all at once from their critical section.So no deadlock. Also its starvation free .
answered
Jan 15, 2016
in
Operating System

95
views
operatingsystem
processsynchronization
+5
votes
36
GATE20012.3
Let $f: A \rightarrow B$ a function, and let E and F be subsets of $A$. Consider the following statements about images. $S1: f(E \cup F) = f(E) \cup f(F)$ $S2: f(E \cap F)=f(E) \cap f(F)$ Which of the following is true about S1 and S2? Only S1 is correct Only S2 is correct Both S1 and S2 are correct None of S1 and S2 is correct
answered
Jan 13, 2016
in
Set Theory & Algebra

564
views
gate2001
settheory&algebra
functions
normal
+3
votes
37
GATE2004IT85
onsider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability p = 0.2 in every slot. There is no backoff and one frame can be transmitted in one slot. If more than one host transmits in the ... can support, if each host has to be provided a minimum through put of 0.16 frames per time slot? 1 2 3 4
answered
Jan 12, 2016
in
Computer Networks

1.3k
views
gate2004it
computernetworks
congestioncontrol
macprotocol
normal
+2
votes
38
no of different rooted labeled trees with n vertices ?
answered
Jan 8, 2016
in
Graph Theory

339
views
+1
vote
39
TestBook Test Series Algo Q
Q). What is the complexity of finding the $50^{th}$ smallest elements in an already constructed binary minheap? $\theta(1)$ $\theta(logn)$ $\theta(n)$ $\theta(nlogn)$ solution: Exact complexity would be $50logn$ for heapify when we do heap sort iteration $50$ times
answered
Jan 6, 2016
in
Algorithms

189
views
testseries
algorithms
timecomplexity
+5
votes
40
Finding directed broadcasting address for network.
answered
Jan 6, 2016
in
Computer Networks

229
views
subnetting
computernetworks
Page:
1
2
3
4
5
6
7
next »
22,147
questions
28,138
answers
63,516
comments
24,290
users