Important Question Models in FLAT

1.    Difference between DFA and NFA and examples of DFA and NFA?
2.    Construction of DFA or NFA from given Language or a statements?
3.    Construct the regular expression form given Finite Automata?
4.    Construct the Finite Automata for given Regular expression?
5.    Explain the working of FA and Mathematical Representation of FA?
6.    Difference between the moore and mealy machine?
7.    Minimization problem?
8.    Equivalence of  given two finite Automata?
9.    Define the PAD? working of PDA and Example of PDA?
10.  Properties of Regular set and Regular Language?
11.  Simplification of given CFG?
12.  What are  Normal Form and explain it?
13.  What is Turing machines and working of turing machine
14.  Post correspondence problem and example?
15.  Define P and NP Problem?


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