Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by sripo
1
votes
1
answer
61
Grammar to DFA Construction
For the given Grammar S->aA|bB A->bC|aS B->aC|bS C->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
For the given GrammarS->aA|bBA->bC|aSB->aC|bSC->aB|bA Construct DFA I am getting confused in understanding how to take the final state.
1.3k
views
asked
Oct 13, 2018
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
number-of-dfa
minimal-state-automata
+
–
0
votes
1
answer
62
Automata for given Regular Expression
Can you please draw the DFA for given regex (ab*)*
Can you please draw the DFA for given regex (ab*)*
682
views
asked
Oct 10, 2018
Theory of Computation
theory-of-computation
regular-expression
finite-automata
regular-language
expression
+
–
0
votes
0
answers
63
Equivalence of regular expressions
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it just worked for this case?
For $\sum$={a,b} Re given is b*ab*(aa)*b* this is non minimized dfa but when the dfa is minimized we get RE as b*a(a+b)*. How to show that are they equivalent or is it ju...
668
views
asked
Oct 10, 2018
Theory of Computation
regular-expression
theory-of-computation
regular-language
finite-automata
+
–
1
votes
1
answer
64
Example of a countable set which is infinite
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
I wanted an example of a set which is infinite and countable. Is hair on human head an example of countable set being infinite?
615
views
asked
Oct 6, 2018
Set Theory & Algebra
set-theory&algebra
discrete-mathematics
+
–
1
votes
2
answers
65
Is the given relation transitive
For given R={(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)} Is the given relation transitive?
For given R={(1,1),(2,2),(3,3),(4,4),(1,2),(2,1),(3,4),(4,3)}Is the given relation transitive?
386
views
asked
Oct 6, 2018
Set Theory & Algebra
relations
set-theory&algebra
+
–
0
votes
0
answers
66
Gate Overflow Book Font Size
I have already purchased the Gate Overflow 3 volume books.I find the font size very small and want to exchange is it possible?My eyes hurt the font size is less than 12 in the edition which I have got.
I have already purchased the Gate Overflow 3 volume books.I find the font size very small and want to exchange is it possible?My eyes hurt the font size is less than 12 i...
219
views
asked
Oct 2, 2018
Study Resources
gateoverbook
arjun-suresh
+
–
0
votes
0
answers
67
Can Null Graph be a valid Matching
Definition of valid matching says that if every vertex is incident with atmost one vertex then it is a matching but I have seen coaching material note which includes null graph as a matching.I am confused please help.
Definition of valid matching says that if every vertex is incident with atmost one vertex then it is a matching but I have seen coaching material note which includes null...
375
views
asked
Sep 28, 2018
Graph Theory
graph-theory
discrete-mathematics
+
–
0
votes
0
answers
68
Is K2,4 planar graph
Is K 2,4 planar graph if yes can you please draw it?
Is K 2,4 planar graph if yes can you please draw it?
2.4k
views
asked
Sep 27, 2018
0
votes
0
answers
69
Is Neso Academy Youtube Videos Cover full syllabus required for GATE Cse
I have never studied this subject in my BTech,just learnt number system and passed the exam.I don't know what is all there is sequential and combinational circuits but the playlist is of 203 videos is it ... solving GATE questions after going through the videos. I have seen a lot of GATE toppers suggesting the channel.
I have never studied this subject in my BTech,just learnt number system and passed the exam.I don't know what is all there is sequential and combinational circuits but th...
1.9k
views
asked
Sep 14, 2018
GATE
digital-logic
+
–
3
votes
1
answer
70
Project Euler Problem 1
What is the Time and Space Complexity of Both the Codes ? Are both O(1)? If so why? And then how is the second more efficient? Below is the code in Brute Force for(i=0;i<1000;i++) { if(i%3==0 || i%5==0) { sum+=i; } } This is Using Summation int P1(int n) { int t,x,f; t=(n-1)/3; x=(n-1)/5; f=(n-1)/15; return((3*t*(t+1)/2) + (5*x*(x+1)/2) - (15*f*(f+1)/2)); }
What is the Time and Space Complexity of Both the Codes ? Are both O(1)? If so why? And then how is the second more efficient?Below is the code in Brute Forcefor(i=0;i<10...
451
views
asked
Jan 28, 2017
Algorithms
algorithms
time-complexity
space-complexity
+
–
Page:
« prev
1
2
3
4
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register