CSE 366 Artificial Intelligence, Section-1

EXAM SOLUTIONS > CSE 366 Artificial Intelligence, Section-1

Related tags

CSE 366 CSE 365 East West University, Dhaka

East West University, Dhaka CSE 365 Note: There are SIX questions, answer ALL of them. Course Outcome (CO), Cognitive Level and Mark of each question are mentioned at the right margin. 1. Consider the following map (Figure: 1). The task is to color the map using the four colors Red, Blue, Green, and Yellow, such that no two adjacent regions ...[Show More]

East West University, Dhaka
CSE 365
Note: There are SIX questions, answer ALL of them. Course Outcome (CO), Cognitive Level and Mark of

each question are mentioned at the right margin.

1.

Consider the following map (Figure: 1). The task is to color the map using the

four colors Red, Blue, Green, and Yellow, such that no two adjacent regions

take the same color.

Consider this problem as a CSP. Identify the variables, domains, and

constraints.

[CO1,C1,

Mark: 4]

2. Google has created a new, super-intelligent robot — and it has provided answers

to some of the questions that have troubled humans for centuries. Conversations

are one of the most important and difficult tasks that artificial intelligence has

to undertake. As such, the robots have tended to work only in either very

restricted situations — such as customer support when booking an airline ticket

— or by giving canned replies in response to specific questions.

But Google hopes that its new system for robots could overcome some of those

problems with existing chatting artificial intelligence, partly by making it able

to learn through interacting with humans rather than being fed pre-written lines,

though it has run into some problems during testing.

i. Define Rational Agent with example.

ii. Describe the PEAS description by considering the case “Chatting

Artificial Intelligence.”

[CO1,C1,

Mark: 5]

Figure: 1

This study source was downloaded by 100000875661904 from CourseHero.com on 11-11-2023 14:08:08 GMT -06:00

https://www.coursehero.com/file/102818784/366-Section-1pdf/

Page 2 of 3

3. Define Situatedness with example. Describe the task environments by

considering the case “A robotic chef”.

[CO1,C1,

Mark: 5]

4.

Consider the search graph (Figure: 2). S is the start state and G is the goal state.

Calculate the optimal path using the Algorithms given below.