Categories

Computer Science Fundamentals Questions - Algorithms

Download PDF (5 Sample Questions)
A grammar that produces more than one parse tree for some sentence is called
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
Which of the following statement is wrong ?
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
Context free language are closed under
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
The language L = (0n 1n 2n where n > 0) is a
Computer Science Fundamentals Algorithms Objective
Posted: Mar 05, 2013 View Details
What is Arden’s Theorem?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
What  are the components of Finite automaton model?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
What is Moore machine and Mealy machine?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
What are the applications of automata theory?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
Give the examples/applications designed as finite state system.
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
Why are switching circuits called as finite state systems?
Computer Science Fundamentals Algorithms Subjective
Posted: Mar 05, 2013 View Details
Showing 31 to 45 of 348 results
Feedback