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 kunal chalotra
User kunal chalotra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User kunal chalotra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Testbook
answer selected
9 hours
ago
in
CO & Architecture

30
views
1
answer
2
Minimum No of states in DFA
No. of states in the DFA accepting the following set of strings are: ( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )* Quite confusing to me. Share your approach!
commented
15 hours
ago
in
Theory of Computation

72
views
theoryofcomputation
minimalstateautomata
dfa
theoryofcomputation_
finiteautomata
1
answer
3
MADE EASY TEST SERIES
Which of the following represents regular language?
commented
15 hours
ago
in
Theory of Computation

29
views
0
answers
4
Ace Pre Gate 2017
All elements of a 2x2 matrix "A" can have values either 0 or 1. The probability that any element gets a value (0 or 1) is 1/2. If all elements of this matrix are chosen at random, what is the probability that the determinant of this matrix is positive?
commented
1 day
ago
in
Probability

363
views
probability
1
answer
5
Theory of computation #Regularexpression #ugcnetjuly2016paper323
answer edited
1 day
ago
in
Theory of Computation

28
views
theoryofcomputation
regularexpressions
for
compliment
of
given
regularlanguage
1
answer
6
Self Doubt  XOR Expression
Is the above statement true ? $(A+B)\oplus C \equiv (A \oplus C) +(B\oplus C)$
answered
1 day
ago
in
Digital Logic

16
views
1
answer
7
self doubt
we know jhonson counter does mod(2N) counting and ring does mod(N) counting with N no. of FF's then can some one tell about ripple counter.....is it mod(2^N)???
answered
1 day
ago
in
Digital Logic

16
views
1
answer
8
Testbook
int x=0; int A(n) { statement //takes O(1) time if(n==1) return 1; else { X+=8A(n/2)+n3 } return X } What is the time complexity f the above code?
commented
2 days
ago
in
Algorithms

106
views
testseries
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
3 days
ago
in
Programming

104
views
2
answers
10
Tree DFS
int func(Node root) { if(root == NULL) return 0; else if(root>left == NULL && root>right == NULL) return 2; else return(3 + func(root>left) + func(root>right)); } Above code is executed on the following rooted tree. What will be the output?
commented
4 days
ago
in
Programming

79
views
dfs
algorithms
datastructure
binarytree
0
answers
11
testbook
what will be differnece if we use c)option and d) option explain ??
asked
4 days
ago
in
DS

35
views
testbook
testseries
datastructure
2
answers
12
made easy
Unix Inode has disk block size 8 KB and maximum file possible with the double indirect is 32 GB. Then the number of bits which represents disk block address is _______ bits.
answer selected
4 days
ago
in
CO & Architecture

49
views
2
answers
13
GATE200431, ISRO200840
Consider the following C function: int f(int n) { static int i = 1; if(n >= 5) return n; n = n+i; i++; return f(n); } The value returned by $f(1)$ is 5 6 7 8
commented
5 days
ago
in
Programming

532
views
gate2004
programming
programminginc
recursion
easy
isro2008
1
answer
14
testbook
commented
6 days
ago
in
Theory of Computation

50
views
testbook
testseries
theoryofcomputation
2
answers
15
testbook
answer selected
6 days
ago
in
Programming

61
views
testbook
testseries
datastructure
dfs
1
answer
16
testbook
commented
6 days
ago
in
Compiler Design

32
views
testbook
testseries
compilerdesign
1
answer
17
testbook
answered
6 days
ago
in
Databases

22
views
1
answer
18
made easy
answered
6 days
ago
in
CO & Architecture

29
views
0
answers
19
testbook
asked
6 days
ago
in
Compiler Design

29
views
testbook
testseries
compilerdesign
0
answers
20
testbook
asked
6 days
ago
in
Compiler Design

24
views
testbook
testseries
compilerdesign
1
answer
21
Poisson Distribution Problem
commented
Jan 10
in
Probability

80
views
0
answers
22
toc check
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
commented
Jan 10
in
Theory of Computation

68
views
theoryofcomputation
0
answers
23
compiler
the need of heap allocation at runtime is a) to support dynamic data structure b)to support dynamic scoping c) to support recursion d) all of the above explain?
asked
Jan 10
in
Compiler Design

16
views
compilerdesign
testseries
0
answers
24
toc cfl or not ?
L={ ai bj ck  i,j,k>=0, i<j<k} CFL OR NOT CFL ??
commented
Jan 10
in
Theory of Computation

42
views
contextfree
normal
theoryofcomputation
cfl
0
answers
25
madeeasy
Consider the following languages. The number of the above languages L1, L2, L3 and L4 are context free languages is ______.
closed
Jan 10
in
Theory of Computation

26
views
1
answer
26
GATE201248
Consider the following C code segment. int a, b, c = 0; void prtFun(void); main() { static int a = 1; /* Line 1 */ prtFun(); a += 1; prtFun(); printf(“ \n %d %d ”, a, b); } void prtFun(void) { static int a = 2; /* Line 2 */ int b = 1; a ... by the given code segment? (A) 3 1 4 1 4 2 (B) 4 2 6 1 6 1 (C) 4 2 6 2 2 0 (D) 3 1 5 2 5 2
commented
Jan 10
in
Programming

451
views
gate2012
programming
programminginc
normal
2
answers
27
NCFL,CFL,PDA
L1={wlwR∣w∈{a,b}∗,l∈{a,b} } which type of language is this DCFL or NDCFL? (note that l∈{a,b} not {a,b}*) I feel its NDCFL can you also tell how PDA will look like?
answered
Jan 10
in
Theory of Computation

57
views
1
answer
28
virtualgate2015
Number of records per block=512/50=10. Number of blocks for 3000 records will be 300. So 2ndary index will have 300 entries and entry size is 15B. So total size of 2ndary index=300*15=4500B. Total records in 1 block=512/15=34. So for 300 entries we have 300/34=9 blocks. Is this the right approch? I am not getting 89. How to solve this then?
commented
Jan 10
in
Databases

30
views
virtualgate
indexing
#dbms#indexes
3
answers
29
Cache memory
Is it compulsory that the block sizes of the main memory and the cache memory are always equal?
answered
Jan 10
in
CO & Architecture

53
views
cachememory
co&architecture
#computerorganisationandarchitecture
memoryinterfacing
5
answers
30
GATE201053
A hash table of length 10 uses open addressing with hash function $h(k) = k \: mod \: 10$, and linear probing. After inserting 6 values into an empty hash table, the table is shown as below 0 1 2 42 3 23 4 34 5 52 6 ... insertion sequences of the key values using the same hash function and linear probing will result in the hash table shown above? 10 20 30 40
commented
Jan 9
in
DS

504
views
datastructure
hashing
difficult
gate2010
0
answers
31
Loop level parallelism
Consider 4 stage instruction pipeline where different instructions are spending different cycles at different stages shown below: The following loop is executed in the pipeline The number of cycles saved using the loop level parallelism over without loop level parallelism to executed the above program is _______ (in cycles).
commented
Jan 9
in
CO & Architecture

29
views
co&architecture
2
answers
32
Languages
commented
Jan 8
in
Theory of Computation

40
views
theoryofcomputation
madeeasy_testseries
2
answers
33
DOUBT
my answer is "B" but the answer is given "C"
commented
Jan 8
in
Theory of Computation

647
views
theoryofcomputation
0
answers
34
Made Easy
Here i+2 means skipping 2 elements na??
commented
Jan 8
in
Algorithms

33
views
madeeasy_testseries
algorithms
1
answer
35
Made Easy
Why S1 is false??
commented
Jan 8
in
Algorithms

37
views
madeeasy_testseries
operatingsystem
2
answers
36
doubt
If L is Turingrecognizable. Then (a) L and ̅L must be decidable. (b) L must be decidable but ̅ L need not be. (c) Either L is decidable or ̅ L is not Turing recognizable. (d) None of above.
answered
Jan 8
in
Theory of Computation

34
views
theoryofcomputation
2
answers
37
doubt
L ⊆ Ʃ*, Ʃ = {a, b} Which of the following is True? (a) L = {x  x has equal a’s and b’s} is regular (b) L = {a^n b^n  n ≥ 1} is regular (c) L = {x  x has more a’s than b’s} is regular (d) L = { a^m b^n, m,n ≥ 1} is regular
answered
Jan 8
in
Theory of Computation

32
views
theoryofcomputation
1
answer
38
Language Problem
If L={ambn  m,n≥1 & gcd(m,n)=1}, then L is Context sensitive Language Contextfree Language Regular Language None of the above
answered
Jan 8
in
Theory of Computation

20
views
1
answer
39
CSL or Not
L1 = {a^p / p is prime} is CSL or not? please give reason for that too and procedure too.
answered
Jan 7
in
Theory of Computation

21
views
4
answers
40
GATE20141_39
The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is ________
comment edited
Jan 7
in
Algorithms

1.7k
views
gate20141
algorithms
numericalanswers
normal
18,898
questions
23,865
answers
51,932
comments
20,186
users