Source: https://ja.scribd.com/document/362974093/AI-5-units-2-mark
Timestamp: 2019-04-18 22:21:37+00:00

Document:
1(A). Define Artificial Intelligence (AI).
The study of how to make computers do things at which at the moment, people are better.
1(B). Define Artificial Intelligence formulated by Haugeland.
The exciting new effort to make computers think machines with minds in the full and literal sense.
1(C). Define Artificial Intelligence in terms of human performance.
The art of creating machines that performs functions that require intelligence when performed by people.
1(D). Define Artificial Intelligence in terms of rational acting.
1(E). Define Artificial in terms of rational thinking.
of the computations that make it possible to perceive, reason and act-Winston.
2. What is meant by Turing test?
questioner, will be asking questions to one person and one machine. Three of them will be in a separate room.
Interrogator knows them just as A and B. so it has to identify which is the person and machine.
3. What is called materialism?
4. What are the capabilities, computer should posses to pass Turing test?
5. Define Total Turing Test?
6. What are the capabilities computers needs to pass total Turing test?
through sensors and acting upon that environment through actuators.
9. Define an Omniscient agent.
10. What are the factors that a rational agent should depend on at any given time?
1. The performance measure that defines degree of success.
3. When the agent knows about the environment.
4. The action that the agent can perform.
12. List the various type of agent program.
 Simple reflex agent program.
 Agent that keep track of the world.
 Goal based agent program.
13. Give the structure of agent in an environment?
Agent interacts with environment through sensors and actuators.
20. Define Agent Program. For each possible percept sequence. Define performance measures. Define Information Gathering. 18. (i. 24. An Omniscience agent knows the actual outcome of its actions and can act accordingly. corrections. Define Percept Sequence. 19. . Define Ideal Rational Agent. 15. They are How and When actions. Rational agent is one that does the right thing.) right actions will cause the agent to be most successful in the environment. It is a mathematical description which deals with the agent’s behavior that maps the given percept sequence into an action.Actuators S – Sensors Example Interactive English tutor performance measure maximize student’s score on test. Performance measure embodies the criterion for success of an agent’s behavior. 21. 22. Agent function for an agent will be implemented by agent program. 16. Environment Set of students testing Agency Actuators Display exercises suggestions. Doing actions in order to modify future percepts sometimes called information gathering.Environment A. Define Omniscience. How to measure the performance of an agent? Performance measure of an agent is got by analyzing two tasks.Performance measure E . Define Agent Function. What is important for task environment? PEAS → P. How agent should act? Agent should act as a rational agent.e. 23. given the evidence provided by the percept sequence and whatever built in knowledge the agent has. a rational agent should select an action that is expected to maximize its performance measure. It should learn what it can do to compensate for partial (or) in correct prior knowledge. An agent’s choice of action at any given instant can depend on the entire percept sequence observed to elate. 17. What is autonomy? A rational agent should be autonomous. 14.
Contingency problem. Competitive Multi agent b. List the properties of environments. They are i. 30. Operator vi. 32. i. state space vii. What are the different types of problem? Single state problem. What is the structure of intelligent Agent? Intelligent Agent = Architecture + Agent Program 29. What are the components of a problem? There are four components. Define problem solving agent. path . Solution v. 28. Path cost v. What is environment program? It defines the relationship between agents and environments. Execution phase 31. Successor function iii. multiple state problems. Problem solving agent is one kind of goal based agent.Co – operative Multi agent 27. EG – It selects the environment from environment class in which the agent has to Run. Goal formulation ii. List the steps involved in simple problem solving technique. 26. where the agent Should select one action from sequence of actions which lead to desirable states. Problem formulation iii. Search iv. o Fully Observable Vs Partially Observable o Deterministic Vs Stochastic o Episodic Vs Sequential o Static Vs Dynamic o Discrete Vs Continuous o Single Agent Vs Multi agent a. initial state ii. What is Environment Class (EC) and Environment Generator (EG)? EC – It is defined as a group of environment. Sensors Keyboard entry 25. Exploration problem. Goal test iv.
35. Define search node. Completeness ii. 40. i. Traveling salesman problem. this collection is called fringe or frontier. VLSI Layout problem v. iv. List the performance measures of search strategies. Optimality iii. iii. Automatic Assembly vii. 34. The collection of nodes that have been generated but not yet expanded. 41. Time complexity iv. 39. Robot navigation vi. Real world problem examples: i. The number of nodes which is connected to each of the node in search tree is called Branching factor. 8 – Queen problem 8 – Puzzle problem 38. which is the sum of the cost of the each action along the path. Define branching factor (b). Touring problem. ii. Define search tree. The root of the search tree that is the initial state of the problem is called search node. Define fringe. . A function that assigns a numeric cost to each path. Define State Space. Toy problems ii. Real world problems 37. Give example problems for Artificial Intelligence. i. The set of all possible states reachable from the initial state by any sequence of action is called state space. 43. Define Path. Airline travel problem. Differentiate Blind Search and Heuristic Search. Give example for real world end toy problems. Internet searching Toy problem Examples: Vacuum world problem. The tree which is constructed for the search process over the state space is called search tree. 33. Define Path Cost. A path in the state space is a sequence of state connected by sequence of actions. Space complexity 42. 36.
3. What is informed search? One that uses problem – specific knowledge beyond the definition of the problem itself and it can find solutions more efficiently than an uninformed strategy. partially expanded node remembers which successor generate next is called Backtracking search. 2.e. Define depth limited search. Mention the criteria for the evaluation of search strategy. path caused to move ii) Problem is solved with the information we which we know. UNIT – II 1. Blind search Heuristic search i) No information about the path cost i) We have some information like minimum from the current state to goal state. Different varieties of queuing fn produce different varieties of the search algorithm. ii) Problem can be solved by the information which is already given. space complexity. This is called Depth Limited search. What is the use of QUEUING_FN? QUEUING_FN inserts asset of elements into the queue. 47. The problem of unbounded tress can be avoided by supplying depth limit 1(i. time complexity. 45. optimality . Define Uniform cost search. There are 4 criteria: Completeness. The variant of depth first search called backtracking search. Only one successor is generated at a time rather than all successor. Define Depth first search.) nodes at depth 1 are treated as if they have no successors. 46. iii) Example a) Breadth first search iii) Example b) Uniform cost search a) Best first search c) Depth first Search b) Greedy search d) Depth limited search c) A* search e) Iterative deepening search f) Bi – Directional Search 44. It expands the deepest node in the current fringe of the search tree. Uniform cost search expands the node ‘n’ with the lowest path cost instead of expanding the shallowest node. Define Backtracking search.
because evaluation measures distance to the goal. h (n). f(n). Define Evaluation function. A* search evaluates nodes by combining g(n). BFS b. a. the cost to reach the node and h(n). What is Best First Search? Best First Search is an instance of the general TREE SEARCH or GRAPH SEARCH algorithm in which a node is selected for expansion based on an evaluation function.4. DFS d. Define Admissible heuristic h (n). if it is optimal then. Best first search –greedy search .e. 10. Iterative deepening search f. List the various informed search strategy. What is triangle inequality? It states that each side of a triangle cannot be longer than the sum of the other two slides of the triangle. Memory bounded A*(MA*) 14. Define Heuristic function. . It is done by using the heuristic function: f(n) = h(n). A node with the lowest evaluation is selected for expansion.A* search Memory bounded search-Iterative deepening A*search -simplified memory bounded A*search -Iterative improvement search –hill climbing -simulated annealing 6. 13. It expands the node that is closest to the goal (i. 8. Define A* search. What are the 2 types of memory bounded heuristic algorithms? i. f(n) = g(n) + h(n) 11. 7. Recursive Best First Search(RBFS) ii. Depth limited search e. Uniform cost search c. List the various search strategies. Differentiate BFS & DFS. f(n). 12. Bidirectional search 5. 9. In A* search. the cost to get from the node to the goal. h(n) is an admissible heuristic which means h(n) never overestimates the cost to reach the goal. Define Greedy Best First Search.) to reach solution in a quicker way. h (n) is defined as the estimated cost of the cheapest path from node n to a goal node.
BFS means breath wise search. Space complexity is less Gives optimal solution Queuing fn is somewhat different from queue operator. Iterative deepening is a strategy that sidesteps the issue of choosing the best depth limit by trying all possible depth limits: first depth 0. h2? The sum of the horizontal and vertical distances of the tiles from their goal positions in a 15 puzzle problem is called Manhattan distance (or) city block distance.then depth 2& so on. Define iterative deepening search. So dfs will never be able to recover from an unlucky choice at one of the nodes near the top of the tree. 24. Uniform tree of depth d would have to be in order to contain N+1 nodes is called branching factor. d-depth of tree . 20. So DFS should be avoided for search trees with large or infinite maximum depths 23. Time complexity =O (bd) . RBFS remembers the f-value of the best leaf in the forgotten sub tree and therefore decide whether its worth re expanding the sub tree sometimes later. What is RBFS? It keeps track of the f-value of the best alternative path available from any ancestor of the current node. then depth 1. What is metalevel state space? Each state in a metalevel state space captures the internal state of a program that is searching in an object level state space. 17. Memory bounded A*(MA*) ii. What is SMA* search? SMA* expands the best leaf until memory is full and it drops the oldest worst leaf node and expands the newest best leaf node. What is called as bidirectional search? The idea behind bidirectional search is to simultaneously search both forward from the initial state & backward from the goal & stop when the two searches meet in the middle. The drawback of DFS is that it can get stuck going down the wrong path. Space complexity is more. Define Branching factor b*. Give the drawback of DFS. What is Manhattan distance. b-branching factor. What are the 2 ways to use all available memory? i. Do not give optimal solution Queuing fn is same as that of queue operator DFS means depth wise search. Simplified Memory bounded A*(SMA*) 18. Many problems have very deep or even infinite search tree. 15. Write the time & space complexity associated with depth limited search. 19. 21. 22. 16.
If elevation corresponds to an objective function.) up hill and terminates when it reaches a “peak” where no neighbor has a higher value. If elevation corresponds to cost. What is a pattern database? This database is the storage of exact solution costs for every possible sub problem instance. 26. then the aim is to find the highest peak is called global maximum. Location defined by the state. Local maxima: A local maxima as opposed to a goal maximum is a peak that is lower that the highest peak in the state space. What is local search? It operates using a single current state rather than multiple paths and generally moves only to neighbors of that state. Define Global Maximum. Once a local maxima is reached the algorithm will halt even though the solution may be far from satisfactory. 35. 30. . 29. 27. Define Global minimum. What is a disjoint pattern database? The sum of the two costs is still a lower bound on the cost of solving the entire problem is called a disjoint pattern database. What is the meaning for greedy local search? It goals (picks) a good neighbor state without thinking ahead about where to go next. It is a loop that continually moves in a increasing value direction (i. Space complexity=o (bl) 25. 36. Define Local maxima. 33. 28. 31. Define Hill Climbing search. then the aim is to find the lowest valley is called global minimum. ii. Elevation defined by the value of the heuristic cost function (or) objective function. What are the 2 parts of Landscape? i. Define Optimization Problems. The aim of this problem is to find the best state according to an objective function.e. Plateaux: A plateaux is an area of the state space where the evaluation fn is essentially flat. List some drawbacks of hill climbing process. 32. The search will conduct a random walk. What is Released problems? A problem with fewer restrictions on the actions is called a relaxed problem. 34.
Stochastic beam search 38. Thus each iteration expands all nodes inside the contour for the current f-cost. If the move improves the situation. What is Genetic Algorithms? Genetic Algorithm is a variant of stochastic beam search in which successor states are generated by combining two parent states. Define Online Search agent. Define annealing. but lower than the global maximum. instead of picking the best move. What is the advantage of memory bounded search techniques? We can reduce space requirements of A* with memory bounded algorithm such as IDA* & SMA*. Give the procedure of IDA* search. Iterative improvement algorithms keep only a single state in memory. What are the variants of hill climbing? i. * It is optimal if enough memory is available to store the shallowest optimal solution path. 42. The depth first search is modified to use an f-cost limit rather than a depth limit. This algorithm. but can get stuck on local maxima. Annealing is the process used to harden metals (or) glass by heating them to a high temperature and then gradually cooling them. optimal. Its space complexity is still prohibitive. the search is optimally efficient. 43. 37. it picks a random move. A local maximum is a peak that is higher than each of its neighboring states. *Hill climbing. *Simulated annealing. Otherwise it returns the best solution that can be reached with the available memory. First choice hill climbing iii. 44. Local beam search v. . In this algorithm each iteration is a dfs just as in regular iterative deepening. Minimize f(n)=g(n)+h(n) combines the advantage of uniform cost search + greedy search A* is complete. * It avoids repeated states as for as its memory allow. Simulated annealing search iv. 39. List some properties of SMA* search. Agent operates by interleaving computation and action (i. and then it observes the environment and computes the next action. it is always accepted.) first it takes an action. 40. * It will utilize whatever memory is made available to it. Define simulated annealing. Stochastic hill climbing ii.e. * It is complete if the available memory is sufficient to store the shallowest path. rather than by modifying a single state. 41. *When enough memory is available for entire search tree. thus allowing the material to coalesce into a low energy crystalline state.
Constraint Satisfaction problem (CSP) is defined by a set of variables X1. It is the general term for propagating (i. Preference constraints.e. Define Alpha beta pruning. Define LCV. Define MRV. 49. 51. 52. Define CSP. A value can be assigned to any unassigned variable. c. Goal TEST(s) 46. Actions(s) b. provided that does not conflict with previously assigned variables.X2. a.…Cm. a. Define Cycle cut set. 50. This process is called tree decomposition. b. 53. d. Define Successor function.) spreading the implications of constraints on the variable on to other variable. s’) c. Unary constraints relates one variable. Step cost function C(s. The constraint graph is divided into a set of connected sub problems.…Xn and set of constraints C1. Each sub problem is solved independently and the resulting solutions are then combined. S is called a cycle cut set. Define constraint propagation. Least constraining value heuristic prefers the value that rules out the fewest choices for the neighboring variables in the constraint graph. 55. Define Tree decomposition. Absolute constraints. 47. e. Minimum remaining values heuristic chooses the variable with the fewest “legal” values. Alpha beta pruning eliminates away branches that cannot possibly influence the final decision . Define Conflict directed back jumping. What are the things that agent knows in online search problems? a.C2. The process of choosing a subset S from variables [CSP] such that the constraint graph becomes a tree after removal of S. Higher order constraints relate more than two variables. What are the types of constraints? There are 5 types. 48. A back jumping algorithm that uses conflict sets defined in this way is called Conflict directed back jumping. 54.45. A binary constraint relates two variables.
sometimes these objects are referred as domain elements. It is an expressive. The difference between propositional and first order logic is in the ontological commitment. 8. Define Epistemological commitment. 3. Define FOL. It assumes about the nature of reality.An inference procedure ‘i’ can be described by the sentences that it can derive. 5. Richard. Define Syntax? Syntax is the arrangement of words. Define a knowledge Base: Knowledge base is the central component of knowledge base agent and it is described as a set of representations of facts about the world. The logic that allows the possible states of knowledge with respect to each fact. 9. 7. Syntax of the language describes how to make sentences. Define domain and domain elements. show objects. Syntax of a knowledge describes the possible configurations that can constitute sentences. What are the three levels in describing knowledge based agent?  Logical level  Implementation level  Knowledge level or epistemological level 10. KB --Alpha is derived from KB or i derives alpha from KB. With an example. 6. England. Define an inference procedure An inference procedure reports whether or not a sentence is entiled by knowledge base provided a knowledge base and a sentence . If i can derive from knowledge base. properties functions and relations. King Functions : BROTHER OF 4. 1200 Relation : Ruled Properties : Evil.) Boolean Logic. It is a representational language of knowledge which is powerful than propositional logic (i. 2. The sentences are expressed in a language called as knowledge representation language. compositional language. Example “EVIL KING JOHN BROTHER OF RICHARD RULED ENGLAND IN 1200” Objects : John. Define Semantics . 11. declarative. The set of objects is called domain. FOL is a first order logic. UNIT – III 1. Define Ontological commitment. Define a Sentence? Each individual representation of facts is called a sentence.e. we can write.
Proof Theory – a set of rules for deducing the entailment of a set sentences. 15. The domain of family relationship is called kinship domain which consists of objects unary predicate. Define Atomic sentence. when a particular configuration exists with in an agent. The semantics of the language defines the truth of each sentence with respect to each possible world. 17. relation. Extension to the standard syntax (i. Define synchronic and diachronic sentence. Sentences that allow reasoning “a cross time” are called diachronic sentence. Define kinship domain. Atomic sentence is formed by both objects and relations. Quantifiers are used to express properties of entire collection of objects rather than representing the objects by name. 18. A formal system for describing states of affairs. ii. Existential Quantifier iii. function. Types: i. We use 3 symbols to build a term. Define Logic Logic is one which consist of i.e. 13. binary predicate. What are the two we use to query and answer in knowledge base? ASK and TELL. What are the 3 types of symbol which is used to indicate objects. Diagnostic rules .e. consisting of a) Syntax b)Semantics. 19.) meaning is called syntactic sugar. Nested Quantifier. relations and functions? i) Constant symbols for objects ii) Predicate symbols for relations iii) Function symbols for functions 14. the agent believes the corresponding sentence. Richard) William is the brother of Richard. A term is a logical expression that refers to an object. Define Quantifier and it’s types. Universal Quantifier ii. 21. With this semantics.) procedure that does not change the semantics (i. Example Brother (William. What are the 2 types of synchronic rules? i. Sentences dealing with same time are called synchronic sentences. Define syntactic sugar. 20. Define terms. 16. 12.
What are the basic Components of propositional logic? i.Define a Proof A sequence of application of inference rules is called a proof. The existential sentence says there is some object satisfying a condition. Lifted Inference rule require finding substitutions that make different logical expressions look identical (same). relations and functions are referred to by the constant predicate. Casual rules. . we can infer its disjunction with anything. 32 .What is truth Preserving An inference algorithm that derives only entailed sentences is called sound or truth preserving . ii. 22. 27. 30. and function symbols.Define a Complete inference procedure An inference procedure is complete if it can derive all true conditions from a set of premises. 23. 35. Finding proof is exactly finding solution to search problems. Logical Constants (True. If the successor function is defined to generate all possible applications of inference rules then the search algorithms can be applied to find proofs. 28. Define true sentence A sentence is true under a particular interpretation if the state of affairs it represents is the case. 29. Define Unification. 24 .Define Validity of a sentence A sentence is valid or necessarily true if and only if it is true under all possible interpretation in all posssible world. 26.Define Modus Ponen’s rule in Propositional logic? The standard patterns of inference that can be applied to derive chains of conclusions that lead to the desired goal is said to be Modus Ponen’s rule. This is called Unification.Define Interpretation Interpretation specifies exactly which objects. a sentence. False) 31 . OR-Introduction rule states that from.Define AND –Elimination rule in propositional logic AND elimination rule states that from a given conjunction it is possible to inference any of the conjuncts. The new name is called skolem constant.Define Satistiability of a sentence A sentence is satisfiable if and only if there is some interpretation in some world for which it is true . and the instantiation process is just giving a name to that object. That name must not belong to another object. Define skolem constant. 25.
37.36. There are 2 kinds. 39. 42. What are the 2 types of processes? i.e. Representational Frame Problem ii. This is called occur check. Extended Intervals . Define magic set. Liquid events . A set of parameters and sentences 43. Define Occur check. one must check whether the variable itself occurs inside the term. What are the divisions of knowledge in OTTER theorem? i. Inferential Frame Problem 44. This algorithm works backward from the goal. 40. Moments ii. Define backward chaining. Discrete events – it have definite structure ii. This is called pattern matching. so that only relevant variable bindings called magic set. When matching a variable in 2 expressions against a complex term. 41. i. Define fluent calculus. 45.Categories of events with process. Define pattern matching. It is a set of definite clauses written in a notation somewhat different from standard FOL. What are the 2 types of frame problem? i. 46. Define Prolog program. Rewrites (or) Demodulators iv. The inner loop of an algorithm involves finding all the possible unifiers with facts in the KB. using information from the goal. Usable axioms iii. Discard Situation Calculus and invent a new formalism for writing axioms is Called Fluent Calculus. 38.) intervals is important for agent to take an action. What is important for agent? Time (i. chaining through rules to find known facts that support the proof. Set of Support (SOS) ii. If it does the match fails. To rewrite the rule set. Explain the function of Rete Algorithm? This algorithm preprocess the set of rules in KB to constant a sort of data flow network in which each node is a literals from rule a premise.
7. 4. It is important to remember that p(a) can only be used when there is no other information. “Phone number (Divya)”. b.What is the need for probability theory in uncertainty ? Probability provides the way of summarizing the uncertainty that comes from our laziness and ignorance . The use utility theory to represent and reason with preferences. What Is Called As Decision Theory ? Preferences As Expressed by Utilities Are Combined with Probabilities in the General Theory of Rational Decisions Called Decision Theory.N). whose preferences the utility function is supposed to represent. 3. Agents cannot find a caterorial answer. Practical ignorance: even if we know all the rules. Define runtime variables.laziness: o it is hard to lift complete set of antecedents of consequence. Probability statements do not have quite the same kind of semantics known as evidences. and that the agent will prefer states with higher utility. logic fails to cope with that the mind like medical diagnosis. needed to ensure and exceptionless rule. Theoritical Ignorance: o medical science has no complete theory for the domain. 5. utility of a state is relative to the agents.Define Prior Probability? p(a) for the Unconditional or Prior Probability Is That the Proposition A is True. Dial (n)] UNIT – IV 1. incorrectness in agents understanding of properties of environment. 2. . we may be uncertain about a particular item needed. Example [Look up (Agent. Why does uncertainty arise ? Agents almost never have access to the whole truth about their environment. What is called as principle of maximum expected utility ? The basic idea is that an agent is rational if and only if it chooses the action that yields the highest expected utility. Decision Theory = Probability Theory + Utility Theory. or utility to in agent. 8. State the reason why first order. averaged over all the possible outcomes of the action.what is the need for utility theory in uncertainty? Utility theory says that every state has a degree of usefulness. Plans to gather and use information are represented using short hand Notation called runtime variables (n). 6. This is known as MEU. Uncertainty can also arise because of incompleteness. Three reasons a.". 47. Define the term utility? The term utility is used in the sense of "the quality of being useful .
Define conditional probability? Once the agents has obtained some evidence concerning the previously unknown propositions making up the domain conditional or posterior probabilities with the notation p(A/B) is used.--------xn) assigns probabilities to all possible atomic events. This type of notations simplifies many equations. 18.What is meant by belief network? A belief network is a graph in which the following holds A set of random variables A set of directive links or arrows connects pairs of nodes.T P(A ^ B) = P(A/B) P(B) -------------------------.7.0. What are called as Poly trees? The algorithm that works only on singly connected networks known as Poly trees.08. Here at most one undirected path between any two nodes is present. P(weather) = (0.where X1.X2------Xn 10 =variables.The joint probability distribution p(x1.02).0. 13.What is an atomic event? An atomic event is an assignment of particular values to all variables. 19.x2.Define joint probability distribution This completely specifies an agent's probability assignments to all propositions in the domain.9. WE GET P(B/A) = P(A/B) P(B) -------------------.2.0.P(A) 14.What is the basic task of a probabilistic inference? The basic task is to reason in terms of prior probabilities of conjunctions. in other words. 12. we will use conditional probabilities as a vehicle for probabilistic inference.Define evidential support . This is important that p(A/B) can only be used when all be is known. The conditional probability table for each node The graph has no directed cycles. but for the most part.Give the Baye's rule equation W. What are the ways in which one can understand the semantics of a belief network? There are two ways to see the network as a representation of the joint probability distribution to view it as an encoding of collection of conditional independence statements. 10. Define probability distribution: Eg.K.Define casual support E+X is the casual support for X. 11.the evidence variables "above" X that are connected to X through its parent. 17.1 P(A ^ B) = P(B/A) P(A) -------------------------. the complete specifications of the state of domain.2 DIVIDING BY P(A) . 16. 15.
What is called as multiple connected graph? A multiple connected graph is one in which two nodes are connected by more than one path. . Reinforcement Learning 24. it gives him a indication that his behaviour is undesirable. Define Reinforcement Learning. What are issues in learning element? i.the evidence variables "below" X that are connected to X through its children. Supervised Learning Unsupervised Learning It involves learning a function It involves learning patterns in From examples of its inputs the input when no specific And outputs output values are supplied. Supervised Learning ii. This Learning is rather than being told what to do by teacher. 20. Learning a discrete valued function is called is called classification learning. Differentiate Supervised and Unsupervised learning. 28. What is the purpose of learning? The idea behind learning is that percepts should be used not only for acting but also for improving the agent’s ability to act in the future. a reinforcement learning agent must learn from occasional rewards. 25. 27. Representation 23. Example If taxi driver does not get a tip at the end of journey. Learning a continuous valued function is called regression learning. 22. Component ii. Unsupervised Learning iii. Define Inductive Learning. Feedback iii. An algorithm for supervised learning is given as input the correct value of the unknown function for particular inputs and it must try to recover the unknown function. days” and “Bad traffic days” without any advice. What are the types of machine learning? i. we can even skip will learn about “Good traffic on the road is a result. 21. 26. Define Regression learning. E-X is the evidential support for X. Example: Applying Brake on Example: Day by day agent the wet road. Define Classification Learning.
It can be applied to any learning algorithm. . An learning algorithm that return hypotheses that are approximately correct is called PAC learning algorithm. 34. Define Decision list. If test succeeds. If test fails. It consists of a series of tests. Information gain from the attribute test is the difference between the original information requirement and the new requirement. Multivalued attributes iii. 36. n/ (p+n)) – Remainder(A) 32. 33. 37. value is returned. We do this on a set of examples is known as Test Set.29. What is parity and majority function? Parity Function : It Returns 1 if and only if an even number of inputs are 1. not just decision tree learning. What is ensemble learning? The idea of this learning is to select a whole collection or ensemble. one has to be careful not to use the resulting freedom to find meaningless “regularity” in the data. Mention the exercises which broaden the applications of decision trees. of hypotheses from the hypotheses space and combine their predictions. What is training set? The complete set of examples is called the training set. 35. 38. What is the purpose of cross validation? It reduces over fitting. What is over fitting? Whenever there is a large set of possible hypotheses. 30. processing continues with the next test in the list. What is test set? Prediction is good if it turns out to be true. Continuous and integer valued input attributes iv. It is a logical expression of a restricted form. Gain (A) = I(p/(p+n)). Missing data ii. Example Restaurant problem Goal predicate “will wait” 31. Majority function : It Returns 1 if more than half of its inputs are 1. This problem is called over fitting. The basic idea is to estimate how well each hypotheses will predict unseen data. each of which conjunction of literals. Define Information gain. i. Continuous valued output attributes. so can assess quality of hypotheses by Checking its predictions against the correct classification once we know it. Define PAC – Learning Algorithm.
ILP methods can learn relational knowledge that is not expressible in attribute based systems. 48. Allows the agent to infer a new. ILP techniques perform KBIL on knowledge that is expressed in first order logic. general rule that explains the observations. 41. 45. This is called generalization. Each boundary will not be a point but rather a set of hypotheses called a Boundary set. What is the purpose of memorization? Memorization used in computer science to speed up programs by saving the results of computation. it first checks the database to see whether it can avoid solving the problem. Define RBL. Show the relationship of an entailment constraint. Define EBL. when the function is called.39. The extension of the hypotheses must be increased to include it. What are the two boundary sets? i. Define Boundary set. the prior knowledge background concerns the relevance of a set of features to the goal predicate. Define knowledge based Inductive learning. we can infer a general rule. Differentiate generalization and specialization. Hypothesis ^ Description |= classifications. The basic idea of memo function is to accumulate a database of input and output pairs. S Set : a most specific boundary set. KBIL algorithm finds inductive hypotheses that explain sets of observations with the help of background knowledge. . The extension of the hypotheses must be decreased to exclude the example. 40. This knowledge together with the observations. G Set : a most general boundary set. Hypothesis ^ Descriptions |= classifications 44. What is the purpose of current best hypotheses search? This search is to maintain a single hypothesis and to adjust it as new examples arrive in order to maintain consistency. ii. 43. This kind of generalization process called explanation based learning (or) EBL. Relevance based Learning. What is the entailment constraints satisfied by EBL? Hypothesis ^ Description |= classification Background |= Hypothesis 46. 49. This is called specialization. Explanation based learning. Background ^ Description ^ classifications |= Hypothesis. Define Inductive Logic Programming (ILP). 42. 47. from the prior knowledge (or) information.
Define Bayesian Learning.) predictions are made by using all the hypotheses.LITERALS 53. CHOOSE . Write down the derivative of the log likelihood with respect to each parameter. ii. NEW – LITERALS ii. Write down an expression for the likelihood of the data as a function of the parameter. iii. What are the 3 kinds of literals that can be added? i. What are the methods for maximum likelihood parameter learning? i. This model assumes that the attributes are conditionally independent of each other. given the data and makes predictions on that basis. Algorithms that can generate new predicates are called constructive induction algorithms. This is MAP. Define MAP. A very common approximation is to make predictions based on single most probable hypotheses. 52. Arithmetic comparisons 54. . Construct a new rule where LHS consists of the leaves of the proof tree and R. Construct a proof using the available background knowledge. 56. iv. Find the parameter values such that the derivatives are zero. Define constructive induction algorithm. Define sum of squared errors. Define MDL. In this model. 60. given the class. ii.e. 59.H. 51.50. (i. What is the basic EBL process step? i. Maximum A Posteriori. 55. Drop any conditions that are true. iii. What is Maximum – Likelihood hypotheses? ML – it is reasonable approach when there is no reason to prefer one hypotheses over another a prior. weighted by their probabilities rather than by using just single “best” hypotheses. The MDL (Maximum Description Length). The difference between the actual value yj and the predicated value ( θ1 xj + θ2 ) so E is the sum of squared errors. Define Naïve Bayes model. What are the two main subroutines used for generating literals? i. It calculates the probability of each hypotheses. 57. 58. Equality and inequality literals iii.S is the variabilized goal. Construct a generalized proof tree for the variabilized goal using the same inference steps as in the original proof. Literals using Predicate ii. is a learning method which attempts to minimize the size of the hypotheses and data encodings rather than work with probabilities. the “class” variable C is the root and the “attribute” variable XI are the leaves.
A link propagates the activation. What is single layer feed forward neural network? A network with all the inputs connected directly to the outputs is called a single layer neural network or a perceptron networks. 70. Each hidden unit act as a perceptron that represents a soft threshold functions in the input space. After that we refit the components to the data. What are the two functions in Neural network’s Activation functions? i.61. The agent’s policy is fixed and the task is to learn the utilities of states. Define Passive learning. E – Step ii. Give Activation function. Define Neural Networks. 62. M – Step 63. The agent must learn what to do. 64. Define Active Learning. Threshold function ii. What are the categories of neural network structures? i. . this could also involve learning a model of the environment. Output unit act as a soft threshold linear combination of several such functions. Define EM. n ai = g(ini) = g(Σ Wj. An agent must experience as much as possible of its environment in order to learn how to behave in it. What is multilayer feed forward neural networks? It consists of many hidden units. Sigmoid function 66. Acyclic (or) Feed – forward networks ii. Expectation Maximization: the idea of EM is to pretend that we know the parameters of the model and then to infer the probability that each data point belongs to each component. It consists of nodes or units connected by directed links. where each component is fitted to the entire data set with each point weighted by the probability. 68. What are the 2 steps in mixture model parameters? i. 69.i aj) j=0 65. Each link has a numeric weight which determines the strength and sign of the connection. Cyclic (or) Recurrent Networks 67.
Conditional planning is a way in which the incompleteness of information is incorporated in terms of adding a conditional step. Planning can be viewed as a type of problem solving in which the agent uses beliefs about actions and their consequences to search for a solution. The planner should be able to add new actions at any time. What are the ways in which incomplete and incorrect information’s can be handled in planning? They can be handled with the help of two planning agents namely. Define a complete plan. iv. Precondition. A consistent plan is one in which there are no contradictions in the ordering or binding constraints. 2. ii. A set of ordering constraints. 7. A complete plan is one in which every precondition of every step is achieved by some other step. 8. i. Define conditional planning. iii. Conditional planning agent. 9. ii. 3. The planner should be able to represent the states. . 4. Progressive planning. Situation space planning. UNIT – V 1. Partial order planning.What are the features of an ideal planner? i. Define planning. Fully instantiated planning. What are the components that are needed for representing an action? The components that are needed for representing an action are: Action description.71. which involves if – then rules. goals and actions. Define a solution. Define TD. The planner should be able to use Divide and Conquer method for solving very big problems. Effect. Replanning agent. 5. ii. 10. Define a consistent plan. 6. iii. Temporal Difference learning: The key of TD is to use the observed transitions to adjust the values of the observed states so that they agree with the constraint equations. What are the different types of planning? The different types of planning are as follows: i. What are the components that are needed for representing a plan? The components that are needed for representing a plan are: A set of plans steps. v. Regressive planning. A solution is defined as a plan that an agent can execute and that guarantees the achievement of goal.
do nothing” 16. Define Reification. b. 21. 14. State the no altering principle. The law states that. “When there is doubt about what to do. Similarity net is a representation in which nodes denotes models. The law states that. They are: i. 18. iii. Learning by training neural networks. “ You cannot learn anything unless you almost know it already”. “ When an object or situation known to be an example. The no altering principle. c. fails to match a general model. Give the classification of learning process. c. Learning by managing models. usually called as Data base mining: a. 12. State Martin’s law. What is reified link? The elevation of a link to the status of a describable node is a kind of reification. The wait and see principle. d. Require-link heuristics. The law states that. ii. The learning process can be classified as: Process which is based on coupling new information to previously acquired knowledge a.11. Forbid-link heuristics. What are the different types of induction heuristics? There are two different types of induction heuristics. 15. Process which is based on digging useful regularity out of data. The process of treating something abstract and difficult to talk about as though it were concrete and easy to talk about is called as reification. Learning by recording cases. 17. Similarity net is an approach for arranging models. Martin’s law. Define Similarity nets. When a link is so elevated then it is said to be a reified link. . Learning by building identification trees. Learning by correcting mistakes. What is Induction heuristics? Descriptions from positive and negative examples. Learning by analyzing differences. Learning by explaining experience. What are the principles that are followed by any learning procedure? i. State the wait and see principle. ii. b. 20. links connect similar models and links are tied to different descriptions. 19. create a special case exception model”. Define Communication. 13.
Over generation iii. 22. Synthesis iv.) with the words and search for a tree with root S. Parsing is the process of finding a parse tree for a given input string. A formal language is defined as a set of strings of terminal symbols. 31. Generating Good English sentences ii. What are the algorithms to have efficient parsing? i. Define Formal Language. 23. Define Bottom up parsing. Language enables us to communicate most of what we have observed about the environment. Intention ii. We start from the leaf nodes (i. The process of extracting the meaning of an utterance an expression in some representation language. 27. Define Language. Top down parsing ii. Perception v. 29. Define Parsing. What are the processes in communication? i. 32. Define Semantic Interpretation. Define Top down parsing. 24. It starts with root node S and search for a tree that has the words as it leaves. Incorporation 25. Syntactic Interpretation ii. Pragmatic Interpretation 26. Generation iii. Analysis vi Disambiguation vii. Under generation 28. It is called as words. Left to right parsing algorithm ii. Semantic Interpretation iii. Chart Parsing algorithm. Left corner parsing . i.e. It is also known as syntactic analysis. What are the processes of Relative clause. iii. What are the parts in analyze? i. Communication is the international exchange of information brought about by the production and perception of signs drawn from a shared system of conventional signs. What are the types of parsing? i. Bottom up parsing 30.
39.33. Define Segmentation? The process of finding the words boundaries in a text with no spaces. 37. 44. E 2 eliminates VP by mentioning which phrases can allow which verbs which are known as sub categorization. A discourage is any string of language usually one that is more than one sentence long. Define Disambiguation. What are the characteristics of IR? i. Add one smoothing. What are the types of smoothing? i. 45. 40. Linear Interpolation Smoothing 43. The structure of coherent discourse. 35. 41. Information retrieval ii. Machine Translation 42. Syntactic Ambiguity iii. Define Information Retrieval (IR). Define DCG. The process of adding the existing rules of a grammar instead of introducing new rules. 34. The method of rewriting the existing rules in the grammar by the method of augmentation is called as DCG (Define Clause Grammar). It is called Augmentation. What are the tasks in probabilistic language model? i. . The sentence that does not provide exact meaning are called ambiguous sentence. Define Ambiguity. A document collection. Information Extraction iii. Define Augmentation. What are the types of Ambiguity? i. 36. ii. IR is the task of finding documents that are relevant to user’s need for information. Semantic Ambiguity 38. Define Discourse understanding. Lexical Ambiguity ii. What are the two sub problems in discourse understanding? i. The speaker’s aim is to communicate some words in utterance and hearer work is to get back the meaning of the world from the knowledge of situation. Reference Resolution ii. Define Sub categorization.
What are the types of information extraction systems? i. Precision 47. Complex phrases v. Case folding ii. It is a process of creating database entries by skimming a text and looking for occurrences of a particular class of object. Lexicon ii. What are the types of machine translation? i. What are the stages in Relational based systems? i. What are the methods to do IR Refinements? i. Basic groups iv. Complex word handling iii. Literacy translation . What are the two data structures that make IR systems efficient? i. 52. What are the types of evaluation of IR systems? i. What are the types of clustering technique? i. Relevance feedback ii. Document classification iii. Document clustering 49. Recognize synonyms iv. A result set iv. Restricted source translation iii. K-means clustering 50. Rough translation ii. Meta data 48. iii. Agglomerative clustering ii. Define Information Extraction. tokenization ii. Stemming iii. A query posed in a query language. 46. What are the 3 mechanism to achieve performance improvement? i. ii. Recall ii. Relational based system 53.Inverted Index 51. Pre edited translation iv. Attribute based system ii. Merges structures 54. Spelling correction v. A presentation of the result set.
Estimate the initial word choice model vi. Estimate the French language model iii. . How to use the parameters for machine translation? i. Align sentences iv. Estimate the initial offset model vii. Improve all the estimates. Estimate the initial fertility model v.55. Segment into sentences ii.
Principles of Compiler Design -A.v. Aho . J.D.ullman; Pearson Education.

References: v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v. 
 v.