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 Prashant.
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Some Questions on Decidabilty
1) Is it decidable whether a given Turing machine accepts any string at all? That is, is L(M) not equal to ∅? 2) Is it decidable whether a given Turing machine accepts all strings? That is, is L(M) = A*? 3) Is it decidable ... know. Please tell. 2) Is it Completeness Problem? If yes, then its UD. 3) Finiteness Problem and it's UD 4) UD
commented
1 day
ago
in
Theory of Computation

13
views
theoryofcomputation
decidability
turingmachine
1
answer
2
Discrete
Consider the graph G given below. The graph G is (a) planar (b) non planar
commented
3 days
ago
in
Others

31
views
discrete
1
answer
3
Discrete
Find the chromatic number of the graph G below (a) 3 (b) 4 (c) 5 (d) None of the above
commented
3 days
ago
in
Others

19
views
discrete
1
answer
4
Discrete
Find the Chromatic Index of the graph G given below. (a) 3 (b) 4 (c) 2 (d) None of the above
answered
3 days
ago
in
Others

20
views
discrete
1
answer
5
regular
A) L : {a2n ; n>=0} regular or not? B) Let G1 and G2 are CFG's .... L(G1) intersection L(G2) = $\phi$ is decidable or not
commented
3 days
ago
in
Theory of Computation

21
views
1
answer
6
[Programming] What is the output of the following programme ?
commented
5 days
ago
in
Programming

95
views
programminginc
output
pointers
arrays
3
answers
7
GATE 2016136
What will be the output of the following pseudocode when parameters are passed by reference and dynamic scoping is assumed? a = 3; void n(x) { x = x * a; print (x); } void m(y) { a = 1 ; a = y  a; n(a); print (a); } void main () { m(a); } $6,2$ $6,6$ $4,2$ $4,4$
commented
5 days
ago
in
Compiler Design

3.3k
views
gate20161
parameterpassing
normal
2
answers
8
C Programming
What will be output of below program #include<stdio.h> int tech(int,int); int main(void){ int a=tech(15,4); printf("%d",a); return 0; } int tech(int p,int q){ if(p%q==0) return q; else tech(q,p%q); }
commented
5 days
ago
in
Programming

56
views
programminginc
0
answers
9
Random Book
The seek time of a disk is 30 msec. it rotates at rate of 30 rotation per second. Each track has capacity of 300 words. The access time is? (a)47 msec (b) 50 m sec (c) 60 msec (d) 62 msec. A disc drive has roational speed ... is b and c respectively. I am from electrical engieering so i don't know how to solve this. Can anybody answer me these question?
edited
5 days
ago
in
Operating System

26
views
1
answer
10
Self doubt
S > AB  BAB A > SA  ba B > a  $\epsilon$ What are the follow of S, A, B?
commented
5 days
ago
in
Compiler Design

31
views
compilerdesign
follow
1
answer
11
subnet mask ques
Q .how to find subnet mask of 2001.2.64 if 2 bits are chosen from host id for subnetting ? Q . what if question is find subnet mask of 200.1.2.2 ?
commented
6 days
ago
in
Computer Networks

26
views
0
answers
12
test series
If directed broadcast address of a subnet is 220.101.92.31. Which of the following will be subnet mask ? a)255.255.255.224 b)255.255.255.192 c) 255.255.255.198 what will be the answer /? and is this question even valid ? since DBA should have all 1's in the last octet ..
commented
6 days
ago
in
Computer Networks

20
views
1
answer
13
GATEFORUM
for(i=0;i<=n;i++){ for(j=0;j<=i2;j++){ for(k=0;k<=$\frac{n}{2}$;k++){ x=y+z; }}} How many times the x=y+z statement will execute?
commented
6 days
ago
in
Programming

79
views
programminginc
timecomplexity
for
loop
asymptoticnotations
normal
0
answers
14
Algo doubt
Assume f(n) and g(n) are two functions such that f (n)=O(g(n)) which of the following always hold F(n) = O (f(n)2) F(n) = Ω (f(n)2) G(n) = O (f(n)2) G(n) = Ω (g(n))
commented
6 days
ago
in
Algorithms

32
views
0
answers
15
Precedence and Associativity of Logical AND and OR
commented
6 days
ago
in
Programming

52
views
programminginc
booleanoperations
0
answers
16
signed magnitude notation
In a floating point number representation, size of mantissa is 20bit and it is signed magnitude notatioon . Range of mntissa(in explixit normalised ) form is 1. +/ o to (1  220) 2.+/ 0.5 to(1220) 3.+/ o to (1  219) 4.+/ 0.5 to(1219) By +/ i mean it can be +o to (1220) or 0 to (1220)
commented
Oct 14
in
Digital Logic

14
views
0
answers
17
Turing Machine Decidability Question
commented
Oct 14
in
Theory of Computation

47
views
theoryofcomputation
turingmachine
decidability
1
answer
18
up or down counter
commented
Oct 13
in
Digital Logic

47
views
1
answer
19
Computer Networks  Transport Layer  Sequence number wrap around
commented
Oct 13
in
Computer Networks

47
views
computernetworks
tcp
sequencenumber
transportlayer
1
answer
20
Rossen: Permutation and Combination
comment edited
Oct 12
in
Probability

62
views
engineeringmathematics
permutationsandcombinations
permutationsandcombinations
1
answer
21
calculus problem on limits
1) 2) Answer for 1) infinity 2) 1/sqrt(3) please verify
commented
Oct 12
in
Calculus

67
views
engineeringmathematics
calculus
limits
0
answers
22
boys and 4 girls have to sit in a row with all arrangements equally likely
commented
Oct 12
in
Combinatory

22
views
0
answers
23
Estimate the rate of instruction
comment edited
Oct 12
in
CO & Architecture

25
views
2
answers
24
P and C doubt
How many number must be chosen from site {1 2 3 4 5 6 7 8 }such that at least two of them must have sum equal to 9? A.28 B.9 C.5 D.10
answered
Oct 11
in
Combinatory

59
views
2
answers
25
Made easy test series
How L2 is NOT regular and L3 is regular??? please explain
commented
Oct 11
in
Theory of Computation

137
views
4
answers
26
CFL or DCFL?
Let $L = \{a^mb^nb^kd^l (n+k) \text{ is odd only if } m = l; m, n, k, l > 0\}$. Which of the following is true about $L$? $L$ is CFL but not DCFL $L$ is regular but not CFL $L$ is DCFL but not regular None of these
commented
Oct 11
in
Theory of Computation

137
views
contextfreelanguage
identifyclasslanguage
0
answers
27
float and double
int main() { float a =5.2; if(a==5.2) pf("equal"); else if(a<5.2) pf("less than"); else pf("greater than"); }
commented
Oct 10
in
Programming

23
views
3
answers
28
TOC: Number of states in minimum DFA
commented
Oct 10
in
Theory of Computation

106
views
minimalstateautomata
theoryofcomputation
dfa
3
answers
29
Test series
Which of the following is not Context free language? L={(ab)2n b3m│n>0,m>0} L={an bm cn d2n│n≥0,m>0} L={an bm│0≤n≤m≤2n} L={an b2n cm│0≤n≤m}
commented
Oct 10
in
Theory of Computation

42
views
1
answer
30
BINOMIAL DISTRIBUTION
Consider an unbiased cubic dice with opposite faces coloured identically and each face coloured red, blue or green such that each colour appears only two times on the dice. If the dice is thrown thrice, the probability of obtaining red colour on top face of the dice at least twice is I am getting 0.75 can anyone confirm this ?
commented
Oct 6
in
Probability

36
views
probability
binomialtheorem
2
answers
31
Data structure
Ttotal number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having a height of 4 are ??
commented
Oct 3
in
DS

112
views
1
answer
32
Probability
any one can solve?
commented
Oct 3
in
Verbal Ability

83
views
2
answers
33
Practice
All Conflict serializable schedule are also view serializable but reverse is not true . True or False
commented
Sep 30
in
Databases

43
views
databases
view_serializable
0
answers
34
gate overflow
Consider a 2  way set associative cache memory with 4 sets and total 8 cache blocks (0  7) .Main memory has 64 blocks (0  63). If LRU policy is used for replacement and cache is initially empty then total number of conflict cache misses for the following sequence of memory block references is : 0 5 9 13 7 0 15 25 A. 2 B. 3 C. 0 D. 1 Is ans is B?
commented
Sep 29
in
CO & Architecture

24
views
1
answer
35
gate overflow
16kB cache with line size 64B uses 4way set associative mapping. Main memory is 8 MB and byte addressable.The size of extra space needed for storing tag information in bytes is _________ Is ans is 452
commented
Sep 29
in
CO & Architecture

25
views
3
answers
36
GATE20151_55
The least number of temporary variables required to create a threeaddress code in static single assignment form for the expression q + r / 3 + s  t * 5 + u * v/w is__________________.
commented
Sep 29
in
Compiler Design

3.9k
views
gate20151
compilerdesign
intermediatecode
normal
numericalanswers
4
answers
37
GATE200523
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
commented
Sep 29
in
Computer Networks

1.9k
views
gate2005
computernetworks
tcp
udp
easy
0
answers
38
nptel
Which of the following statement is correct ? 1. 2 phase locking protocol does not suffer with problem of cascading rollback 2. Strict 2 phase protocol never results in deadlock 3. In strict 2 phase protocol, restriction of releasing exclusive locks until commit ensures no cascading rollbacks 4. Timestamp ordering protocol can generate nonrecoverable schedules
commented
Sep 29
in
Databases

32
views
databases
nptelquiz
6
answers
39
GATE20151_13
Which one of the following is TRUE at any valid state in shiftreduce parsing? Viable prefixes appear only at the bottom of the stack and not inside Viable prefixes appear only at the top of the stack and not inside The stack contains only a set of viable prefixes The stack never contains viable prefixes
commented
Sep 29
in
Compiler Design

2.1k
views
gate20151
compilerdesign
parsing
normal
viableprefix
1
answer
40
test series
consider a tùring mchine which accepts the empty language i.e TM = { (M)  M accepts empty language} the complement of the language that is generated by Turing machine is?
commented
Sep 29
in
Theory of Computation

25
views
theoryofcomputation
27,421
questions
35,271
answers
84,571
comments
33,506
users