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
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
4
answers
1
GATE199712
Consider a hash table with $n$ buckets, where external (overflow) chaining is used to resolve collisions. The hash function is such that the probability that a key value is hashed to a particular bucket is $\frac{1}{n}$. The hash table is initially empty and ... has occurred in any of the $K$ insertions? What is the probability that the first collision occurs at the $K^{th}$ insertion?
answer edited
Dec 21, 2019
in
DS

2.9k
views
gate1997
datastructures
hashing
probability
normal
3
answers
2
median of two sorted Arrays
commented
Jun 6, 2016
in
Algorithms

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

410
views
linearalgebra
matrices
2
answers
4
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

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

161
views
numericalability
2
answers
6
Binary Number when interpreted as decimal mod 12
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
commented
Apr 21, 2016
in
Theory of Computation

520
views
minimalstateautomata
theoryofcomputation
2
answers
7
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

284
views
asymptoticnotations
recurrence
2
answers
8
least significant digit of 2 ^ (3 * (10 ^ 100) )
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$ 2 4 6 8
asked
Apr 15, 2016
in
Numerical Ability

151
views
numericalability
numericalanswers
1
answer
9
Identify whether the problem is classification or Regression.
answer selected
Apr 6, 2016
in
Machine Language

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

106
views
machinelearning
0
answers
11
Why aren't CS people scoring high in GATE?
Highest mark in GATE CSE 2016: 88, 2015: 85 and in previous years too it is mostly the same. In other branches like ME, EE etc 98, 99 marks are common. What's the reason for this? Difficult/ambiguous questions are for all streams and this won't count for more than 5 marks. Moreover aptitude/mathematics portion are same for all streams.
commented
Apr 5, 2016
in
Others

257
views
general
1
answer
12
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

881
views
programminginc
barc2016
pointers
4
answers
13
GATE2011 GG: GA7
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 Engineers The registration data ... number of students in the class who have taken all the above three subjects? $20$ $30$ $40$ $50$
commented
Mar 15, 2016
in
Numerical Ability

961
views
gate2011gg
numericalability
settheory&algebra
venndiagrams
1
answer
14
Gate_EE_2006
answered
Mar 10, 2016
in
Calculus

589
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

877
views
engineeringmathematics
linearalgebra
eigenvalue
6
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 the above ... players $S$ is the 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

3.3k
views
gate20161
verbalreasoning
normal
1
answer
17
Selection of proper domain for masters
Q. What are the various areas , one can choose in IITs/IISc. for masters ? What is their respective future scope ? When this selection is to be made ?
comment reshown
Feb 27, 2016
in
IISc/IITs

1.4k
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

196
views
15
answers
19
GATE2016139
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

11.5k
views
gate20161
algorithms
spanningtree
normal
numericalanswers
2
answers
20
GATE2012 CY: GA8
The data given in the following table summarizes the monthly budget of an average household. ... $10\%$ $14\%$ $81\%$ $86\%$
commented
Feb 21, 2016
in
Numerical Ability

614
views
gate2012cy
numericalability
percentage
5
answers
21
GATE2016133
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

10.2k
views
gate20161
digitallogic
adder
normal
3
answers
22
GATE2012 CY: GA1
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

553
views
gate2012cy
numericalability
modulararithmetic
3
answers
23
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 and Architecture

6.5k
views
gate20162
coandarchitecture
cachememory
normal
numericalanswers
4
answers
24
GATE2016144
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 the standard manyone ... recursively 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

4.8k
views
gate20161
theoryofcomputation
easy
recursiveandrecursivelyenumerablelanguages
5
answers
25
GATE2016233
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{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 __________ $\text{GHz}$, ignoring delays in the pipeline registers.
answered
Feb 16, 2016
in
CO and Architecture

6.7k
views
gate20162
coandarchitecture
pipelining
normal
numericalanswers
1
answer
26
GATE2016239
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})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
commented
Feb 14, 2016
in
Algorithms

5k
views
gate20162
algorithms
timecomplexity
recurrence
normal
numericalanswers
11
answers
27
GATE2016250
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 the cost of checking ... are 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 and Architecture

5.1k
views
gate20162
coandarchitecture
cachememory
normal
numericalanswers
4
answers
28
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 is a pointer ... list? $\Theta\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

6.3k
views
gate20162
algorithms
graphalgorithms
normal
10
answers
29
GATE2016230
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 the computation $F(G(X_{i}))$ for $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 and Architecture

8.2k
views
gate20162
coandarchitecture
datapath
normal
numericalanswers
5
answers
30
GATE19973.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

4.8k
views
gate1997
operatingsystem
interrupts
normal
2
answers
31
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); for(i=0;i>0;i); ... 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

322
views
programminginc
2
answers
32
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

210
views
1
answer
33
MSTs the graph have?
edited
Feb 4, 2016
in
Programming

103
views
minimumspanningtrees
graphtheory
1
answer
34
check this
answer selected
Feb 4, 2016
in
Programming

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

101
views
1
answer
36
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

94
views
programminginc
1
answer
37
String Swapping
void swap(char **str_1,char **str_2){ char *temp = *str_1; *str_1 = *str_2; *str_2 = temp; } int main(){ char str1[20] = "india"; char str2[20] = "is great"; swap(&str1,&str2); printf("%s",str1); printf("%s", ... } if we replace str1[20] and str2[20] by *str1 and *str2. then string is swapped.but not in this case why?? please explain..
commented
Feb 4, 2016
in
Programming

98
views
programminginc
3
answers
38
In a m*n order Matrix, How many submatrices are possible?
In a m*n order Matrix, How many submatrices are possible?
answered
Feb 4, 2016
in
Linear Algebra

4.2k
views
5
answers
39
linearalgebra
if $A = \begin{bmatrix} 2 &3 &4 \\ 3 & 1 &2 \\ 1& 4 & 5 \end{bmatrix}$ then rank of the matrix $(AA^T)$ is _____ (A) $1$ (B) $2$ (C) $3$ (D) $0$
commented
Feb 4, 2016
in
Linear Algebra

233
views
matrices
linearalgebra
1
answer
40
combinations
A, B are two 8bit numbers such that A+B < 2^8. The number of possible combinations of A and B are
commented
Feb 3, 2016
in
Combinatory

416
views
50,741
questions
57,233
answers
197,994
comments
104,580
users