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 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
0
votes
0
answers
1
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
0
votes
1
answer
2
testbook
asked
6 days
ago
in
Theory of Computation

50
views
testbook
testseries
theoryofcomputation
+3
votes
2
answers
3
testbook
asked
6 days
ago
in
Programming

61
views
testbook
testseries
datastructure
dfs
0
votes
1
answer
4
testbook
asked
6 days
ago
in
Compiler Design

32
views
testbook
testseries
compilerdesign
0
votes
0
answers
5
testbook
asked
6 days
ago
in
Compiler Design

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

24
views
testbook
testseries
compilerdesign
+2
votes
0
answers
7
toc check
is it equal?? $(a^{+}b^{+})^*$= $(a^{+}b)^*(ab^{+})^*$
asked
Jan 10
in
Theory of Computation

68
views
theoryofcomputation
0
votes
0
answers
8
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
+1
vote
0
answers
9
toc cfl or not ?
L={ ai bj ck  i,j,k>=0, i<j<k} CFL OR NOT CFL ??
asked
Jan 10
in
Theory of Computation

42
views
contextfree
normal
theoryofcomputation
cfl
+1
vote
0
answers
10
regular lang
let l denote the language denoted by the grammer s> 00T T>11S/11 l=(01) l is regular but not (01) l is CFL but not regular l is not CFL
asked
Jan 4
in
Compiler Design

30
views
#regularlanguage
0
votes
1
answer
11
time complexity
What is the time complexibilty of the following code?Assume "statement" takes O(1) time. int x=0; int A(n) { statement; if (n==1) { return 1; } else { x += 4 A(n/2) + n2; return x; } }
asked
Jan 3
in
Algorithms

47
views
timecomplexity
algorithms
0
votes
1
answer
12
toc explain
D is dfa is L(D) recursive enumerable?? (decidable/undecidable)
asked
Dec 28, 2016
in
Theory of Computation

62
views
theoryofcomputation
+1
vote
1
answer
13
dbms b tree
Suppose the search key of a B tree is V=8 byte long, the disk block size is B=512 bytes, a record(data) pointer is P=6 bytes and a block pointer is l=5 bytes. Calculate the order of the B tree and also is each node of B tree is 69 percent full. Find the ... node of the above B tree. 1. 29,17 2. 27,17 3. 28,18 4. 27,18 my answer is d) option is it plzz check
asked
Dec 26, 2016
in
Databases

63
views
databases
btree
0
votes
1
answer
14
dbms sql
Which of the following query will give name of the employee who is earning maximum salary? 1. Select name from emp where sal=(Select max(sal) from emp); 2. Select name from emp where sal>=all(Select max(sal) from emp); 3. Both a and b are correct queries 4. Both a and b are incorrect queries
asked
Dec 26, 2016
in
Databases

42
views
databases
sql
0
votes
1
answer
15
re and rec
Consider a language L for which there exists a Turing machine that, when presented with any finite input string w over the alphabet, halts and accepts if ω ? L, and halts and rejects otherwise. Which one of the following statements is/are ... enumerable. 2. L is recursively enumerable but not recursive. 3. L is recursively enumerable. 4. None of the above
asked
Dec 22, 2016
in
Theory of Computation

33
views
theoryofcomputation
0
votes
2
answers
16
toc grammer
Consider two grammars G1 and G2 that describe the languages L(G1) and L(G2) respectively over some common alphabet Σ, and let f denote the empty language. The problem Is L(G1) ∩ L(G2) = f ? is decidable for which of the following cases ... G1 and G2 are context free grammars. III. G1 is a regular grammar and G2 is a context free grammar, or viceversa.
asked
Dec 22, 2016
in
Theory of Computation

29
views
theoryofcomputation
+1
vote
1
answer
17
toc dfa
Minimum Number of states required by a DFA to accept the String (a+b) * a(a+b)(a+b) ?
asked
Dec 22, 2016
in
Theory of Computation

33
views
theoryofcomputation
0
votes
1
answer
18
maths solve
asked
Dec 17, 2016
in
Combinatory

46
views
engineeringmathematics
0
votes
1
answer
19
solve cnn
asked
Dec 16, 2016
in
Computer Networks

51
views
computernetworks
0
votes
1
answer
20
computer ntwk
asked
Dec 16, 2016
in
Computer Networks

63
views
computernetworks
+1
vote
1
answer
21
computer netwk
Compute approximate optimal window size when packet size is 53 bytes, the RTT is 60 micro seconds and bottleneck bandwidth is 155 Mbps?
asked
Dec 16, 2016
in
Computer Networks

71
views
computernetworks
0
votes
1
answer
22
cnn doubt
which of the following routing algo allows more duplication of packets A flooding Bselective flooding C link state D.shortest distance routing algo
asked
Dec 13, 2016
in
Computer Networks

69
views
computernetworks
+1
vote
1
answer
23
solve CNN
asked
Dec 13, 2016
in
Computer Networks

75
views
computernetworks
0
votes
1
answer
24
computer network
the maximum window size for data trasmission using selective reject protocol with n bit frame sequence number is ??
asked
Dec 13, 2016
in
Computer Networks

69
views
computernetworks
0
votes
3
answers
25
cobinatory
Caption
asked
Dec 9, 2016
in
Mathematical Logic

88
views
engineeringmathematics
0
votes
0
answers
26
kurose and ross
Consider sending a 2400byte datagram into a link that has an MTU of 700 bytes. Suppose the original datagram is stamped with the identification number 422. How many fragments are generated? What are the values in the various fields in the IP datagram(s) generated related to fragmentation?
asked
Dec 8, 2016
in
Computer Networks

23
views
computernetworks
0
votes
1
answer
27
kurose and ross
Consider a subnet with prefix 128.119.40.128/26. Give an example of one IP address (of form xxx.xxx.xxx.xxx) that can be assigned to this network. Suppose an ISP owns the block of addresses of the form 128.119.40.64/26. Suppose it wants ... each block having the same number of IP addresses. What are the prefixes (of form a.b.c.d/x) for the four subnets?
asked
Dec 8, 2016
in
Computer Networks

43
views
computernetworks
0
votes
0
answers
28
Computer network
no of network possible in class A,B,C ??
asked
Dec 8, 2016
in
Computer Networks

25
views
computernetworks
0
votes
3
answers
29
probability solve
asked
Dec 2, 2016
in
Probability

117
views
probability
+1
vote
1
answer
30
paging os
In a two level paging environment a page table is divided into 2^12 pages each of size 4 KW. The memory is word addressable, The physical address space is 128 MW. Memory is divided into 2^14 frames. Length of the logical address is(in bits) __________
asked
Nov 25, 2016
in
Operating System

94
views
paging
Page:
1
2
3
4
next »
18,898
questions
23,865
answers
51,932
comments
20,186
users