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
2
answers
1
time complexity
what the time complexity for T(n)=5T(n/2)+n^2 a. n b.n^2
answered
5 days
ago
in
Algorithms

61
views
timecomplexity
1
answer
2
recursion
commented
Jul 15
in
Programming

65
views
recursion
programminginc
0
answers
3
probability
a lot consists of 12 good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
commented
Jul 14
in
Probability

83
views
probability
engineeringmathematics
eamcet
0
answers
4
probability
a lot consists of good pencils, 6 with minor defects and 2 with major defects. A pencil is chosen at random. The probability that this pencil is not defective is?
asked
Jul 14
in
Probability

16
views
probability
engineeringmathematics
eamcet
1
answer
5
probability
India plays two matches each with West Indies and Srilanka. In any match the probabilities of India getting points 0,1 and 2 are 0.45,0.05 and 0.50 respectively. Assuming that the outcomes are independent, the probability of India getting at least 7 points is? a) 0.8750 b) 0.0875 c) 0.0625 d) 0.0250
commented
Jul 11
in
Probability

86
views
probability
engineeringmathematics
1
answer
6
theory of computation
commented
May 6
in
Theory of Computation

60
views
theoryofcomputation
grammar
2
answers
7
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

67
views
normal
forms
1
answer
8
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

25
views
theoryofcomputation
3
answers
9
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

125
views
4
answers
10
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

85
views
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
4
answers
11
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

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

95
views
theoryofcomputation
turingmachine
1
answer
13
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

45
views
theoryofcomputation
1
answer
14
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

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

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

67
views
cns
networksecurity
1
answer
17
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

84
views
0
answers
18
peterlinz
asked
Apr 1
in
Theory of Computation

19
views
3
answers
19
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

91
views
theoryofcomputation
deterministiccontextfreegrammars
contextfreelanguage
1
answer
20
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

62
views
cfg
contextfreelanguage
theoryofcomputation
1
answer
21
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

72
views
probability
1
answer
22
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

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

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

137
views
isro2015ece
isro
1
answer
25
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

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

174
views
theoryofcomputation
1
answer
27
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

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

249
views
theoryofcomputation
1
answer
29
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

71
views
limits
calculus
1
answer
30
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

85
views
1
answer
31
Indexing and Physical DB design
answer selected
Nov 6, 2016
in
Databases

51
views
1
answer
32
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
33
Transaction and concurrency control
commented
Nov 1, 2016
in
Databases

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

87
views
0
answers
35
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
36
self join
can somebody explain me about self join with example?.
answer selected
Oct 21, 2016
in
Databases

72
views
0
answers
37
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
38
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

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

49
views
3
answers
40
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

917
views
gate2010
databases
normal
24,141
questions
31,143
answers
70,892
comments
29,467
users