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
0
answers
1
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

35
views
asymptoticnotations
0
answers
2
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

27
views
#computerorganisationandarchitecture
2
answers
3
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
answer selected
Jan 18
in
Calculus

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

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

61
views
summation
aptitude
2
answers
6
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

134
views
programminginc
madeeasy_testseries
1
answer
7
quadratic probing collison loop count??
commented
Jan 17
in
DS

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

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

134
views
algorithms
minimumspanningtrees
1
answer
10
Testbook
commented
Jan 16
in
Graph Theory

253
views
testbook
probability
graphtheory
bst
combinatorics
1
answer
11
testbook
comment edited
Jan 16
in
Databases

55
views
testbook
testseries
databases
candidatekeys
2
answers
12
testbook
retagged
Jan 16
in
Digital Logic

237
views
testbook
testseries
digitallogic
2
answers
13
answer 90 or 444?
asked
Jan 16
in
Combinatory

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

56
views
dbms
b
tree
1
answer
15
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
commented
Jan 12
in
Algorithms

94
views
greedyalgorithm
algorithms
1
answer
16
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

168
views
0
answers
17
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

61
views
propositionallogic
1
answer
18
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

47
views
programminginc
1
answer
19
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

151
views
programminginc
1
answer
20
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

32
views
0
answers
21
LCS problem
asked
Jan 8
in
Algorithms

34
views
4
answers
22
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.7k
views
gate2008
algorithms
graphalgorithms
minimum
spanningtree
normal
0
answers
23
can dfs be used for verifying graph is bipartite or not??
asked
Jan 7
in
Algorithms

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

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

52
views
graphtheory
1
answer
26
how to solve
asked
Jan 6
in
Linear Algebra

51
views
orthogonal
matrix
eigenvector
1
answer
27
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

95
views
algorithms
timecomplexity
1
answer
28
doubt
no of token generated? int main() { int ***p; printf("%d",***p); }
asked
Jan 5
in
Compiler Design

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

34
views
three
address
intermediatecode
0
answers
30
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

171
views
numericalability
2
answers
31
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

117
views
theoryofcomputation
decidability
1
answer
32
virtual gate
commented
Dec 30, 2016
in
Algorithms

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

55
views
virtualgate
testseries
1
answer
34
virtual gate
asked
Dec 30, 2016
in
Algorithms

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

31
views
testseries
virtualgate
primsalgorithm
2
answers
36
virtual gate
asked
Dec 30, 2016
in
Algorithms

80
views
virtualgate
testseries
dynamicprogramming
matrixchainordering
0
answers
37
virtual gate
asked
Dec 30, 2016
in
Algorithms

24
views
virtualgate
testseries
pnpnpcnph
1
answer
38
virtual gate
asked
Dec 30, 2016
in
Algorithms

38
views
virtualgate
testseries
0
answers
39
virtual gate
asked
Dec 30, 2016
in
Algorithms

24
views
virtualgate
testseries
pnpnpcnph
1
answer
40
virtual gate
An algorithm is made up of 2 modules Ml and M2. If order of M1 is f(n) and M2 is g(n) then the order of the algorithm is A) max (f (n) ,g (n)) B) min (f (n) ,g (n) ) C) f (n) + g (n) D) f (n) x g (n )
asked
Dec 30, 2016
in
Algorithms

38
views
virtualgate
testseries
20,906
questions
26,051
answers
59,775
comments
22,189
users