Scribd
Upload
22 views

AI Unit Wise Question

The document discusses artificial intelligence and provides questions for 5 units on topics like search algorithms, constraint satisfaction problems, neural networks and optimization techniques. Key algorithms discussed include depth-first search, breadth-first search, A*, genetic algorithms, simulated annealing and ant colony optimization.

Uploaded by

Arun Chaudhari
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
22 views

AI Unit Wise Question

The document discusses artificial intelligence and provides questions for 5 units on topics like search algorithms, constraint satisfaction problems, neural networks and optimization techniques. Key algorithms discussed include depth-first search, breadth-first search, A*, genetic algorithms, simulated annealing and ant colony optimization.

Uploaded by

Arun Chaudhari
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

An Introduction to Artificial Intelligence

(Unit wise Questions)

Unit-I
1. Define AI. Explain Foundation of AI.
2. Explain History of AI.
3. Explain State of art of AI.
4. Explain Stages of AI with Examples.
5. Agents of AI. (May ask any one. Prepare all agents)
6. Explain PEAS representation with example.
7. Explain the concept rationality.
8. Explain Nature of environment.(Diagram is expected with explaination).

Unit –II
1. Explain Generate and Test.
2. Explain DFS.( Write algorithm or steps with example and brief theory.
Mention Time complexity,Space complexity,optimality,and
completeness.)
3. Explain BFS.( Write algorithm or steps with example and brief theory.
Mention Time complexity,Space complexity,optimality,and
completeness.)
4. Differenciate BFS and DFS.
5. Explain Depth bound DFS(Write algorithm or steps with example and
brief theory. Mention Time complexity,Space complexity,optimality,and
completeness.)
6. Explain DFID.( Write algorithm or steps with example and brief theory.
Mention Time complexity,Space complexity,optimality,and
completeness.)
7. Explain heuristic function. How to calculate heuristic value.
8. Explain Best First search. (Write algorithm or steps with example and
brief theory. Mention Time complexity,Space complexity,optimality,and
completeness.)
Note: It is not BFS(Breadth First search). On this algorithm you may ask
for one graph or puzzle to solve. So practice 8 puzzle and graph based on
this algorithm(Best first search).
9. Explain Hill climbing algorithm.
10. What are the limitations of Hill climbing algorithm(Local
maxima,platue,ridge)
11. Explain beam search.
12. Explain Tabu search.

Unit-III
1. Explain simulated annealing.
2. Explain genetic algorithm.(Define flowchart of genetic algorithm.
Explain two techniques.1.crossover 2. Mutation.)
3. Write note on Neural network(theory ,neural network diagram,input
output with function).
4. Write a note on ant colony optimization.(algorithm and theory is
expected.)
5. Explain escaping local optima/maxima.
6. Explain iterative hill climbing.

Unit-IV
1. Explain dijkstra algorithm with example.
2. Explain a* algorithm with example. State properties of A*.(time
complexity,space complexity,optimality,completeness).
Note: Do practice examples on A* algorithm of graphs and 8 puzzle.
3. Explain iterative deepening A* algorithm.
4. Explain recursive best first search with example.(refer notes.)
5. Explain importance of pruning closed and open list of A*
algorithm.(explain in brief each algo under pruning open and pruning
closed.)

Unit-V
1. Explain algorithm for backtracking and look ahead strategies of
constraint satisfaction(looka head strategies : forward checking
explain in brief.
2. Explain constraint satisfaction with N-Queen problem any one.
3. Example example of real time Constraint satisfaction problem.(n
queen or map coloring)
4. Explain constraint satisfaction problem in higher order
consistency.(Path consistency and I consistency.)

You might also like