Categories

Computer Science Fundamentals Questions - Algorithms

Download PDF (5 Sample Questions)
Compare NFA and PDA.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What is (a) CFL (b) Sentential Form?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
The language generated by G ( L(G) ) is {w | w is in T* and S =w .That is a
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the uses of Context free grammars?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Define a context free grammar.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the closure properties of regular languages?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Define Inverse Homomorphisms
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Define Homomorphisms.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What is Arden’s Theorem?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the applications of Finite automata?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What are the applications of pumping lemma?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
What do you mean by equivalence and minimization of DFA?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
List the application of regular expression.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 03, 2013 View Details
Showing 76 to 90 of 348 results
Feedback