Scribd
Upload
76 views2 pages

Unitwise Question Bank

The document discusses artificial intelligence and related concepts across six units. It covers topics like intelligent agents, search algorithms, game playing techniques, knowledge representation, reasoning and planning. Several questions are provided under each unit to explain key AI concepts along with examples.

Uploaded by

Aman Kumar
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
76 views2 pages

Unitwise Question Bank

The document discusses artificial intelligence and related concepts across six units. It covers topics like intelligent agents, search algorithms, game playing techniques, knowledge representation, reasoning and planning. Several questions are provided under each unit to explain key AI concepts along with examples.

Uploaded by

Aman Kumar
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
You are on page 1/ 2

Unit-I

1. What is AI? Explain any one application of AI.


2. What is AI? Define Artificial intelligence on the basis of “ System that think
rationally ” and “ System that act like humans”
3. What is rationality? Define an intelligent agent.
4. Explain Goal Based Agent and Utility based Agent architecture with proper diagram.
5. What is PEAS information? Design the PEAS information for Taxi Driver Agent and
Automated Robot in a manufacturing plant.
6. Mention various properties and tasks of environment.
7. Discuss about agents and environments.
8. Explain in detail, the structure and types of different intelligent agents.
9. What are the main aspects considered before solving a complex AI problem?
10. What is state space representation in AI?

Unit-II
1. Discuss any 2 uninformed search methods with examples
2. Differentiate between Uninformed and Informed Search technique.
3. Define Heuristic search and heuristic function.
4. Show that DFS is neither complete nor optimal search.
5. Write the algorithm of Depth First Search.
6. What are local search algorithms? Explain Hill climbing search.
7. Draw the state space graph of Hill climbing search. What are the draw backs of this
algorithm? Also discuss about time space complexity of this algorithm.
8. What is Best first search algorithm, explain? Give an example also. Compare best first
search with Hill climbing approach.
9. Explain A* search algorithm. Discuss about the admissibility of A* algorithm.
10. What is problem reduction technique? Using this explain AO* search with an
example.
11. Explain AO* algorithm with a suitable example. State the limitations in the
algorithm?
12. Compare between A* search and AO* search algorithm
13. Explain the nature of heuristics with example. What is the effect of heuristics
accuracy?

Unit-III
1. How is AI useful in game playing techniques? Describe what is adversarial search?
2. Explain MINIMAX search technique/algorithm with an example.
3. What is alpha beta pruning / search?
4. Evaluate the winning cost of MAX player in following game tree using alpha beta
pruning.
5. Explain alpha-beta pruning algorithm and the Minmax game playing algorithm with
example?
6. Write a Minmax search algorithm for two players. How use of alpha and beta cut-offs
will improve performance?
7. Explain the working of unification algorithms.
8. Explain alpha beta tree search and cut off procedure in detail with example.
9. What are the issues that need to be addressed for solving CSP efficiently? Explain the
solutions to them.
10. Explain in detail the concept of backtracking and constraint propagation and solve the
n-Queen using this algorithm.
11. Write a short note on Monte Carlo Tree search and list its limitations.
12. Apply Constraint Satisfaction method to solve following problem SEND + MORE=
MONEY (TWO + TWO =FOUR, CROSS + ROADS= DANGER)

Unit-IV
1. List the inference rules used in propositional logic. Explain them in detail with
suitable example.
2. Explain syntax and semantic of First Order Logic in detail.
3. Detail the algorithm for deciding entailment in prepositional logic.
4. Explain knowledge representation structure and compare them.
5. Explain knowledge based agent in detail.
6. Describe WUMPUS WORD environment specify PEAS properties and types of
environment for the same.
7. Explain various method of knowledge representation with example.
8. What is logic?
9. What is propositional logic? Write syntax and semantics and example sentences for
propositional logic
10. Explain the inference process in case of propositional logic with suitable examples.
11. Define the syntactic elements of First Order Logic.

Unit-V
1. Explain forward and backward chaining. What factors justify whether reasoning is to
be done in forward or backward chaining?
2. What are the reasoning patterns in propositional logic? Explain them in detail.
3. Explain unification algorithm with an example.
4. Explain knowledge representation structure and compare them.
5. What do you mean by ontology of situation calculus?
6. Differentiate between forward and backward chaining.
7. Write a short note on resolution.

Unit-VI
1. Analyse various planning approaches in detail.
2. Discuss AI and its ethical concerns.
3. Explain limitations of AI.
4. Explain the terms for time and schedule from perspective of temporal planning.
5. Write a detail note on AI architecture.
6. What is future of AI?
7. Explain heuristic for planning.
8. Describe the hierarchical planning.
9. What are different languages used for implementation of planning.
10. What are the algorithms for classical planning?
11. Describe in detail analysis of planning approaches.
12. List and explain AI components.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy