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
1
answer
1
What is the expected length of the cycle containing vertex 1?
commented
54 minutes
ago
in
Graph Theory

52
views
expectation
graphtheory
engineeringmathematics
1
answer
2
maximum weight of minimum spanning tree??
comment edited
1 hour
ago
in
Algorithms

75
views
algorithms
minimumspanningtrees
1
answer
3
Testbook
commented
3 hours
ago
in
Graph Theory

128
views
testbook
probability
graphtheory
bst
combinatorics
2
answers
4
answer 90 or 444?
answer selected
4 hours
ago
in
Combinatory

64
views
counting
orderedpartition
1
answer
5
testbook
comment edited
6 hours
ago
in
Databases

34
views
testbook
testseries
databases
candidatekeys
2
answers
6
testbook
retagged
10 hours
ago
in
Digital Logic

136
views
testbook
testseries
digitallogic
1
answer
7
order of leaf node in b+ tree??
asked
2 days
ago
in
Databases

26
views
dbms
b
tree
1
answer
8
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
commented
4 days
ago
in
Algorithms

47
views
greedyalgorithm
algorithms
1
answer
9
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

99
views
0
answers
10
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

41
views
propositionallogic
1
answer
11
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

28
views
programminginc
1
answer
12
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

113
views
programminginc
1
answer
13
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

30
views
0
answers
14
LCS problem
asked
Jan 8
in
Algorithms

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

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

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

39
views
graphtheory
1
answer
19
how to solve
asked
Jan 6
in
Linear Algebra

37
views
orthogonal
matrix
eigenvector
1
answer
20
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

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

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

24
views
three
address
intermediatecode
0
answers
23
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

68
views
aptitude
gate2011
2
answers
24
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

97
views
theoryofcomputation
decidability
1
answer
25
virtual gate
commented
Dec 30, 2016
in
Algorithms

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

51
views
virtualgate
testseries
1
answer
27
virtual gate
asked
Dec 30, 2016
in
Algorithms

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

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

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

23
views
virtualgate
testseries
pnpnpcnph
1
answer
31
virtual gate
asked
Dec 30, 2016
in
Algorithms

33
views
virtualgate
testseries
0
answers
32
virtual gate
asked
Dec 30, 2016
in
Algorithms

24
views
virtualgate
testseries
pnpnpcnph
1
answer
33
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

29
views
virtualgate
testseries
4
answers
34
GATE200447
Consider a system with a twolevel paging scheme in which a regular memory access takes 150 nanoseconds, and servicing a page fault takes 8 milliseconds. An average instruction takes 100 nanoseconds of CPU time, ... 000 instructions. What is the effective average instruction execution time? 645 nanoseconds 1050 nanoseconds 1215 nanoseconds 1230 nanoseconds
commented
Dec 29, 2016
in
CO & Architecture

4.2k
views
gate2004
co&architecture
virtualmemory
normal
1
answer
35
TIFR2016A13
Let $n \geq 2$ be any integer. Which of the following statements is not necessarily true? $\begin{pmatrix} n \\ i \end{pmatrix} = \begin{pmatrix} n1 \\ i \end{pmatrix} + \begin{pmatrix} n1 \\ i1 \end{pmatrix}, \text{ where } 1 \leq i \leq n1$ $n!$ ... }$, for all $ i \in \{1, 2, \dots , n1\}$ If $n$ is an odd prime, then $n$ divides $2^{n1} 1$
comment edited
Dec 28, 2016
in
Others

57
views
tifr2016
0
answers
36
virtual gate
If we take out two Aces from a standard deck of 52 cards. How many ways are there to select three more cards from the remaining 50, in such a way that the five cards together form a full house (3 of one kind, 2 of another)?
commented
Dec 28, 2016
in
Probability

29
views
0
answers
37
virtual gate
True/false I. Every cascading rollback schedule is recoverable schedule.
asked
Dec 27, 2016
in
Databases

30
views
virtualgate
testseries
0
answers
38
virtual gate
asked
Dec 27, 2016
in
Calculus

17
views
virtualgate
testseries
18,813
questions
23,785
answers
51,449
comments
20,130
users