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 firki lama
User firki lama
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User firki lama
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
kenneith rosen
At least how many numbers should be selected from the set {1, 5, 9, 13, …125} to be assured that two of the numbers selected have a sum of 146?
commented
Apr 13
in
Set Theory & Algebra

94
views
kennethrosen
discretemathematics
1
answer
2
proof
1) Show that when all elements are distinct, the best case running time of HEAPSORT is Ω(n log n). 2) Show that the worst case running time of HEAPSORT is Ω(n log n).
asked
Apr 13
in
Algorithms

65
views
heapsort
2
answers
3
ISRO 2007 ECE Probability
A bag contains eight white and six red marbles. The probability of drawing two marbles of same colour is a) 8c2 .6c2 / 14c2 b) 8c2 /14c2 + 6c2 /14c2 c) 8c2.6c2 /14c2.14c2 d)8c2 /14c2 + 6c2 /12c2
commented
Mar 4
in
Probability

72
views
isro
isroece
0
answers
4
linear equation
Consider the system of linear equations w+3x+2y+2z = 0 w+4x+y = 0 3w+5x+10y+14z = 0 2w+5x+5y+6z = 0 with solutions of the form (w, x, y, z ) , where w, x, y, and z are real. Which of the following statements is FALSE? (A) The system has ... a solution. (C) ( 5, 1, 1, 0 ) is a solution. (D) Every solution is a scalar multiple of ( 5, 1, 1, 0 )
asked
Mar 1
in
Linear Algebra

30
views
linearalgebra
engineeringmathematics
0
answers
5
differentiable
The function is defined as follows. Which of the following is true? (A) f is discontinuous at all (B) f is continuous only at x = 0 and differentiable only at x = 0. (C) f is continuous only at x=0 and non differentiable at all (D) f is continuous at all and non differentiable at all
asked
Mar 1
in
Calculus

44
views
differentiability
continuity
calculus
0
answers
6
which has higher growth rate?
Which grows faster when n increases? $I. n^{\frac{1}{3}}<\frac{n}{logn} II. n^{\frac{1}{3}}>\frac{n}{logn}$
commented
Jan 19
in
Algorithms

42
views
asymptoticnotations
0
answers
7
doubt
A computer has a cache, main memory, and a disk used for virtual memory. An access to the cache takes 10 ns. An access to main memory takes 100 ns. An access to the disk takes 10,000 ns. Suppose the cache hit ratio is 0.9 and the main memory hit ratio is 0.8. The effective access time (EAT) required to access a referenced word on this system is ______________ ns.
asked
Jan 19
in
CO & Architecture

42
views
co&architecture
2
answers
8
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
answer selected
Jan 18
in
Calculus

84
views
calculus
integration
1
answer
9
mean no of transmission?? 13 or 200
commented
Jan 18
in
Computer Networks

66
views
computernetworks
0
answers
10
summation series
what is the summation of this series? S=nC0*20+nC1*21+nC2*22+..............nCn*2n
commented
Jan 17
in
Combinatory

70
views
summation
2
answers
11
ouput of program
Consider the following program: void find(struct Node *node) { struct Node *ptr,*q; q = (struct Node *)malloc(sizeof(struct Node)); q>left = NULL; q>right = NULL; if(node == NULL) return; find(nod>left); find( ... passed to the above function, by main function the sum of all the keys in the resultant tree produced by find() is given by___?
answer selected
Jan 17
in
Programming

150
views
programminginc
madeeasytestseries
1
answer
12
quadratic probing collison loop count??
commented
Jan 17
in
DS

99
views
hashing
datastructure
2
answers
13
What is the expected length of the cycle containing vertex 1?
commented
Jan 16
in
Graph Theory

270
views
expectation
graphtheory
engineeringmathematics
1
answer
14
maximum weight of minimum spanning tree??
comment edited
Jan 16
in
Algorithms

192
views
algorithms
minimumspanningtrees
1
answer
15
Testbook
commented
Jan 16
in
Graph Theory

276
views
testbooktestseries
probability
graphtheory
bst
combinatory
1
answer
16
testbook
comment edited
Jan 16
in
Databases

67
views
testbooktestseries
testseries
databases
candidatekeys
2
answers
17
testbook
asked
Jan 16
in
Digital Logic

245
views
testbooktestseries
testseries
digitallogic
2
answers
18
answer 90 or 444?
asked
Jan 16
in
Combinatory

161
views
counting
orderedpartition
1
answer
19
order of leaf node in b+ tree??
asked
Jan 15
in
Databases

105
views
dbms
btree
tree
3
answers
20
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
commented
Jan 12
in
Algorithms

393
views
greedyalgorithm
algorithms
1
answer
21
static and dynamic scoping
int a=0,b=0; int main(void) { int a=3; printf("%d%d",a,b); c(); printf("%d%d",a,b); return 0; } void c() { printf("%d%d",a,b); a=4,b=5; printf("%d%d",a,b); d(); printf("%d%d",a,b); ... ; printf("%d%d",a,b); } void e(int b,int a) { printf(a,b); a=7;b=8; printf("%d%d",a,b); }
commented
Jan 9
in
Programming

231
views
0
answers
22
propostion logic
Are these correct representation in Propositional logic?? I. Somebody,Someone,Anybody,Anyone=========Ǝx II. Everybody,Everyone======∀x
edited
Jan 9
in
Mathematical Logic

68
views
propositionallogic
1
answer
23
output of program
#include <stdio.h> int main(void) { void *vp; char ch='g'; char *cp="goofy"; int j=20; vp=&ch; printf("%c",*(char *)vp); vp=&j; printf("%d",*(int *)vp); vp=cp; printf("%c",(char *)vp+3); return 0; }
asked
Jan 9
in
Programming

87
views
programminginc
1
answer
24
why output is 300?
#include <stdio.h> int main(void) { int i; char *p=(char *)&i; ++p; (*p)=2; printf("%d",i); return 0; }
asked
Jan 9
in
Programming

165
views
programminginc
1
answer
25
why ouput 31??
#include <stdio.h> int f(int); int main(void) { int n=7; printf("%d",f(n)); return 0; } f(int n) { int r; if(n<=0) return(1); if(n>3) { r=n; return(f(n3)+15); } return (f(n1)+r); }
asked
Jan 9
in
Operating System

35
views
1
answer
26
LCS problem
asked
Jan 8
in
Algorithms

44
views
4
answers
27
GATE200842
$G$ is a graph on $n$ vertices and $2n2$ edges. The edges of $G$ can be partitioned into two edgedisjoint spanning trees. Which of the following is NOT true for $G$? For every subset of $k$ vertices, the induced subgraph has ... 2 edgedisjoint paths between every pair of vertices. There are at least 2 vertexdisjoint paths between every pair of vertices.
commented
Jan 8
in
Algorithms

1.9k
views
gate2008
algorithms
graphalgorithms
minimum
spanningtree
normal
0
answers
28
can dfs be used for verifying graph is bipartite or not??
asked
Jan 7
in
Algorithms

47
views
1
answer
29
what is the Time complexity of given code?
edited
Jan 7
in
Algorithms

61
views
timecomplexity
algorithms
1
answer
30
if graph is loop free then how can it have cycle
asked
Jan 6
in
Graph Theory

75
views
graphtheory
1
answer
31
how to solve
asked
Jan 6
in
Linear Algebra

54
views
orthogonal
matrix
eigenvalue
1
answer
32
sorted array in dijkstra
What is the time complexity to implement Dijkstra's algorithm using a sorted array instead of heap for a Priority Queue? for sorted array let V be the number of nodes and E be the number of edges 1)extract min operation it will take ... be sorted..so it will take VlogV time if we use merge sort.so ,total time is E*VLOGV please verify this.
commented
Jan 6
in
Algorithms

143
views
algorithms
timecomplexity
3
answers
33
doubt
No of token generated? int main() { int ***p; printf("%d",***p); }
asked
Jan 5
in
Compiler Design

232
views
lexicalanalysis
1
answer
34
doubt
why x=a[i][j] and x=f(a,b) are not three address code..
answer selected
Jan 5
in
Compiler Design

46
views
intermediatecode
threeaddresscode
compilerdesign
0
answers
35
gate 2011
The fuel consumed by a motorcycle during a journey while traveling at various speeds is indicated in the graph below. The distances covered during four laps of the journey are listed in the table below Lap Distance (kilometers) Average speed (kilometers per hour) P ... that the fuel consumed per kilometer was least during the lap (A) P (B) Q (C) R (D) S
edited
Jan 3
in
Numerical Ability

219
views
numericalability
2
answers
36
REVERSE = { M  M is a TM with the property: for all w, M(w) accepts iff M(wR) accepts}.
commented
Jan 2
in
Theory of Computation

132
views
theoryofcomputation
decidability
1
answer
37
virtual gate
commented
Dec 30, 2016
in
Algorithms

56
views
virtualgate
testseries
job
scheduling
1
answer
38
virtual gate
asked
Dec 30, 2016
in
Algorithms

58
views
virtualgate
testseries
1
answer
39
virtual gate
asked
Dec 30, 2016
in
Algorithms

77
views
virtualgate
testseries
huffmancode
0
answers
40
virtual gate
both B and C correct order of prims algo?
asked
Dec 30, 2016
in
Algorithms

36
views
testseries
virtualgate
primsalgorithm
23,355
questions
30,065
answers
67,365
comments
28,382
users