Scribd
Upload
42 views

Ecs302ai Module 1

This document contains an exam for a course on Artificial Intelligence. It includes 5 questions that assess students' understanding of key AI concepts. Question 1 has multiple parts that define AI using the "Laws of thought" approach, describe how agents interact with their environment, develop PEAS descriptions for sample agents, and discuss iterative deepening search. Question 2 asks students to discuss the Turing test and describe goal-based and utility-based agents. The remaining questions focus on problem formulation, search techniques like breadth-first search, and avoiding repeated states.

Uploaded by

Vijaya Manikanta
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
42 views

Ecs302ai Module 1

This document contains an exam for a course on Artificial Intelligence. It includes 5 questions that assess students' understanding of key AI concepts. Question 1 has multiple parts that define AI using the "Laws of thought" approach, describe how agents interact with their environment, develop PEAS descriptions for sample agents, and discuss iterative deepening search. Question 2 asks students to discuss the Turing test and describe goal-based and utility-based agents. The remaining questions focus on problem formulation, search techniques like breadth-first search, and avoiding repeated states.

Uploaded by

Vijaya Manikanta
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Department of Computer Science &Engineering

GITAM INSTITUTE OF TECHNOLOGY


GANDHI INSTITUTE OF TECHNOLOGY AND MANAGEMENT (GITAM)
(Declared as Deemed to be University u/s 3 of UGC Act, 1956), Accredited by NAAC with ‘A+’grade
Visakhapatnam

III/IV B.Tech. (CSE)II SemesterMid – IExamination 2018-2019


ECS302 ARTIFICIAL INTELLIGENCE Maximum Marks: 30
Date: 29-12-2018 Time:1 ½ hours
1. (a) Define Artificial Intelligence in terms of “Laws of thought” approach. 2M
(b) How does an agent interact with environment? 2M
(c) Develop PEAS description for Robot soccer player& Internet book-shopping agent? 2M
(d) The Four ways of measuring Performance of an algorithm. 2M
(e) Can iterative deepening be used in game tree search? If yes explain how, and also explain advantage & 2M
disadvantage.

2. (a)Discuss Turing test approach in understanding Artificial Intelligence. 4M


[This question relates to Course Outcome 1: Visualize what Artificial Intelligence is and the role of Intelligent
Agents]
(b) Describe the general model of Goal based and Utility based agents. 6M
[This question relates to Course Outcome 1: Visualize what Artificial Intelligence is and the role of
Intelligent Agents]

(OR)

3. (a) How do you specify a task environment?Discuss the following environments; 5M


i) Deterministic vs Stochastic ii) Episodic vs Sequential

[This question relates to Course Outcome 1: Visualize what Artificial Intelligence is and the role of Intelligent
Agents]
(b) Performance measure is the criterion for success of agent’s behavior. Justify it through concept of Rationality. 5M
[This question relates to Course Outcome 1: Visualize what Artificial Intelligence is and the role of Intelligent
Agents]

4. (a) What are the components to define a problem? Explain problem formulation for Eight Queen’s problem.
[This question relates to Course Outcome 2: Investigate the uninformed and informed search techniquesand tracing 5M
the execution of various search algorithms]

(b) Write an algorithm to avoid repeated states in a search process and explain.
[This question relates to Course Outcome 2: Investigate the uninformed and informed search techniques 5M
and tracing the execution of various search algorithms]

(OR)

5. (a)Illustrate the working of Iterative deepening Search using following graph and also write the algorithm that
implements IDS. Consider the starting node as ‘A’. 6M

[This question relates to Course Outcome 2: Investigate the uninformed and informed search techniques
and tracing the execution of various search algorithms]

(b) Consider the following graph to perform BFS traversal from A to G. Show the step-by-step procedure using
Queue. 4M

[This question relates to Course Outcome 2: Investigate the uninformed and informed search techniques
and tracing the execution of various search algorithms]

You may access the Scheme and Solutions on G-Learn from 30-12-2018

You might also like