Preparing your PDF
Loading PDF viewer...
Basic Foundations
Semester
Subject
💡 Jump to Important Questions ↓
Important Questions
Important Questions
Basic Foundations
Asked in 2081Short Question5 Marks
1.
Define -closure of a state. Differentiate between Moore and Mealy machine. [5]
Asked in 2081Short Question5 Marks
2.
Does machine always refer to hardware? Justify. Define positive closure and Kleene closure. [5]
Asked in 2080.1Short Question5 Marks
3.
Differentiate Kleen closure from positive closure. Compute positive and Kleen closure of {ab}. [5]
Asked in 2080Short Question5 Marks
4.
How abstract, decision and optimization problems are different from each other? [5]
Asked in 2080Short Question5 Marks
5.
Define string, substring, empty string, and empty language over alphabet {a,b}. [5]
Asked in 2079Short Question5 Marks
6.
Write short notes (Any two): a) Big Oh, Big Omega and Big Theta b) Tractable and Intractable Problems c) Chomsky Hierarchy [5]
Asked in 2079Short Question5 Marks
7.
Explain the -closure of states on an -NFA with suitable examples. [5]
Asked in 2078Short Question5 Marks
8.
Explain about the Chomsky's Hierarchy about the language and programs. [5]
Asked in 2078Short Question5 Marks
9.
Define the term alphabet, prefix and suffix of string, concatenation and Kleen closure with example. [5]