Scribd
Upload
5 views2 pages

CS3491 - Artificial Intelligence

The document outlines the syllabus for CS3491, focusing on Artificial Intelligence and Machine Learning, specifically Unit 1 which covers AI definitions, search techniques, and various types of AI agents. It includes short answer questions, long answer questions, and case studies from different examination periods. Key topics include search algorithms, constraint satisfaction problems, and the application of AI in real-world scenarios.

Uploaded by

nnce ece
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views2 pages

CS3491 - Artificial Intelligence

The document outlines the syllabus for CS3491, focusing on Artificial Intelligence and Machine Learning, specifically Unit 1 which covers AI definitions, search techniques, and various types of AI agents. It includes short answer questions, long answer questions, and case studies from different examination periods. Key topics include search algorithms, constraint satisfaction problems, and the application of AI in real-world scenarios.

Uploaded by

nnce ece
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

CS3491 – ARTIFICIAL INTELLIGENCE &

MACHINE LEARNING

UNIT 1: INTRODUCTION TO AI & SEARCH TECHNIQUES

Part A – 2 Marks (Short Answer Questions)

April/May 2024
1. Define Artificial Intelligence.
2. What are the different types of AI agents?
3. Differentiate between Uninformed and Informed Search.
4. What is a Constraint Satisfaction Problem (CSP)?
5. Mention any two real-world applications of AI.
Nov/Dec 2023
6. Define an Intelligent Agent and list its components.
7. Explain the importance of A* Search Algorithm.
8. Differentiate between BFS and DFS.
9. What is the role of heuristics in search algorithms?
10. What is a utility-based agent?
April/May 2023
11. What is a model-based agent?
12. State the difference between problem-solving agents and learning agents.
13. Define Iterative Deepening Search (IDS).
14. What are the main components of a search problem?
15. Explain the use of Greedy Best-First Search.

Part B – 13 Marks (Long Answer Questions)

April/May 2024
16. (a) Compare different types of search algorithms with examples.
(b) Explain the A* algorithm with a suitable example.
17. (a) Explain Constraint Satisfaction Problems (CSPs) with real-world applications.
(b) Discuss the differences between uninformed and informed search strategies.
Nov/Dec 2023
18. (a) Explain in detail the various types of Intelligent Agents with examples.
(b) Describe the structure of an AI agent.
19. (a) Explain BFS and DFS algorithms with examples.
(b) Describe the role of heuristics in AI search.
April/May 2023
20. (a) What are the key characteristics of a problem-solving agent? Explain with an
example.
(b) Write short notes on:
(i) Iterative Deepening Search (IDS)
(ii) Greedy Best-First Search
Nov/Dec 2022
21. (a) Explain the differences between model-based and simple reflex agents.
(b) Discuss the different search techniques used in Artificial Intelligence.
Part C – 15 Marks (Analytical & Case Study Questions)

April/May 2024
Case Study:
A robot is navigating a maze. The path cost is based on the number of moves.
Formulate this as a search problem.
Apply BFS and DFS to find a solution.
Compare BFS, DFS, and A* algorithms.
Nov/Dec 2023
Case Study:
An AI system is used for medical diagnosis. The system uses a knowledge
base and an inference engine.
Explain how an AI agent can be designed for this system.
What type of search strategy would be ideal? Justify your answer.
April/May 2023
Problem-Solving Question:
Consider a tic-tac-toe game where AI must make the best move.
How can this be formulated as a search problem?
Which search strategy is best suited for this problem?
Nov/Dec 2022
Case Study:
A self-driving car uses AI for route planning.
Explain how A* search can be used for pathfinding.
Compare A* with Greedy Best-First Search in this scenario.

You might also like