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
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.
Recent activity by Himanshu1
User Himanshu1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Himanshu1
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
median of two sorted Arrays
commented
Jun 6, 2016
in
Algorithms

181
views
algorithms
timecomplexity
sorting
1
answer
2
1000th power of a matrix
Find the 1000_th power of the matrix 
answer reshown
Jun 3, 2016
in
Linear Algebra

154
views
linearalgebra
matrices
2
answers
3
Probability
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collisions by linear probing is (assume uniform hashing) a)2/3 b)1/3 c)1 d) 1/6
commented
May 2, 2016
in
Programming

119
views
0
answers
4
Find the age of Daughters  This was asked in Google
edited
May 2, 2016
in
Numerical Ability

85
views
numericalability
2
answers
5
Binary Number when interpreted as decimal mod 12
commented
Apr 21, 2016
in
Theory of Computation

185
views
minimalstateautomata
theoryofcomputation
2
answers
6
A better guess on upper bound
It's a question from Cormen book Exercise 4.45 and is described like this: Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n1)+T(\frac{n}{2})+n$
commented
Apr 18, 2016
in
Algorithms

164
views
asymptoticnotations
recurrence
2
answers
7
least significant digit of 2 ^ (3 * (10 ^ 100) )
asked
Apr 15, 2016
in
Numerical Ability

80
views
numericalability
numericalanswers
1
answer
8
GATE 2016146
Consider the following Syntax Directed Translation Scheme $( SDTS )$, with nonterminals $\{S,A \}$ and terminals $\{a,b \}$. $S \to aA \quad \{\text{print }1\}$ $S \to a \quad \{\text{print }2\}$ $A \to Sb \quad \{\text{print }3\}$ Using the ... printed by a bottomup parser, for the input $aab$ is: $1 \ 3 \ 2 $ $2 \ 2 \ 3 $ $2 \ 3 \ 1 $ syntax error
edited
Apr 7, 2016
in
Compiler Design

1.2k
views
gate20161
compilerdesign
syntaxdirectedtranslation
normal
1
answer
9
Identify whether the problem is classification or Regression.
answer selected
Apr 6, 2016
in
Machine Language

45
views
machinelearning
nongate
1
answer
10
Performance measure P
edited
Apr 6, 2016
in
Machine Language

51
views
machinelearning
0
answers
11
Why aren't CS people scoring high in GATE?
commented
Apr 5, 2016
in
Others

176
views
gate
scoring
2
answers
12
GATE2011GGGA7
In a class of 300 students in an M.Tech programme, each student is required to take at least one subject from the following three: M600: Advanced Engineering Mathematics C600: Computational Methods for Engineers E600: Experimental Techniques for ... maximum possible number of students in the class who have taken all the above three subjects? 20 30 40 50
answer selected
Mar 15, 2016
in
Numerical Ability

164
views
gate2011_gg
numericalability
settheory&algebra
venndiagrams
1
answer
13
Output of c program
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
answer selected
Mar 15, 2016
in
Programming

369
views
programminginc
barc2016
pointers
1
answer
14
Gate_EE_2006
answered
Mar 10, 2016
in
Calculus

141
views
engineeringmathematics
integration
1
answer
15
GATE_2014 ME
Consider a 3 x 3 real symmetric matrix S such that two of its eigen values are a ≠ 0 , b ≠ 0 with respective Eigen vectors [ x1 x2 x3 ] , [ y1 y2 y3 ] . If a ≠ b then x1y1 + x2y2 + x3y3 is a) a b) b c) ab d) 0
answer selected
Mar 8, 2016
in
Linear Algebra

313
views
engineeringmathematics
linearalgebra
eigenvalue
8
answers
16
GATE20161GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically inferred from ... absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)
commented
Mar 7, 2016
in
Verbal Ability

1.9k
views
gate20161
numericalability
logicalreasoning
normal
1
answer
17
Selection of proper domain for masters
comment reshown
Feb 27, 2016
in
IISc/IITs

404
views
areaofinterest
3
answers
18
IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?
commented
Feb 25, 2016
in
Interview Questions

155
views
10
answers
19
GATE 2016139
Let G be a complete undirected graph on 4 vertices, having 6 edges with weights being 1, 2, 3, 4, 5, and 6. The maximum possible weight that a minimum weight spanning tree of G can have is __________
commented
Feb 25, 2016
in
Algorithms

3.8k
views
gate20161
algorithms
spanningtree
normal
numericalanswers
7
answers
20
GATE 2016141
Let $Q$ denote a queue containing sixteen numbers and $S$ be an empty stack. Head(Q) returns the element at the head of the queue $Q$ without removing it from $Q$. Similarly Top (S) returns the element at the top of $S$ without removing ... ); Enqueue (Q, x); end end The maximum possible number of iterations of the while loop in the algorithm is _______.
answer selected
Feb 22, 2016
in
DS

3k
views
gate20161
datastructure
queues
difficult
numericalanswers
1
answer
21
GATE2012CYGA8
The data given in the following table summarizes the monthly budget of an average household. Category Amount (Rs) Food 4000 Clothing 1200 Rent 2000 Savings 1500 Other expenses 1800 The approximate percentage of the monthly budget NOT spent on savings is 10% 14% 81% 86%
commented
Feb 21, 2016
in
Numerical Ability

81
views
gate2012cy
numericalability
percentage
4
answers
22
GATE 2016133
Consider a carry look ahead adder for adding two nbit integers, built using gates of fanin at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
commented
Feb 21, 2016
in
Digital Logic

2.9k
views
gate20161
digitallogic
adder
normal
1
answer
23
GATE2012CYGA1
If (1.001)1259= 3.52 and (1.001)2062= 7.85, then (1.001)3321= 2.23 4.33 11.37 27.64
answered
Feb 21, 2016
in
Numerical Ability

79
views
gate2012cy
numericalability
modulararithmetic
4
answers
24
GATE2016232
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$way set associative cache is ________ bits.
commented
Feb 21, 2016
in
CO & Architecture

2.3k
views
gate20162
co&architecture
cachememory
normal
numericalanswers
3
answers
25
GATE 2016144
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.
commented
Feb 18, 2016
in
Theory of Computation

1.9k
views
gate20161
theoryofcomputation
easy
recursiveandrecursivelyenumerablelanguages
4
answers
26
GATE 2016233
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\tau_1,\tau_2$ and $\tau_3$ such that $\tau_1 =\frac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $GHz$, ignoring delays in the pipeline registers.
answered
Feb 16, 2016
in
CO & Architecture

2.3k
views
gate20162
co&architecture
pipelining
normal
numericalanswers
5
answers
27
GATE 2016203
The minimum number of colours that is sufficient to vertexcolour any planar graph is ________.
answer selected
Feb 14, 2016
in
Graph Theory

1.8k
views
gate20162
graphtheory
graphcoloring
normal
numericalanswers
3
answers
28
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 _________.
answer selected
Feb 14, 2016
in
Algorithms

1.2k
views
gate20162
algorithms
graphalgorithms
normal
numericalanswers
1
answer
29
GATE 2016239
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, ... possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
commented
Feb 14, 2016
in
Algorithms

2.1k
views
gate20162
algorithms
timecomplexity
recurrence
normal
numericalanswers
8
answers
30
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.
commented
Feb 14, 2016
in
CO & Architecture

1.7k
views
gate20162
co&architecture
cachememory
normal
numericalanswers
3
answers
31
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))$
answer selected
Feb 13, 2016
in
Mathematical Logic

2.2k
views
gate20162
mathematicallogic
firstorderlogic
normal
3
answers
32
GATE2016241
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: [v] in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... left(n^{2}\right)$ $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$
commented
Feb 13, 2016
in
Algorithms

1.9k
views
gate20162
algorithms
graphalgorithms
normal
7
answers
33
GATE 2016230
Suppose the functions $F$ and $G$ can be computed in $5$ and $3$ nanoseconds by functional units $U_{F}$ and $U_{G}$, respectively. Given two instances of $U_{F}$ and two instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.
commented
Feb 13, 2016
in
CO & Architecture

2.7k
views
gate20162
co&architecture
datapath
normal
numericalanswers
5
answers
34
GATE1997_3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.
commented
Feb 5, 2016
in
Operating System

1.4k
views
gate1997
operatingsystem
interrupts
normal
2
answers
35
Predict Output
What is the output of folowing C codes . Justify for(i=0;i<10;i++) printf("%d",i>>1); for(i=0;i<10;i++) printf("%d",i&1); for(i=0;i<10;i++) printf("%d",i&&1); ... 1; printf("%d\n", i); OUTPUT 0011223344 0101010101 0111111111 i was trying to make a wrap around question . failed . output 0 2
commented
Feb 4, 2016
in
Programming

187
views
programminginc
2
answers
36
daa
the height of tree is the length of the longest of the longest root to leaf path in it.the max and min no of nodes of height 5 are_________
answer selected
Feb 4, 2016
in
Programming

103
views
1
answer
37
MSTs the graph have?
edited
Feb 4, 2016
in
Programming

61
views
minimumspanningtrees
graphtheory
1
answer
38
check this
answer selected
Feb 4, 2016
in
Programming

53
views
1
answer
39
Maximum number of nodes in binary tree
answer edited
Feb 4, 2016
in
DS

58
views
1
answer
40
functions
1 int main() { int b; b = f(20,30); printf("%d",b); return 0; } int f(int a,int b){ int z; z= a + b; return z; } this program compile fine and o/p is 50 2 int main() { int b; b = f(20,'a'); printf("%d",b); return 0; } int f(int a,char b){ int z; z= a + b; return z; } this give compilation error. I don't know why??Please explain
answer selected
Feb 4, 2016
in
Programming

65
views
programminginc
25,032
questions
32,177
answers
74,989
comments
30,215
users