Scribd
Upload
418 views2 pages

Apollo Institute of Engineering and Technology: Question Bank Branch: IT Subject: Artificial Intelligence (3161608)

This document contains a question bank for an Artificial Intelligence course covering 9 chapters. It includes over 40 questions on topics such as state space search techniques, logical agents, first order logic, uncertainty, probabilistic reasoning, game playing, statistical learning methods, and Prolog. Students are asked questions ranging from defining and explaining core AI concepts to solving problems using different AI techniques.

Uploaded by

Cricket top Hits
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
418 views2 pages

Apollo Institute of Engineering and Technology: Question Bank Branch: IT Subject: Artificial Intelligence (3161608)

This document contains a question bank for an Artificial Intelligence course covering 9 chapters. It includes over 40 questions on topics such as state space search techniques, logical agents, first order logic, uncertainty, probabilistic reasoning, game playing, statistical learning methods, and Prolog. Students are asked questions ranging from defining and explaining core AI concepts to solving problems using different AI techniques.

Uploaded by

Cricket top Hits
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

AI (3161608) Semester: VI

Apollo Institute of Engineering and Technology

Question Bank
Branch: IT
Subject: Artificial Intelligence (3161608)

Chap 1. What is AI?


1. Define AI ? Explain the characteristics of AI problem.
2. Discuss Turing test.

Chap 2. Problems ,State Space Search & Heuristic Search Techniques


1. Explain the state space with the use of water jug problem .
2. Solve 8 puzzle problem by any AI technique.
3. Solve Travelling Salesman Problem using any AI technique.
4. Discuss iterative deepening search. Also give one example to explain.
5. Explain A* algorithm in detail.
6. Solve the following crypt arithmetic problem:
C R O S S
+ R O A D S
------------------------------
D A N G E R

7. What is hill Climbing ? Explain Simple Hill Climbing and Steepest – ascent hill
climbing.
8. Explain AO* algorithm with example.
9. Discuss Simulated Annealing method of search.
10. Explain Best First Search method.

Chap 3. Logical Agents , Order Logic


1. Explain the Knowledge base agent .
2. Explain the Wumpus world.

Apollo Institute of Engineering and Technology (121) IT Department


AI (3161608) Semester: VI

Chap 4. Inference in First Order Logic


1. Difference between Propositional Logic and First order logic.
2. Explain the Forward chaining and Backward chaining.
3. Discuss Resolution .

Chap 5.Uncertainty
1. What is Uncertainty?

Chap 6. Probabilistic Reasoning


1. Explain Bayesian network.
2. Discuss Probabilistic reasoning.

Chap 7. Game Playing: Overview and Example Domain


1. Explain alpha-beta cut off search with an example. State a case when to do alpha
pruning.
2. Explain Min – max search procedure with an example.
3. Explain goal stack planning using suitable example.

Chap 8. Statistical Learning Methods


1. Discuss Statistical learning.
2. Explain EM Algorithm.

Chap 9. Introduction to Prolog


1. Explain Cut, Fail and Repeat predicates in Prolog.
2. Write a prolog program to compute factorial of a given number.
3. Write a prolog program to solve Tower of Hanoi problem.
4. Write a prolog program to find the sum of elements of list.

Apollo Institute of Engineering and Technology (121) IT Department

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