VINAYAKA MISSIONS UNIVERSITY V.M.K.V.

ENGINEEERING COLLEGE, SALEM DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING Question Bank SUB: Artificial Intelligence BRANCH: CSE SEM: VII UNIT-1 Part-A 1. Define the term AI. 2. Who is an agent and its roles 3. Define agents and environment. 4. Who is an agent. List the tasks and tasks of an intelligent agent. 5. Define PAGE and PEAS. 6. How to design an agent program. 7. List the properties of an environment. 8. List the types of agents and its role. 9. Define the problems and solutions for an agent. 10. How to check the performance of problem solving. 11. Define BFS and bi-directional search. 12. Define Best-First search with a neat algorithm. 13. List the functions in Greedy BFS and A* algorithm. 14. Difference between Human Intelligent and machine. 15. State turing test. 16. Write the applications of AI 17. Define rational agents. 18. Define mapping and lists its uses. 19. Draw the structure of hill climbing algorithm 20. Differentiate Logic and Inference. 21. Define Propositional logic. 22. what is KBA and logical agents. 23. Define ARTIFACTS. 24. Define memory bounded and A8 search a;lgorithm. 25. Define CSP and lists its properties. PART-B 1. Explain in detail about agents and environment and the performance measures. 2. Explain in detail about intelligent agent and list the types of agents with an example. 3. Explain in detail about problem formulation and how it interacts with domain system and list its types and uses. 4. Give a detailed notes about uniformed strategies in hill climbing algorithm 5. Explain briefly about environment and lists its user agents and types and how its relates with intelligent agents. 6. Describe in detail about a. Blind search, Breadth first search, Depth first search, and contingency problems in domain. 7. Give a detailed account about CSP and its structure and back tracking search strategies.

8. How to solve the problems by searching techniques and give an example. 9. How to solve the problems by search strategies and explain about tree search algorithm. 10. Explain in detail about Online search agents and unknown environments. UNIT2:PART A:1. 2. 3. 4. 5. 6. 7. 8. 9. Define alpha-beta pruning? Define Best First search? Write short notes on Greedy Best-First search? Write short notes on A* search? Write short notes on memory-bounded heuristic search? Define RBFS? Define SMA*? Explain three disadvantages of hill climbing with an example. Define CSP? 10. Define alpha-beta cutoff with an example. 11. Write steps of min-max algorithm. 12. Define pruning? 13. Give two examples for memory bounded search. 14. Give examples for game playing problems. 15. Define quiescence search with an example? 16. Define horizon problem with an example? 17. State the reasons to avoid the disadvantage of min-max algorithm. 18. When the language is compositional? 19. What is called a model? 20. Define A*. 21. Define compositionality. 22. What is knowledge acquisition? 23. Define model-based reasoning. 24. Explain atomic sentence. 25. what do you mean by interpretation? PART B:1. Explain Heuristic search strategies in detail? 2. Explain the Greedy best-first search? 3. Explain A* search in detail? 4. Explain the memory bounded heuristic search algorithms? 5. Explain the local search algorithm using Hill-climbing search 6. Explain CSP in detail 7. Explain the backtracking search algorithm for CSP 8. Explain the alpha beta pruning? 9. Explain the minimax algorithm with example 10. Explain briefly about the eight queens problem? UNIT III Part A 1. Define Planning. 2. List the two example agents in planning.

3. State about classical planning. 4. List the representation of States in planning. 5. Explain about representation of actions in planning. 6. Define action schema. 7. Difference between STRIPS language and ADL language. 8. What is the cost of an each action? 9. Mention the types of Axioms. 10. State about Symbol splitting.
11. Give definition of bidirectional search.

12. What is called as Critical path? 13. State about Sensor less planning. 14. Define least commitment strategy. 15. Define partial order planner.
16. State about linearization of the partial-order plan.

17. Define consistent plan. 18. List the use of serial planning graph. 19. Explain job shop scheduling. 20. List the purpose of critical path method. 21. What is the working process of a sensor less planning agent? 22. List the process of a continuous planning agent. 23. What is called games against nature? 24. Mention the uses of closed world assumption. 25. List the two sensory actions. Part B
1. Discuss briefly about Planning Problem with suitable example. 2. Narrate about Planning with State-Space Search and its types. 3. Explain Partial-Order Planning. 4. Write about Planning Graphs and graph plan algorithm.

5. State i).Sensor less planning ii). Conditional planning iii). Continuous planning and

iv).

Classical planning. 6. Explain Conditional Planning in fully and partially observable environments.
7. Discuss about execution monitoring and replanning.

8. Explain Continuous Planning with a neat sketch.

9. Briefly explain multi agent planning and multi body planning.

10. Discuss about cooperation and coordination in planning. UNIT IV Part A 1. Define uncertainty. 2. What is decision theory? 3. State atomic events. 4. Define prior probability. 5. Define Conditional probability. 6. Write about decision tree. 7. Briefly explain about Boolean random variables. 8. State discrete random variables. 9. Define continuous random variables. 10. Mention the uses of atomic events. 11. State frequentist position. 12. Why the axioms of probability are reasonable. 13. Define Bayes rule. 14. A simple Bayesian network in which Weather is independent of the other three variables. 15. State sparse systems. 16. Define polytrees. 17. Explain about monte Carlo algorithm. 18. Write shortly about Rejection sampling. 19. Define Markov chain. 20. Briefly explain about Belief function. 21. State Monserial dynamic programming. 22. Define Cutset conditioning. 23. Write short notes on Logic sampling. 24. Give the details of Importance sampling. 25. DegineTruth-functional. Part B
1. State uncertainty and explain about handling uncertainty. 2. Narrate about Basic probability notations. 3. Discuss about the axiom of probality. 4. Explain about Bayes rule and its uses.

5. Discuss about exact inference in Bayesian rule.

6. Narrate about approximate inference in Bayesian rule.

7. Discuss inference in temporal model. 8. Explain about hidden markov models 9. State i). Time ii). Uncertainty.

10. States and observations discuss. UNIT V Part A 1. Define Learning. 2. Write about performance element. 3. How does the learning element modified. 4. What are the three cases of machine learning? 5. Define parity function. 6. Define majority function. 7. When can we say a set as a training set? 8. Define test set. 9. What is called the learning curve? 10. State happy graphs. 11. Write shortly about ensemble learning. 12. Which is called as PAC-learning algorithm? 13. Define stationarity assumption. 14. State decision list. 15. Define kolmogorov complexity. 16. Define the volume of machine learning. 17. List the use of current best hypothesis. 18. Which is called dropping conditions. 19. State least commitment algorithm. 20. Define boundary set. 21. Which relationship is called as entailment constraint? 22. Draw a block diagram of cumulative learning process. 23. Define functional dependencies. 24. Which algorithms are called as constructive induction algorithms. 25. Define inverse resolution. Part B 1. Explain about forms of learning and inductive learning. 2. State i). Learning decision trees, ii). Noise and over fitting. 3. Discuss about ensemble learning. 4. Explain about learning decision trees with suitable examples. 5. Discuss the logical formulation of learning. 6. Narrate knowledge in learning.

7. Discuss about learning and inductive learning. 8. State and discuss about explanation based learning with suitable examples. 9. Discuss inductive logic programming. 10. Explain top-down inductive learning methods.