VTU Previous Year Question Papers BE CS Seventh Semester Artificial Intelligence January 2010
VTU Previous Year Question Papers BE CS Seventh Semester
Artificial Intelligence January 2010
Note: Answer any FIVE full questions, selecting at least TWO questions from each part.
1 a. With examples, explain different types of task environments.
b. Explain Breadth-First-Search (BFS) strategy.
2 a. Explain A* search strategy. Prove :
i) A* using TREE-SEARCH is optimal if h(n) is admissible.
ii) A* using GRAPH-SEARCII is optimal if h(n) is consistent.
b. Write the algorithm for online search agent that uses depth first exploration.
3 a. Write the syntax of propositional logic. Write BNF grammar for sentences in propositional logic.
b. Write the algorithm for Wumpus – world agent to find pits, wupuses and safe squares.
4 a. Write the syntax of first order logic using BNF.
b. List and explain the steps involved in knowledge engineering projects.
5 a. Write toward chaining algorithm.
b. Explain aspects of prolog that fall outside standard logical inference.
6 a. Explain with examples, how first order logic expresses facts about categories.
b. Explain the ontology of situation calculus.
7 a. Compare how STRIPS and ADL programming languages represent planning problems.
b. What is Bayesian network? Explain how it is used to represent knowledge?
8 a. Write the decision tree learning algorithm.
b. Explain how the applicability of decision trees is broadened.