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.
Questions 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
votes
0
answers
1
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

8
views
linearalgebra
engineeringmathematics
+1
vote
0
answers
2
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

22
views
differentiability
continuity
calculus
0
votes
0
answers
3
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

37
views
#computerorganisationandarchitecture
0
votes
0
answers
4
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}$
asked
Jan 18
in
Algorithms

37
views
asymptoticnotations
0
votes
2
answers
5
Integration
what is the integration of this funcion? f(x)=1−x where −1≤x≤1
asked
Jan 18
in
Calculus

79
views
calculus
integration
0
votes
1
answer
6
mean no of transmission?? 13 or 200
asked
Jan 18
in
Computer Networks

63
views
computernetworks
+1
vote
0
answers
7
summation series
what is the summation of this series? S=nC0*20+nC1*21+nC2*22+..............nCn*2n
asked
Jan 17
in
Combinatory

65
views
summation
aptitude
+2
votes
2
answers
8
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___?
asked
Jan 17
in
Programming

145
views
programminginc
madeeasy_testseries
+2
votes
1
answer
9
quadratic probing collison loop count??
asked
Jan 17
in
DS

90
views
hashing
datastructure
+7
votes
1
answer
10
maximum weight of minimum spanning tree??
asked
Jan 16
in
Algorithms

147
views
algorithms
minimumspanningtrees
0
votes
1
answer
11
testbook
asked
Jan 16
in
Databases

62
views
testbook
testseries
databases
candidatekeys
0
votes
2
answers
12
testbook
asked
Jan 16
in
Digital Logic

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

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

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

137
views
greedyalgorithm
algorithms
0
votes
0
answers
16
propostion logic
Are these correct representation in Propositional logic?? I. Somebody,Someone,Anybody,Anyone=========Ǝx II. Everybody,Everyone======∀x
asked
Jan 9
in
Mathematical Logic

63
views
propositionallogic
0
votes
1
answer
17
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

58
views
programminginc
+1
vote
1
answer
18
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

157
views
programminginc
0
votes
1
answer
19
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

33
views
+1
vote
1
answer
20
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); }
asked
Jan 9
in
Programming

181
views
0
votes
0
answers
21
LCS problem
asked
Jan 8
in
Algorithms

38
views
+2
votes
0
answers
22
can dfs be used for verifying graph is bipartite or not??
asked
Jan 7
in
Algorithms

46
views
0
votes
1
answer
23
what is the Time complexity of given code?
asked
Jan 7
in
Algorithms

53
views
timecomplexity
algorithms
+1
vote
1
answer
24
if graph is loop free then how can it have cycle
asked
Jan 6
in
Graph Theory

56
views
graphtheory
+1
vote
1
answer
25
how to solve
asked
Jan 6
in
Linear Algebra

53
views
orthogonal
matrix
eigenvector
0
votes
2
answers
26
doubt
no of token generated? int main() { int ***p; printf("%d",***p); }
asked
Jan 5
in
Compiler Design

142
views
lexicalanalysis
0
votes
1
answer
27
doubt
why x=a[i][j] and x=f(a,b) are not three address code..
asked
Jan 5
in
Compiler Design

37
views
three
address
intermediatecode
+1
vote
0
answers
28
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
asked
Jan 2
in
Numerical Ability

182
views
numericalability
0
votes
1
answer
29
virtual gate
asked
Dec 30, 2016
in
Algorithms

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

55
views
virtualgate
testseries
job
scheduling
Page:
1
2
next »
21,545
questions
26,881
answers
61,232
comments
23,243
users