Engineering B.E. (Computer Engineering) Sem 7 Artificial Intelligence Dec 2018 Question Paper - Mumbai University | munotes

Questions asked in this paper

1. Q1 Attempt any four (4) questions from the following 20 marks
   • (a) Give PEAS description for a Self Driving Car agent. Characterize its environment
   • (b) Give the initial state, goal test, successor function, and cost function for the
   • (c) What will be the job of each of the components (Performance element, Learning element, Critic and problem generator) of learning agent?
   • (d) Consider an 8 puzzle problem with the following initial state and goal state Generate successors at next two levels. Apply number of misplaced tiles as the heuristic function. Which successor nodes will be selected at each level if we apply
   • (e) Convert the following English sentence into predicate logic and then into CNF “The culprit was tall and dark”
2. Q2 (a) Explain decision tree learning with an example. What are decision rules? How to use it for classifying new samples? 10 marks
   • (b) Write first order logic equivalent of the following statements: 10
   • (ii) The culprit has to be one from Tinker, Tailor and Butler
   • (iii) Whoever can read is literate
   • (v) Some birds cannot fly
3. Q3 (a) Design a classical planner for air cargo transportation problem using STRIPS. The problem involves loading, unloading cargo and flying it from place to place. Define three actions: Load, Unload and Fly. The actions affect two predicates: In(c, p) means that cargo c inside plane p, and At(x, a) means that object x (either plane or cargo) is at 10 marks
   • (b) Give a formal definition of a Bayesian Belief Network (BBN). Illustrate the process of constructing a BBN with a suitable scenario. What type of inferences can be drawn from BBN network? search (DLS) and Iterative Deepening search algorithms based on performance measure with justification: Complete, Optimal, Time and Space complexity 10
   • (b) Write a pseudo code for alpha-beta algorithm. Apply alpha-beta pruning on example given in Figure 1 considering first node as max 10
4. Q5 (a) How will you convert the propositional logic statement into CNF? Give a suitable example at each step? 10 marks
   • (b) Consider the graph given in Figure 2 below. Assume that the initial state is S and the goal state is G. Show how A* Search would create a search tree to find a path from the initial state to the goal state: At each step of the search algorithm, show which node is being expanded, and the content of fringe (OPEN). Also report the eventual solution found by the algorithm, and the solution cost. Assuming the straight-line distance as the heuristics function: h(S)= 10
5. Q6 Answer any two (2) of the following 20 marks
   • (a) are the steps involved in natural language processing (NLP) of an English sentence? Explain with an example sentence
   • (b) Draw and describe each component in the Architecture of Expert System with a
   • (c) Explain how Genetic algorithms work. Define the terms chromosome, fitness function, crossover and mutation as used in Genetic algorithms

Read from the scan above, so a character or two may differ. The scan is the original.