Artificial Intelligence-Computer Science-Assignment, Exercises of Artificial Intelligence

I uploaded assignments for many different subjects related my degree Computer Science. This assignment for Artificial Intelligence includes: Artificial, Intelligence, Search, Heuristic, Beam, Logic, Reflex, Agent, Hill, Diagram, Pruning

Typology: Exercises

2011/2012

Uploaded on 08/25/2012

jonny2
jonny2 🇮🇳

4.3

(18)

53 documents

1 / 3

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
WARNING
1. PLAGIARISM OR H IRING OF G HOST WRITER(S) FO R SOLV ING
THE ASS IGNMENT(S) WILL D EBAR T HE ST UDENT FR OM AW ARD
OF DEGREE/CERTIFICATE, IF FOUND AT ANY STAGE.
2. SUBMITTING ASSIGNMENTS BORROWED OR ST OLEN FR OM
OTHER(S) AS ON E’S OWN WILL BE PE NALIZED A S DEFIN ED I N
Course: Artificial Intelligence (3451) Semester: Spring, 2012
Level: BS (CS) Total Marks: 100
Pass Marks: 50
ASSIGNMENT No. 1
Note: All questions carry equal marks.
Q. 1 (a) What is artificial intelligence? How it can be beneficial for decision making?
(b) Discuss the applications of artificial intelligence in real world with suitable
examples.
Q. 2 Explain the following terms with suitable examples.
(a) State transition diagram
(b) Heuristic Pruning
(c) Hill Climbing
Q. 3 Briefly discuss the following search techniques.
(a) Best first search
(b) A* search
(c) Beam search
Q. 4 (a) How programs are defined in Lisp? Explain with the help of examples.
(b) Explain with examples the scope of variables and debugging in the context of
Lisp.
Q. 5 Differentiate between
(a) Forward and backward chaining
(b) Syntax and Semantics
(c) Logic Agents and Reflex Agents
docsity.com
pf3

Partial preview of the text

Download Artificial Intelligence-Computer Science-Assignment and more Exercises Artificial Intelligence in PDF only on Docsity!

WARNING

1. PLAGIARISM OR H IRING OF G HOST WRITER(S) FO R SOLV ING

THE ASS IGNMENT(S) WILL D EBAR T HE ST UDENT FR OM AW ARD

OF DEGREE/CERTIFICATE, IF FOUND AT ANY STAGE.

2. SUBMITTING ASSIGNMENTS BORROWED OR ST OLEN FR OM

OTHER(S) AS ON E’S OWN WILL BE PE NALIZED A S DEFIN ED I N

Course: Artificial Intelligence (3451) Semester: Spring, 2012 Level: BS (CS) Total Marks: 100 Pass Marks: 50

ASSIGNMENT No. 1

Note: All questions carry equal marks.

Q. 1 (a) What is artificial intelligence? How it can be beneficial for decision making? (b) Discuss the applications of artificial intelligence in real world with suitable examples.

Q. 2 Explain the following terms with suitable examples. (a) State transition diagram (b) Heuristic Pruning (c) Hill Climbing

Q. 3 Briefly discuss the following search techniques. (a) Best first search (b) A* search (c) Beam search

Q. 4 (a) How programs are defined in Lisp? Explain with the help of examples. (b) Explain with examples the scope of variables and debugging in the context of Lisp.

Q. 5 Differentiate between (a) Forward and backward chaining (b) Syntax and Semantics (c) Logic Agents and Reflex Agents

ASSIGNMENT No. 2

(Units: 5–8) Total Marks: 100 Pass Marks: 50

Note: All questions carry equal marks. Q. 1 Explain in detail the use of knowledge engineering for planning.

Q. 2 (a) What are the major problems of knowledge representation? (b) Differentiate between selection and projection.

Q. 3 (a) What are the major approaches to semantic nets? (b) Discuss the applications of speech recognition in detail.

Q. 4 (a) Differentiate between prepositional and predicate logic. (b) Discuss in detail the structure ambiguity in natural language.

Q. 5 Write detail note on the following: (a) Learning in problem solving (b) Classification of learning strategies

3451 Artificial Intelligence Credit Hours: 3 (3+0)

Recommended Book: Artificial Intelligence: A Modern Approach by Russel & Norving

Course Outlines: Unit No. 1 Artificial Intelligence and Intelligent Agents Introduction, Intelligence Defined, Aspecs of Human Intelligence, Artificial Intelligence as a Discipline, Purpose, uses and Applications of A.I in Manufacturing, Medicine, Defense, chemistry, and other Applied Disciplines, Tools and Techniques used in A.I, Intelligent Agents, Structure of Intelligent Agents.

Unit No. 2 Search Search Theory, Formulating Problems, solving Problems, finding Paths, Avoiding Repeated States, State Transition Diagram, Constraint Satisfaction, Depth First, Breadth first, Hill Climbing, Beam Search, Best First Search, Alpha-Beta Search, A * Search, Branch and Bound, Heuristic Pruning, Heuristic Continuation and Dynamic Programming Searches.

Unit No. 3 Programming Practice Introduction to Lisp, Defining Programs, Basic Flow of Control, Basic Debugging, Recursions, The For Function, Scope of Variables, Local Variables, Building up List Structure.