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 Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
theory of computation
commented
May 6
in
Theory of Computation

48
views
theoryofcomputation
toc
grammar
2
answers
2
normal forms
why there is need of normal forms in the context free grammer ????????????????? elaborate with example plz.
commented
May 6
in
Theory of Computation

45
views
normal
forms
1
answer
3
Doubt
Is it possible to prove number of b's=2k+1 and any number of a's is regular using Myhill–Nerode theorem ?
answered
May 6
in
Theory of Computation

20
views
theoryofcomputation
3
answers
4
Finite state Machine
which of the following statement is True? a) r* and r+ are always different. b) r* and r+ may be equal. Please explain briefly.
commented
May 6
in
Theory of Computation

116
views
4
answers
5
Recursive languages.
If L1 is Recursive language and L2 is RE. Then L1 ⋂ L2 is RE? Since every Recursive language is RE, then how intersection of the Recursive and RE is RE?
commented
May 6
in
Theory of Computation

64
views
toc
theoryofcomputation
recursiverecursivelyenumerable
4
answers
6
Finit Automata
The possible number of prefixes for the given 'n' length string is (assume all symbols in the given string are different) a) n b) n+1 c) n+2 d) n1 please explain.
commented
May 6
in
Theory of Computation

55
views
1
answer
7
Turing machine
Design a turing machine that accept the language of odd integer written in binary
asked
Apr 17
in
Theory of Computation

66
views
theoryofcomputation
turingmachine
1
answer
8
Self doubt toc
Construct a grammar for L={a^nb^n/m, n greater then equal to 0,m doesn't equal to n}
commented
Apr 17
in
Theory of Computation

40
views
theoryofcomputation
1
answer
9
Ethernet
IF the propagation delay csma/cd network is 750 bit times then what is the slot if the jamming signal is 50 bits?
asked
Apr 4
in
Computer Networks

25
views
ethernet
computernetworks
1
answer
10
RSA(self doubt)
answer selected
Apr 3
in
Computer Networks

33
views
computer
networking
0
answers
11
Self doubt(Computer network security)
commented
Apr 2
in
Computer Networks

59
views
cns
networksecurity
1
answer
12
Regular expression
The set of all strings with at most one pair of consecutive zeros and one pair of consecutive ones.
asked
Apr 1
in
Theory of Computation

67
views
0
answers
13
peterlinz
asked
Apr 1
in
Theory of Computation

17
views
3
answers
14
Peter Linz Exercise 7.3
#3 : Is the language L= { anbn : n>=1 } U {b} deterministic ? #4 : Is the language L={anbn : n>=1} U {a} deterministic ? #7 Is the following regular language deterministic? L= { anbmck : n=m or m=k } #8 Is ... WR has started. #11 No Idea about it. Please someone verify and tell me is my way of analysis and the analysis is correct or not?
commented
Mar 31
in
Theory of Computation

76
views
theoryofcomputation
deterministiccontextfreegrammars
contextfree
1
answer
15
context free grammar
Construct contextfree grammars to accept the following languages. $$\begin{align*} \large L = \left \{ 0^i1^j2^k \;\;  \;\; i \neq j \;\; or \;\; j \neq k \right \} \end{align*}$$
commented
Mar 26
in
Theory of Computation

44
views
cfg
contextfree
theoryofcomputation
1
answer
16
Probability
The probability that a student knows the correct answer to a multiple choice question is 2/3. If the student doesn't know the answer then the student guess the answer. The probability of the guess answer is being correct is 1/4.given that student has answer the questions correctly, the conditional probability that the student knows the correct answer is
asked
Mar 2
in
Mathematical Logic

52
views
probability
1
answer
17
Design a dfa
Construct a dfa which accept all strings which when interpreted is a multiple of 5
asked
Feb 27
in
Theory of Computation

35
views
theoryofcomputation
2
answers
18
Design a dfa
Design a dfa which check whether the given no is even or not?
commented
Feb 27
in
Theory of Computation

38
views
theoryofcomputation
2
answers
19
ISRO 2015EC Finte State Machine
commented
Feb 23
in
Theory of Computation

134
views
isro2015ece
isro
1
answer
20
Peter linz
L1={a^nb^m, n=>4,m<=3 L1=(aa)*(bb)*+a(aa)*b(bb)* Find L1 complement?
commented
Feb 19
in
Theory of Computation

63
views
2
answers
21
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
commented
Feb 19
in
Theory of Computation

131
views
theoryofcomputation
1
answer
22
Toc self doubt
Design NDFA over {0,1} in which two 0s are separated by a string of length 2i, for i>0 and convert it into equivalent dfa?
asked
Feb 19
in
Theory of Computation

60
views
theoryofcomputation
1
answer
23
Grammar
Construct a grammar which generate even integer upto 998?
commented
Feb 19
in
Theory of Computation

184
views
theoryofcomputation
1
answer
24
gate 2010
What is the value of Limn>∞(11/n)2n ? (A) 0 (B) e2 (C) e1/2 (D) 1
answer selected
Feb 13
in
Mathematical Logic

65
views
limits
calculus
1
answer
25
memory management
If the no of pages in a 32 bit machine is 8kB then what is the size of the page table? a. 8kb b. 16kB c. 4 KB d. Cant say
commented
Dec 14, 2016
in
Operating System

81
views
1
answer
26
Indexing and Physical DB design
answer selected
Nov 6, 2016
in
Databases

51
views
1
answer
27
transaction
S:R1(x),w1(x),R2(x),R1(y),w2(x),C2,A1 why it is violating Ti>Tj condition?
commented
Nov 1, 2016
in
Databases

59
views
2
answers
28
Transaction and concurrency control
commented
Nov 1, 2016
in
Databases

172
views
1
answer
29
Transaction and concurrency
• T1:W(X), T2:R(Y), T1:R(Y), T2:R(X) is it recoverable?
commented
Oct 30, 2016
in
Databases

81
views
0
answers
30
relational algebra
Express in relational algebra supplier (SNO, SNAME) part (PNO, PNAME) project(JNO, JNAME) SUPPLY(SNO, PNO,JN0) a) Retrieve the parts no that are supplied to exactly two project?
asked
Oct 24, 2016
in
Databases

37
views
1
answer
31
self join
can somebody explain me about self join with example?.
answer selected
Oct 21, 2016
in
Databases

65
views
0
answers
32
relationalalgebra
Let R = (A, B) and S = (A, C), and let r(R) and s(S) be relations. Write relationalalgebra expressions equivalent to the following domainrelationalcalculus expressions {< a >  ∃ c (< a,c > ∈ s ∧ ∃ b1, b2 (< a,b1> ∈ r ∧ < c,b2>∈ r ∧ b1 > b2))}
asked
Oct 19, 2016
in
Databases

18
views
1
answer
33
normalisation
Suppose you are given a relation R with four attributes ABCD. For each of the following sets of FDs, assuming those are the only dependencies that hold for R, do the following: If R is not in BCNF, decompose it into a set of BCNF relations that preserve the dependencies. AB → C, AB → D, C → A, D → B
commented
Oct 13, 2016
in
Databases

134
views
1
answer
34
normalisation
can someone explain me dependency preserving by taking example?
asked
Oct 13, 2016
in
Databases

49
views
3
answers
35
GATE201043
The following functional dependencies hold for relations $R(A, B, C)$ and $S(B, D, E).$ $ B \to A$ $A \to C$ The relation $R$ contains 200 tuples and the relation $S$ contains 100 tuples. What is the maximum number of tuples possible in the natural join $R \bowtie S$? 100 200 300 2000
commented
Oct 12, 2016
in
Databases

842
views
gate2010
databases
normal
2
answers
36
DataBase
R(A,B,C,D,E) is a relation with candidate keys AB BC CD.Find the total number of super keys possible?
commented
Oct 12, 2016
in
Databases

81
views
3
answers
37
dbms
Consider the relation schema R(A,B,C), which has the FD B → C. If A is a candidate key for R, is it possible for R to be in BCNF? If so, under what conditions? If not, explain why not.
commented
Oct 12, 2016
in
Databases

88
views
0
answers
38
morris mano
How can i find the delay of 4 bit adder? plz explain
reshown
Oct 11, 2016
in
Digital Logic

31
views
2
answers
39
3NF
Consider a relation R with five attributes ABCDE. You are given the following dependencies: A → B, BC → E, and ED → A. 1. List all keys for R. 2. Is R in 3NF? 3. Is R in BCNF?
answer selected
Oct 10, 2016
in
Databases

191
views
0
answers
40
Morris mano
How i can I find the delay of 4 bit adder?
asked
Oct 8, 2016
in
Digital Logic

38
views
22,896
questions
29,206
answers
65,329
comments
27,708
users