100% found this document useful (1 vote)
263 views28 pages

Artificial Intelligence Question Bank 2021

The document provides information about artificial intelligence questions and answers for semester 5 students. It includes 20 questions related to different AI topics like problem solving, search algorithms, knowledge representation, logic and resolution. It also provides links to visit the author's website and join a Telegram channel for more question banks and instant updates.

Uploaded by

Umme Kulsum
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
100% found this document useful (1 vote)
263 views28 pages

Artificial Intelligence Question Bank 2021

The document provides information about artificial intelligence questions and answers for semester 5 students. It includes 20 questions related to different AI topics like problem solving, search algorithms, knowledge representation, logic and resolution. It also provides links to visit the author's website and join a Telegram channel for more question banks and instant updates.

Uploaded by

Umme Kulsum
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/ 28

Visit : https://hemanthrajhemu.github.

io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE


1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
ARTIFICAL INTELLIGENCE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS562 IA Marks 40
Number of Lecture Hours/Week 03 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 1
----------------------------------------------------------------------------------------
1. Explain different characteristics of the AI problem used for
analysing it to choose most appropriate method. (8-Marks) (1a)
(June/July 2018)
2. A water jug problem states “you are provided with two jugs, first
one with 4-gallon capacity and the second one with 3-gallon
capacity. Neither have any measuring markers on it. How can
you get exactly 2 gallons of water into 4-gallon jug”?
i. Write down the production rules for the above problem.
ii. Write any one solution to the above problem. (8-Marks)
(1b) (June/July 2018)
3. Explain the Best-First search algorithm with an example. (6-
Marks) (2a) (June/July 2018)
4. List various task domains of Al. (4-Marks) (2b) (June/July 2018)

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

5. Explain how AND-OR graphs are used in problem reduction.


(6-Marks) (2b) (June/July 2018)
6. State the algorithm for steepest ascent hill climbing along with
its disadvantages. (06 Marks) (1a) (Dec.2017/Jan.2018)
7. Solve the following cryptorithematic problem: SEND +
MORE= MONEY. (10-Marks) (1b) (Dec.2017/Jan.2018)
8. Define Artificial Intelligence, and list the task domains of
artificial intelligence. (04 Marks) (2a) (Dec.2017/Jan.2018)
9. Explain four categories of production system. (04 Marks) (2b)
(Dec.2017/Jan.2018)
10. Explain problem characteristics with respect to heuristic search.
(8-Marks) (2c) (Dec.2017/Jan.2018)
11. How knowledge can be represented in AI techniques. Explain
with example. (8-Marks)
12. Differentiate between BFS & DFS Algorithms with a simple
example. (8-Marks)
13. Explain the Production Rules and solution for Water Jug
problem.
i. One jug contains 3L & another with 4L. Goal State is (n,2).
ii. Write either DFS or BFS for the same. (8-Marks)
14. Explain Steepest Ascent Hill Climbing with an example. List out
the limitations of the same. (8-Marks)
15. Explain A* algorithm in detail with an example. (8-Marks)
16. Analyse following problems with respect to the 7 problem
characteristics of AI.
i. 8-puzzle
ii. Traveling Salesman Problem. (8-Marks)
17. Define Artificial Intelligence. Describe the interaction between
an agent and its environment. (8-Marks)

https://hemanthrajhemu.github.io
3|Page https://hemanthrajhemu.github.io

18. Define state space. Explain BFS Strategy. (8-Marks)


19. Describe Problem Characteristics. (8-Marks)
20. Describe Production System Characteristics. (8-Marks)
21. Explain the properties of Task Environment. (8-Marks)
22. Define agent program? Discuss Goal Based and Learning Based
agents. (8-Marks)
----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io
THANK YOU
--------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io
Visit : https://hemanthrajhemu.github.io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE


1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
ARTIFICAL INTELLIGENCE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS562 IA Marks 40
Number of Lecture Hours/Week 03 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 2 –
----------------------------------------------------------------------------------------
1. Consider the following set of well-formed formulas in
predicate logic:

i. Man(Marcus)

ii. Pompeian (Marcus)

iii. ∀ x: Pompeian (x) - Roman(x)

iv. Ruler (Caeser) he

v. ∀x: Roman (x) → loyalto (x, caeser) v hate (x, caeser)

vi. ∀x: y loyalto (x, y)

vii. ∀x: ∀y Man(x) ^ Ruler (y) ^ tryassassinate (x, y) →


loyalto (x, y)

viii. Tryassassinate (Marcus, Caeser).

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

Convert these into clause form and prove that hate (Marcus,
caeser) using resolution proof. (10-Marks) (3a) (June/July
2018)

2. What is “Matching” in rule based system? Briefly explain


different proposals for matching. (6-Marks) (3b) (June/July
2018)

3. What are properties of good system for the representation


of knowledge? Explain different approaches to knowledge
representation. (6-Marks) (4a) (June/July 2018)

4. Distinguish forward and backward reasoning explain with


example. (6-Marks) (4b) (June/July 2018)

5. List the issues in knowledge representation. (4-Marks) (4c)


(June/July 2018)

6. Explain the frame problem. (6-Marks) (3a)


(Dec.2017/Jan.2018)

7. Write the algorithm for conversion 0clause form. (10-


Marks) (3b) (Dec.2017/Jan.2018)

8. Define Horn clause and give the syntactic difference


between PROLOG and logic. (4-Marks) (4a)
(Dec.2017/Jan.2018)

9. Write the algorithm to unify (L1, L2). (6-Marks) (4b)


(Dec.2017/Jan.2018)

10. Write a note on conflict resolution. (6-Marks) (4c)


(Dec.2017/Jan.2018)

11. Explain the Forward and Backward Reasoning. (6-


Marks)

12. Consider the following sentences:

i. Raj likes all kinds of food.

ii. Apples are food.

iii. Anything anyone eats and isn’t killed by is


food.

https://hemanthrajhemu.github.io
3|Page https://hemanthrajhemu.github.io

iv. Sachin eats peanuts and is still alive.

v. Vinod eats everything Sachin eats.

12.1. Translate these sentences into First Order Predicate


Logic.

12.2. Use Resolution to answer the question, “What food does


Vinod eat?” (mod-2)

13. Consider the following axioms:

i. Anyone whom Mary loves is a football star.

ii. Any student who does not pass does not play

iii. John is a student.

iv. Any student who does not study does not pass.

v. Anyone who does not play is not a football star.

Prove using resolution process that “If John does not study,
then Mary does not love John”.

14. Explain the different approaches to knowledge


representation.

----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io/AnswerScript
THANK YOU
Join Telegram Channel to receive Instant Updates..

https://t.me/joinchat/AAAAAFTtp8kuvCHALxuMaQ

--------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io
Visit : https://hemanthrajhemu.github.io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE


1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
ARTIFICAL INTELLIGENCE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS562 IA Marks 40
Number of Lecture Hours/Week 03 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 3
----------------------------------------------------------------------------------------
1. What are key issues which needs to be addressed by non-
monotonic reasoning system? Explain. (6-Marks) (5a)
(June/July 2018)

2. Briefly explain the motivation for fuzzy logic. (4-Marks)


(5b) (June/July 2018)

3. Explain how semantic networks are used in


representation and reasoning. (6-Marks) (5c) (June/July
2018)

4. Explain non monotonic logic and default logic with


example. Which are the two common kinds of non-
monotonic reasoning defined in these logics? (6-Marks)
(6a) (June/July 2018)

5. State Baye’s theorem. How it is used in statistical


reasoning? (4-Marks) (6c) (June/July 2018)

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

6. Write a short note on Frames. (6-Marks) (6c) (June/July


2018)

7. Define Frame. State the baye’s theorem and explain the


notations used. (6-Marks) (5a) (Dec.2017/Jan.2018)

8. Write a note on Justification based Truth Maintenance


System (JTMS). (10-Marks) (5b) (Dec.2017/Jan.2018)

9. Write a note on closed world assumption. (6-Marks) (6a)


(Dec.2017/Jan.2018)

10. Explain Bayesian network. (10-Marks) (6b)


(Dec.2017/Jan.2018)

11. What is non-monotonic reasoning? Explain different


subtypes of Non- monotonic reasoning in brief.

12. Explain certainty factors and rules corresponding to


MYCIN expert system.

13. Explain Dempster Shafer theory in detail by a mechanism


for performance of combinational scenarios in a simple
diagnosis problem.

14. With an example describe in detail semantic net and


partitioned semantic net.

15. Explain frames sets and instances with an example of ML-


Baseball Team.

----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io/AnswerScript
THANK YOU
Join Telegram Channel to receive Instant Updates..

https://t.me/joinchat/AAAAAFTtp8kuvCHALxuMaQ

--------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io
Visit : https://hemanthrajhemu.github.io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE


1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
ARTIFICAL INTELLIGENCE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS562 IA Marks 40
Number of Lecture Hours/Week 03 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 4
----------------------------------------------------------------------------------------
1. List the components of a script. (4-Marks) (7a)
(June/July 2018)
2. Explain the MINIMAX algorithm. Consider the
following game tree in which static tree are all from
the first players point of view. Apply MINIMAX
algorithm to decide which move to be chosen
(suppose the first player is the maximizing player).
(12-Marks) (7b) (June/July 2018)

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

3. List the rules of conceptual dependency. (6-Marks)


(8a) (June/July 2018)
4. Why should we want to build large knowledge
bases? (4-Marks) (8b) (June/July 2018)
5. Write a note on iterative deepening. (6-Marks) (8c)
(June/July 2018)
6. Define conceptual dependency, mention its goals
along with representation. (6-Marks) (7a)
(Dec.2017/Jan.2018)
7. Write the algorithm for minimax (position, depth,
players) and explain. (10-Marks) (7b)
(Dec.2017/Jan.2018)
8. Write the algorithm for
i. Depth first iterative deepening
ii. Iterative deepening – A* (6-Marks) (8a)
(Dec.2017/Jan.2018)
9. Write a note on global ontology. (10-Marks) (8b)
(Dec.2017/Jan.2018)
10. List out the properties of full fledged objects.

https://hemanthrajhemu.github.io
3|Page https://hemanthrajhemu.github.io

11. Explain Min-Max Search procedure via an example.


12. Explain Min-Max Alpha Beta Pruning Search
algorithm.
----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io/AnswerScript
THANK YOU
Join Telegram Channel to receive Instant Updates..

https://t.me/joinchat/AAAAAFTtp8kuvCHALxuMaQ

--------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io
Visit : https://hemanthrajhemu.github.io

Join Telegram to get Instant Updates: https://bit.ly/VTU_TELEGRAM

Contact: MAIL: futurevisionbie@gmail.com

INSTAGRAM: www.instagram.com/hemanthraj_hemu/

INSTAGRAM: www.instagram.com/futurevisionbie/

WHATSAPP SHARE: https://bit.ly/FVBIESHARE


1|Page https://hemanthrajhemu.github.io

-----------------------------------------------------------------------------------------
ARTIFICAL INTELLIGENCE
[As per Choice Based Credit System (CBCS) scheme]
(Effective from the academic year 2017 -2018)

SEMESTER – V
Subject Code 17CS562 IA Marks 40
Number of Lecture Hours/Week 03 Exam Marks 60
-----------------------------------------------------------------------------------------
These Questions are being framed for helping the
students in the “FINAL Exams” Only (Remember for
Internals the Question Paper is set by your respective
teachers). Questions may be repeated, just to show
students how VTU can frame Questions.
- ADMIN
----------------------------------------------------------------------------------------
Module 5
----------------------------------------------------------------------------------------
1. Explain various steps involved in natural language
understanding process. (8-Marks) (9a) (June/July
2018)
2. Write a note on knowledge acquisition. (4-Marks)
(9b) (June/July 2018)
3. Explain how decision trees are used in learning? (4-
Marks) (9c) (June/July 2018)
4. Distinguish between semantic grammars and case
grammars with examples. (6-Marks) (10a)
(June/July 2018)
5. Explain the process of the learning from examples.
(6-Marks) (10b) (June/July 2018)

https://hemanthrajhemu.github.io
2|Page https://hemanthrajhemu.github.io

6. What capabilities are expected from expert


systems? (4-Marks) (10c) (June/July 2018)
7. Explain classification of spell checking techniques.
(6-Marks) (9a) (Dec.2017/Jan.2018)
8. Explain knowledge acquisition. (10-Marks) (9b)
(Dec.2017/Jan.2018)
9. Briefly explain four ways of handling sentences. (4-
Marks) (10a) (Dec.2017/Jan.2018)
10. Write a note on decision trees. (6-Marks) (10b)
(Dec.2017/Jan.2018)
11. Write the algorithm for candidate elimination. (6-
Marks) (10c) (Dec.2017/Jan.2018)
----------------------------------------------------------------------------------------
ANSWER SCRIP FOR THESE
QUESTIONS WILL BE UPLOADED ASAP
Visit:
https://hemanthrajhemu.github.io/AnswerScript
THANK YOU
Join Telegram Channel to receive Instant Updates..

https://t.me/joinchat/AAAAAFTtp8kuvCHALxuMaQ

--------------------------------------------------------------------------------------

https://hemanthrajhemu.github.io

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