DECEMBER 2021 P/ID 17633/PCATF

Time : Three hours Maximum : 80 marks

PART A — (10 × 2 = 20 marks)

Answer any TEN questions.

1. Write down the benefits of AI.

2. What do you mean by Intelligent agent?

3. Name the uninformed search strategies.

4. What is meant by Iterative deepening?

5. Write the concept behind simulated Annealing.

6. What are called stochastic games?

7. What is meant by Alpha-Beta pruning?

8. What is called constraint propagation?

9. Write down the syntax and semantics of First

order logic.

10. What do you mean by ontological Engineering?

11. How to do reasoning with default information?

12. Write down the Bayes model.

 PART B — (5 × 6 = 30 marks)

Answer any FIVE questions.

13. Briefly discuss the history of AI.

14. Explain the concept of Rationality.

15. Briefly describe Depth first search algorithm.

16. Describe Heuristic search strategies.

17. Explain steepest ascent Hill climbing algorithm.

18. Write short notes on predicate logic.

19. Explain Baye’s theorem.

PART C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Explain TIC TAC TOE problem.

21. Describe Greedy Best first search algorithm.

22. Explain Alpha-Beta pruning algorithm.

23. Describe the backtracking search for CSPs.

24. Explain the various methods of Knowledge

representation.

———————
2 P/ID 17633/PCATF
DECEMBER 2022 P/ID 17633/PCATF

Time : Three hours Maximum : 80 marks

PART A — (10 × 2 = 20 marks)

Answer any TEN questions.

1. Define the term AI.

2. What do you mean by Intelligent Agent?

3. Name different types of learning.

4. What is meant by Heuristic search?

5. Write the goal of recursive best first search.

6. Define the term uncertainty.

7. What is meant by Alpha-Beta pruning?

8. What is called constraint propagation?

9. Differentiate between forward chaining and

backward chaining.

10. Write down the syntax and semantics of First

order logic.
11. Define Baye’s theorem.

12. Write any two methods to handle uncertainty.

PART B — (5 × 6 = 30 marks)

Answer any FIVE questions.

13. Explain the applications of AI.

14. Explain how agents should act.

15. Compare BFS and DFS search algorithms.

16. What do you mean by Heuristic search? Explain.

17. Describe Hill climbing algorithm.

18. Explain about resolution mechanism in First order

logic.

19. Describe Naive Bayes model.

PART C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Discuss on Intelligent agents and Environment.

21. Explain Greedy Best first search algorithm.

22. Describe AND-OR search trees with neat sketch.

2 P/ID 17633/PCATF
23. Explain in detail about constraint satisfaction
problem with diagram.

24. Explain about automated planning.

——————–––––—

3 P/ID 17633/PCATF
MAY 2022 P/ID 17633/PCATF

Time : Three hours Maximum : 80 marks

PART A — (10 × 2 = 20 marks)

Answer any TEN questions

1. What is called Intelligence?

2. Write down the benefits of AI.

3. What are called redundant paths?

4. What is meant by Heuristic search?

5. How to do local search in continuous spaces?

6. Define forward pruning.

7. What are the limitations of game search?

8. What is called constraint propagation?

9. What is CSP?

10. Write a note on First order logic.

11. How to do Automated planning?

12. Write any two methods of handle uncertainty.

 PART B — (5 × 6 = 30 marks)

Answer any FIVE questions

13. Explain Water jug problem.

14. Explain the risks in AI.

15. Briefly describe Iterative deepening search

method.

16. Describe A* algorithm.

17. Explain simple Hill climbing algorithm.

18. Write short notes on prepositional logic.

19. Explain Baye’s model.

PART C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Describe the history of AI.

21. Compare and contrast BFS vs DFS algorithm.

22. Explain AND – OR tree traversal.

23. Explain constraint satisfaction problem with an

example.

24. Discuss the algorithms for classical planning.

———————

2 P/ID 17633/PCATF
MAY 2023 P/ID 17633/PCATF

Time : Three hours Maximum : 80 marks

PART A — (10 × 2 = 20 marks)

Answer any TEN questions.

1. Write down the risks in AI.

2. What are the components of Intelligent agent?

3. Name the uniformed search strategies.

4. What is meant by Iterative deepening?

5. Write the concept behind simulated Annealing.

6. What is local beam search?

7. What are called stochastic games?

8. What is called constraint propagation?

9. What are the merits of forward pruning?

10. Write a note on First order logic.

11. How to do Automated planning?

12. What is meant by ontological engineering?

 PART B — (5 × 6 = 30 marks)

Answer any FIVE questions.

13. Bring out the History of AI.

14. Explain TIC TAC TOE game using problem

solving approach.

15. Describe DFS search algorithm.

16. Explain Mini-Max search procedure with suitable

example.

17. Write about Monte Carlo tree search.

18. Explain theorem proving using propositional logic.

19. Explain Baye’s rule and its use.

PART C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Explain the following:

(a) Intelligent Agents
(b) Structure of Agents

21. Explain A* search algorithm.

2 P/ID 17633/PCATF
22. Describe Alpha–Beta pruning with neat sketch.

23. Explain about inference and Backtracking in CSP.

24. Discuss the various methods for Knowledge

representation.

––————————

3 P/ID 17633/PCATF
MAY 2021 P/ID 17633/PCATF

Time : Three hours Maximum : 80 marks

PART A — (10 × 2 = 20 marks)

Answer any TEN questions.

1. Define the term AI.

2. Differentiate between Agent and Program.

3. What is meant by meta reasoning?

4. What is meant by knowledge base?

5. Write the goal of recursive best first search.

6. Define the term uncertainty.

7. What is meant by Alpha–Beta pruning?

8. What is called constraint propagation?

9. Differentiate between forward chaining and

backward chaining

10. What are the different types of logics used in

reasoning?

11. Define Baye’s theorem.

12. What are the techniques used to overcome

uncertainty inherent?
 PART B — (5 × 6 = 30 marks)

Answer any FIVE questions.

13. Discuss the risks and benefits of AI.

14. Explain how agents should act.

15. Briefly describe Breadth first search algorithm.

16. What do you mean by Heuristic search? Explain.

17. Describe Hill climbing algorithm.

18. Write short notes on propositional logic.

19. Explain Naïve Bayes model.

PART C — (3 × 10 = 30 marks)

Answer any THREE questions.

20. Discuss on Intelligent agents and Environment.

21. Describe A* algorithm.

22. Explain Mini-Max search procedure.

23. Explain in detail about constraint satisfaction

problem with diagram.

24. Explain the algorithm for classical planning.

———————

2 P/ID 17633/PCATF