Scribd
Upload
106 views4 pages

AI IMP Question Bank

Imp question bank of AI

Uploaded by

patelsarthak615
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
106 views4 pages

AI IMP Question Bank

Imp question bank of AI

Uploaded by

patelsarthak615
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/ 4

Gyanmanjari Institute of Technology

Department of Information Technology

Artificial Intelligence (3161608)

IMP Question Bank

Chapter 1: What is AI
1. What is artificial intelligence? Define the different task domains of artificial intelligence.
2. What are the AI problem characteristics? Discuss in detail with example.
3. Discuss Turing Test.

Chapter 2: Problems, State Space Search & Heuristic Search Techniques


1. Explain depth first search (DFS) and breadth first search (BFS) with suitable examples.
2. Compare Breath first search and Depth first search method.
3. Discuss state space search problem.
 8-puzzle problem
 Water jug problem
 N-queen problem
4. Describe:
 IDS
 IDDFS
5. Explain simulated annealing algorithm. OR
Discuss Simulated Annealing method of search. OR
Discuss Simulated Annealing search method. How is it different than greedy method?
6. Explain A* algorithm in detail. OR
What do you mean by admissibility of an algorithm? Is A* algorithm an admissible one?
When? (Twisted) OR
Discuss A* algorithm. Also give one example to explain it.
7. What do you mean by the problem of plateau occurring in hill climbing? How can it be
solved? OR
Discuss hill climbing search method. Also discuss limitations and ways to overcome these
limitations.
8. Discuss limitations of Hill climbing search method. OR
What is hill climbing? Explain Simple Hill Climbing and Steepest- Ascent Hill Climbing.
OR
What is local maximum, Plateau and Ridge?
9. Discuss steepest ascent hill climbing. OR
Explain the algorithm for Steepest-Ascent Hill Climbing. OR
Briefly describe the situations in which hill climbing may fail to find a solution.
10. What is heuristic function? Discuss with an example

GMIT, Bhavnagar Prof. Ekta Unagar


11. Consider the following initial and goal states of 8 puzzle problem. Draw the search tree.
Apply A* algorithm to reach from initial to goal state and show the solution. Consider
Manhattan distance as a heuristic function.(i.e. sum of distance that tiles are out of place).

Initial state Goal state

12. Discuss Iterative Deepening search.

Chapter 3: logical Agents/ Order Logic & Chapter 4: Inference in First Order
Logic
1. Differentiate between declarative and procedural representation of knowledge.
2. Explain the different approaches to knowledge representation.
3. Explain different knowledge representation issues in detail
4. Explain why it is necessary to choose granularity for knowledge representation.
5. Predicate logic conversion from normal sentences and resolution problem (any)
6. Define knowledge base agent in AI.

Chapter 5: Uncertainty
1. Explain the Bay’s theorem.
2. Explain the Bayesian Networks.

Chapter 6: Probabilistic Reasoning


1. What is Semantic Nets? Consider the following statements and draw the semantic net:

 Tom is a cat.
 Tom caught abird.
 Tom is owned byJohn.
 Tom is ginger incolor.
 Cats likecream.
 The cat sat on the mat.
 A cat is a mammal.
 A bird is an animal.
 All mammals are animals.Mammals have fur.

GMIT, Bhavnagar Prof. Ekta Unagar


2. Differentiate fuzzy logic and crisp logic. Also describe set operations on fuzzyand crisp
logic.
3. Explain difference between Boolean and fuzzy set membership using a suitable example.
4. What is the importance of fuzzy logic? How do you perform union, intersection
and complement operation on fuzzy sets?
5. Discuss Bayesian network and its applications.

Chapter 7: Game Playing: Overview, and Example Domain


1. Explain Goal Stack planning using suitable example.
2. Explain the Minimax Procedure with example.
3. Explain the Alpha-Beta Cutoffs Procedure in Game Playing
4. Consider the game tree of Fig. 1 in which the static scores are from first player‟s point of
view. Suppose the first player is maximizing player. Applying mini-max search, show the
backed-up values in the tree. What move will the MAX choose?

If the nodes are expanded from left to right, what nodes would not be visited using alpha-beta
pruning.

5. Consider the game tree given below, in which the evaluation function values are shown
below each leaf node for the max player. Assume that the root node corresponds to the
minimizing player. Assume that the search always visits children left-to-right. Compare the
backup values computed b the minimax algorithm by writing values at the appropriate nodes
in the tree given.

GMIT, Bhavnagar Prof. Ekta Unagar


Chapter 8: Statistical Learning Methods
1. Discuss statistical learning methods.
2. Enlist some applications of neural network.
3. What do you understand by classification in neural network? Briefly explain percepton
algorithm and also narrate its limitations.

Chapter 9: Introduction to Prolog


1. Introduce Prolog, discussing its syntax and numeric functions. Explore basic list
manipulation functions in Prolog.
2. What are the Applications, Features and Limitations of Prolog?
3. Justify using an example that Prolog uses Backward chaining to prove or answer any given
goal.
4. What is Red Cut and Green Cut in Prolog?
5. Write a prolog program to reverse the given list.
6. Checking membership of an item in a given list, concatenating two lists, and deleting an n
item in a given list.
7. Write a prolog program to find factorial of a given number.
8. Explain how list is used in Prolog.
9. Demonstrate the use of Repeat Predicate in Prolog with example.
10. Write a prolog program to reverse the given list.
11. Checking membership of an item in a given list, concatenating two lists, and deleting an n
item in a given list.
12. Write a prolog program to find factorial of a given number.
13. Explain how list is used in Prolog.
14. Demonstrate the use of Cut and Fail Predicates in Prolog with example.
15. Write a prolog program to count vowels in a list of characters.
16. Write a prolog program to find the sum of elements of a List.

GMIT, Bhavnagar Prof. Ekta Unagar

You might also like