FLAT Short Questions


1.      What is Finite State Machine? What are the elements of FSM?
2.      What are the advantages and disadvantages of FSM?
3.      What are the Applications of FSM?
4.      What is the difference between CFG and CSG?
5.      Define Regular Expression?
6.      Consider a DFA M= (Q, Σ, δ, q0, F), what is the minimum and maximum number of initial states in it?
7.      Consider a NFA M= (Q, Σ, δ, q0, F), what is the minimum and maximum number of initial states in it?
8.      Consider a ϵ-NFA M= (Q, Σ, δ, q0, F), what is the minimum and maximum number of initial states in it?
9.      What is Unit- Production? If you eliminate the unit productions from the give  CFG, what will be the effect on the language by the resulting grammar?
10.  When you convert ϵ-NFA to NFA, how do you decide the final states of resultant NFA. Give an example
11.  What is left recursion? How to eliminate the left recursion?
12.  Give the formal definition of Mealy machine. Give an example
13.  Give the formal definition of Moore machine
14.  What is ambiguous grammar? Give an example
15.  What is trap state? Give an example?
16.  Difference between PDA and TM with respect to tape, head, halt state and final state?
17.  What are the applications of CFG?
18.  List out the components of turning machine?
19.  What is dead state? Give an example?
20.  Give the formal definition of TM? Give the block diagram of TM
21.  What is useless symbol in CFG? If you eliminate the useless symbols and productions from the given CFG, what will be the effect on the language by the resultant grammar?
22.  What is an infinite loop in TM? Explain with an example?

Comments

Post a Comment

Popular posts from this blog

Tree pruning useful in decision tree induction

Why is tree pruning useful in decision tree induction? What is a drawback of using a separate set of tuples to evaluate pruning? The decision tree built may overfit the training data. There could be too many branches, some of which may reflect anomalies in the training data due to noise or outliers. Tree pruning addresses this issue of overfitting the data by removing the least reliable branches (using statistical measures). This generally results in a more compact and reliable decision tree that is faster and more accurate in its classification of data. The drawback of using a separate set of tuples to evaluate pruning is that it may not be representative of the training tuples used to create the original decision tree. If the separate set of tuples are skewed, then using them to evaluate the pruned tree would not be a good indicator of the pruned tree’s classification accuracy. Furthermore, using a separate set of tuples to evaluate pruning means there are less tuples to use for ...
Read more

Machine Learning Syllabus

MACHINE LEARNING UNIT -I: The ingredients of machine learning, Tasks: the problems that can be solved with machine learning, Models: the output of machine learning, Features, the workhorses of machine learning. Binary classification and related tasks: Classification, Scoring and ranking, Class probability estimation UNIT-II: Beyond binary classification:  Handling more than two classes, Regression, Unsupervised and descriptive learning. Concept learning : The hypothesis space, Paths through the hypothesis space, Beyond conjunctive concepts UNIT- III: Tree models: Decision trees, Ranking and probability estimation trees, Tree learning as variance reduction. Rule models: Learning ordered rule lists, Learning unordered rule sets, Descriptive rule learning, First-order rule learning UNIT-IV: Linear models: The least-squares method, The perceptron: a heuristic learning algorithm for linear classifiers, Support vector machines, obtaining probabilities from linear cla...
Read more