Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
meghna
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Questions by meghna
2
votes
0
answers
1
#self doubt #greedy method #testseries
Consider the multistage graph with 6 stages then what is the minimum cost from Source node (A) to Destination node (N) using Greedy Method ______
Consider the multistage graph with 6 stages then what is the minimum cost from Source node (A) to Destination node (N) using Greedy Method ______
486
views
asked
Oct 3, 2018
Algorithms
algorithms
mst-greedy
+
–
0
votes
1
answer
2
#self doubt #minimum spanning tree
T/F In a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to find a minimum spanning tree in G. Also,Does this "weight w(e) such that 1<= W(e) <=n" has significance on time complexity or we consider it as some edges weights and proceed?
T/FIn a graph G=(V,E) suppose that each edge e ∊ E has an integer weight w(e) such that 1<= W(e) <=n Then there is a an o(mlogn) time algorithm to find a minimum spann...
343
views
asked
Oct 3, 2018
Algorithms
minimum-spanning-tree
algorithms
+
–
0
votes
0
answers
3
#self doubt #left factoring removal
Does removal of left factoring from any given CFG, removes all non determinism from it?
Does removal of left factoring from any given CFG, removes all non determinism from it?
188
views
asked
Sep 19, 2018
Compiler Design
compiler-design
+
–
0
votes
0
answers
4
#selfdoubt #SLR & LALR
Can LALR have more reduce entries than SLR ? As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less than or equal to those in SLR. Is it correct?, please verify.
Can LALR have more reduce entries than SLR ?As per my understanding, the lookaheads used in LALR are subsets of Follow sets in SLR, so reduce entries in LALR can be less ...
271
views
asked
Sep 19, 2018
Compiler Design
compiler-design
parsing
+
–
1
votes
1
answer
5
#toc #regular languages #homomorphism
Which of the following are true for all regular languages and all homomorphisms, Justify with examples.
Which of the following are true for all regular languages and all homomorphisms, Justify with examples.
644
views
asked
Apr 12, 2018
0
votes
1
answer
6
#toc #regular grammars
Is it possible to write a Left Linear grammar for a given language directly, or we first write its Right linear grammar and then convert it subsequently? Please explain with some example.
Is it possible to write a Left Linear grammar for a given language directly, or we first write its Right linear grammar and then convert it subsequently? Please explain w...
197
views
asked
Apr 11, 2018
Theory of Computation
theory-of-computation
+
–
1
votes
1
answer
7
Peter Linz Edition 4 Exercise 2.2 Question 10 (Page No. 55)
Also is this nfa possible with less than three states??
Also is this nfa possible with less than three states??
519
views
asked
Apr 7, 2018
Theory of Computation
peter-linz
peter-linz-edition4
finite-automata
theory-of-computation
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register