JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD MCA ARTIFICIAL INTELLIGENCE Previous Question Paper (March/April - 2023 - R20)
Note: i) Question paper consists of Part A, Part B.
ii) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions.
iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions.
Part A
Discuss in detail about simulated annealing search.
Answer
Simulated annealing is a stochastic local search algorithm that combines hill climbing with a random walk to escape local optima. It mimics the metallurgical process of annealing, where a material is heated and then slowly cooled to reach a low-energy crystalline state.
The algorithm evaluates a neighbor state and accepts it if it improves the objective function. If the move is worse, it is accepted with a probability
Explain the concept of optimal decision in games.
Answer
An optimal decision in a game is one that maximizes the agent's utility, assuming the opponent is also playing optimally to minimize that same utility. In zero-sum games, this is achieved using the Minimax algorithm.
The algorithm explores the game tree to compute the minimax value of each state. For a state
Describe the concept of knowledge engineering in first order logic.
Answer
Sign in to view the complete answer paper.
State and explain the concept of classical planning.
Answer
Sign in to view the complete answer paper.
Show how Inference is done using full joint distributions?
Answer
Sign in to view the complete answer paper.
Part B
What is an agent? Explain the basic kinds of agent program.
Answer
Sign in to view the complete answer paper.
With the help of an example explain about greedy best first search?
Answer
Sign in to view the complete answer paper.
Explain the process of local search in continuous spaces.
Answer
Sign in to view the complete answer paper.
Describe in detail about the hill climbing search algorithm.
Answer
Sign in to view the complete answer paper.
Using constraint satisfaction solve the following Crypt-Arithmetic Problem. TWO + TWO = FOUR
Answer
Sign in to view the complete answer paper.
Explain Wumpus world logic problem with an example.
Answer
Sign in to view the complete answer paper.
Illustrate the concepts of agents based on propositional logic.
Answer
Sign in to view the complete answer paper.
Represent the following statements in predicate logic:
- Marcus tried to assassinate Caesar.
- All Pompeian’s were Roman.
- All Romans were either loyal to Caesar or hated him.
- Everyone is loyal to someone.
- People only try to assassinate rulers they are not loyal to.
Answer
Sign in to view the complete answer paper.
Compare and contrast between forward chaining and backward chaining?
Answer
Sign in to view the complete answer paper.
Explain how reasoning is performed with default information?
Answer
Sign in to view the complete answer paper.
Illustrate the algorithms to explain how planning is performed using state space search.
Answer
Sign in to view the complete answer paper.
Explain the concept of hierarchal learning with the help of examples.
Answer
Sign in to view the complete answer paper.
Construct a Bayesian Network and define the necessary CPTs for the given scenario. We have a bag of three biased coins a,b and c with probabilities of coming up heads of 20%, 60% and 80% respectively. One coin is drawn randomly from the bag (with equal likelihood of drawing each of the three coins) and then the coin is flipped three times to generate the outcomes X1, X2 and X3.
Answer
Sign in to view the complete answer paper.
With the help of an example explain how decision trees concept is used for learning?
Answer
Sign in to view the complete answer paper.