Scribd
Upload
154 views2 pages

IA1 - Question Bank - IA1 - AIDS - 1 - Feb - 2025

The document is a question bank for an AI course, divided into two units with various questions categorized by marks. Unit 1 focuses on AI approaches, components, task environments, and different types of agents, while Unit 2 covers search algorithms, constraints satisfaction problems, and adversarial search. Each section includes both 2-mark and 5-mark questions that require detailed explanations and examples.

Uploaded by

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

IA1 - Question Bank - IA1 - AIDS - 1 - Feb - 2025

The document is a question bank for an AI course, divided into two units with various questions categorized by marks. Unit 1 focuses on AI approaches, components, task environments, and different types of agents, while Unit 2 covers search algorithms, constraints satisfaction problems, and adversarial search. Each section includes both 2-mark and 5-mark questions that require detailed explanations and examples.

Uploaded by

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

AIDS- 1Question Bank

Unit 1:
2 marks :

1. What are the 4 approaches of an AI?


2. What are the various domains of AI?
3. What are the building blocks / components of AI?
4. What are the specification of Task environment of a problem (PEAS) ?
5. List down the task environment of the 5 examples.
6. Compare and contrast the properties of task environment.

5 marks

7. Explain simple reflex based agent with a neat diagram and an example.
8. Explain goal-based agent with a neat diagram and an example.
9. Explain model-based agent with a neat diagram and an example.
10. Explain utility-based agent with a neat diagram and an example.
11. Explain learning agent with a neat diagram and its 4 important components function with an
example.

Unit 2:
2 marks

1. List down the types of Uninformed search.


2. List down the types of Uninformed search.
3. List do List down the types of Uninformed search.
4. List down the types of Informed search.
5. How is the performance captured for uninformed search algorithm and mention with their
respective performance values?
6. Why heuristic is always optimized and is not overestimated.
7. Compare and contrast between informed and uninformed search.
8. Explain the hill climbing or local search algorithm ?
9. List down the issues related to local search algorithm.
10. What is simulated annealing?
11. What is CSP?
12. What are the verities of constraints?
13. What do you mean by arc consistency ?
14. What do you mean by k consistency
15. Solve for any cryptarithmetic problem.
16. Solve for any real world cryptarithmetic problem.

5 marks

17. Explain in detail with neat diagram on


a. BFS
b. DFS
c. Uniform cost Search
d. Depth Limited Search
e. Iterative Deepening search
f. A*
g. Breadth FS
h. Greedy Search Algorithm
i. Simulated Annealing
j. Hill climbing or Local Search
18. Why A* is always provides an optimized solution.
19. Explain with an example forward tracking algorithm in CSP?
20. Discuss the advantage of forwards tracking algorithm
21. Explain with an example backwards tracking algorithm in CSP?
22. Discuss the issues related to backwards tracking algorithm ?
23. What do you mean by adversarial search?
24. Solve for any given problem for minimax algorithm & alpha-beta pruning algorithm.

You might also like