SlideShare a Scribd company logo
1 of 14
SECTION A : True / False

TOTAL 10 MARKS

Answer TRUE or FALSE for the following and justify your answer by stating the reason
for each answer. There are 5 questions in this section. Each question carries 2 marks.
1. Depth first search will perform best if the goal state lies in upper left-hand side of the tree.

2. Alpha-beta pruning is a procedure to reduce the amount of computation and searching
during minimax.

3. A recursive procedure breaks a large and difficult problem into smaller problems.

4. The concept of frames in AI is similar to that of files in data organization.

5. One of applications of machine learning to large databases is web mining such as Google.

AI Final Sem. 1 2012/2013

Page: 1
SECTION B : Short Explanation Questions
TOTAL 10 MARKS
Answer each question in the space provided. There are 5 questions in this section. Each
question carries 2 marks.
1. A heuristic evaluation function f(n) may be calculated using the formula f(n) = g(n) +
h(n). In the 8-puzzle game h(n) can be:
a) _____________________________________________________________________
b) _____________________________________________________________________
2. What are the 2 rules for alpha beta pruning to stop the searching?

3. Explain the difference between forward and backward chaining. How do we choose
between forward and backward chaining?

4. State the similarities and differences between a semantic network and a conceptual graph.

5. In crime domain, what machine learning applications can be applied to assist in the
detection of criminals?

AI Final Sem. 1 2012/2013

Page: 2
SECTION C : Structured Questions

TOTAL 80 MARKS

Answer all questions in the space provided. There are 4 questions in this section. Use extra
paper(s) if necessary. Each question carries a total of 20 marks.
Question 1 (a) – Uninformed Search

Total 10 marks

Based on Figure: 1, answer questions (i) to (iii).
S

A

H

D

B

I

F

F

F

P

Q

G

Figure: 1
i) Perform a Breadth-First search on the above tree. List the nodes on OPEN and CLOSED
for each iteration. S = Start, and F = Goal.
Iteration

ii)

OPEN

[ 3 marks ]
CLOSED

The Breadth-First search algorithm can be implemented in a
___________________________________ order or with a __________.

AI Final Sem. 1 2012/2013

[1.5 marks]

Page: 3
iii)

Perform a Depth-First search on the above tree. List the nodes on OPEN and
CLOSED for each iteration. S = Start, and F = Goal.
Iteration

iv)

OPEN

CLOSED

The Depth-First Search algorithm can be implemented in a
___________________________ order or with a ________.

v)

[ 3 marks ]

[1.5 marks]

In Sudoku game application which search technique is better to be applied (Best first
or depth first search ? ). Give a short reason why (BFS/DFS) is more suitable for
Sudoku.
[ 1 marks]

AI Final Sem. 1 2012/2013

Page: 4
Question 1(b) – Informed Search

Total 10 marks

Figure: 2 shows a tree where each node is assigned a heuristic value. Based on this tree,
answer questions (i) to (iii).

A, 3
B, 3

C, 2

D, 2

H, 1
N, 0

E, 3

I, 2
O, 0

F, 1

J, 1

K, 0

P, 2

G, 2

L, 1

M, 2

Q, 2

R, 2

S, 3

Figure: 2
i)

Apply the Best-First search from the start state A to reach to the goal state, K. Show
all the steps you will perform by filling in the table below.
Node Evaluated

ii)

OPEN

[4 marks]
CLOSED

What is the solution path for the Best-First search performed on this tree?

AI Final Sem. 1 2012/2013

[1 mark]

Page: 5
iii)

What are the evaluation function that is the f(n) values for nodes A, B, G, I and Q? Show how
you obtain each value.

AI Final Sem. 1 2012/2013

[5 marks]

Page: 6
Question 2a – Minimax Search

Total 10 marks

Refer to Figure: 3 to answer this question.
MAX

3

6

7

5

6

9
5

6

7

4

5

6

8

9

Figure: 3
Apply the minimax algorithm to the game tree in Figure: 3 above, where it is the
MAXIMIZER’s turn to play. The values estimated by the evaluation function are indicated at
the leaf nodes. Assume that the search always visits children left-to-right.

Compute the backed-up values computed by the minimax algorithm. Show your answer by
writing values at the appropriate nodes in the above tree.

[7m]

a. Indicate the proper move of the maximizer by marking the line with bold indicator
(

) to the root’s outgoing edges.

AI Final Sem. 1 2012/2013

[3m]

Page: 7
Question 2b – Alpha-Beta Pruning

Total 10 marks

Refer to Figure 3 above, answer the following questions
a. Using alpha-beta pruning (and standard left-to-right evaluation of nodes), how many of the
leaves get evaluated?
b. Indicate all parts of the tree that are cut off.

[4m]
[3m]

c. if the standard right-to-left evaluation of nodes is applied to the search tree in Figure 3
above:
i.

are the minimax value computed at the root will be changed. (just write down yes or
no)

ii.

[1.5m]

are the number of nodes pruned will be changed. (just write down yes or no) [1.5m]

AI Final Sem. 1 2012/2013

Page: 8
Question 3 (a) – 15 marks
A production system maintains a set of rules about the characteristics of fruits as follows:
Rule 1:

IF
THEN

Rule 2:

IF
THEN

Rule 3:

IF

Shape = long AND
Colour = green OR yellow
Fruit = banana
Shape = round OR oblong AND
Diameter > 4 inches
Fruitclass = vine

THEN

Shape = round AND
Diameter < 4 inches
Fruitclass = tree

Rule 4:

IF
THEN

Seedcount = 1
Seedclass = stonefruit

Rule 5:

IF
THEN

Seedcount > 1
Seedclass = multiple

Rule 6:

IF

Fruitclass = vine AND
Colour = green
Fruit = watermelon

THEN
Rule 7:

IF
THEN

Rule 8:

IF
THEN

Rule 9:

IF
THEN

Rule 10:

IF
THEN

Rule 11:

IF
THEN

Fruitclass = vine AND
Surface = smooth AND
Colour = yellow
Fruit = honeydew
Fruitclass = vine AND
Surface = rough AND
Colour = tan
Fruit = cantaloupe
Fruitclass = tree AND
Colour = orange AND
Seedclass = stonefruit
Fruit = apricot
Fruitclass = tree AND
Colour = orange AND
Seedclass = multiple
Fruit = orange
Fruitclass = tree AND
Colour = red AND
Seedclass = stonefruit
Fruit = cherry

AI Final Sem. 1 2012/2013

Page: 9
Rule 12:

IF
THEN

Rule 13:

IF
THEN

Rule 14:

IF
THEN

i)

Fruitclass = tree AND
Colour = orange AND
Seedclass = stonefruit
Fruit = peach
Fruitclass = tree AND
Colour = red OR yellow OR green AND
Seedclass = multiple
Fruit = apple
Fruitclass = tree AND
Colour = purple AND
Seedclass = stonefruit
Fruit = plum

Use FORWARD CHAINING to describe the production system table including its
working memory, conflict set and rule fired to establish a fruit. Initial data given is :
Shape = round
Diameter > 4 inches
Surface = smooth
Colour = yellow
Terminate when the final value for Fruit in the working memory.

Iteration
#

AI Final Sem. 1 2012/2013

Working memory

[6 marks]

Conflict
set

Rule
fired

Page: 10
ii)

Given the fruit to search is apple, use BACKWARD CHAINING to describe the
production system table including its working memory, conflict set and rule fired to
establish the initial data for this fruit.
State the initial facts required to establish that the fruit searched is an apple. [9 marks]
Iteration
#

Working memory

Conflict
set

Rule
fired

The initial facts required to establish fruit to search is apple are:

AI Final Sem. 1 2012/2013

Page: 11
Question 3 (b) – 5 marks

i) How is blackboard systems related to production systems? Give a diagrammatic
example of such an application.

[2.5 marks]

ii) How can the concept of agents be applied in the blackboard architecture? [2.5 marks]

AI Final Sem. 1 2012/2013

Page: 12
Question 4 (a) – 10 marks
Develop a knowledge representation by drawing a SEMANTIC NETWORK to model the
classification of musical instruments as described below.
Musical Instruments are classified according to five major categories namely
Idiophones, Membranophones, Aerophones, Chordophones and Electrophones.
Idiophones are played by striking, shaking, plucking, or rubbing. Examples of
struck idiophones are bells and cymbals. Shaken Idiophones are rattles.
Examples of plucked idiophones are harps.
Membranophones are played by striking or rubbing. Examples are kettledrums
and snare drums. They are played by striking on them. Membranophones are
made from stretched skin or membrane.
Aerophones are played by blowing or breathing. Trumpets and Horns players
must blow or compress their lips to set the air into motion. For flutes, the
player’s breath is directed against the sharp edge of a hole to set the air into
motion.
Chordophones may be plucked or bowed. Examples are Harps.
Electrophones are played using electronic circuits. Examples are Electric guitar.

AI Final Sem. 1 2012/2013

Page: 13
Question 4 (b) – 10 marks
Model your knowledge by assembling the partial description given about Multiple
Intelligences below into a STRUCTURED FRAME-BASED representation.
Gardner (1983) introduced the Theory of Multiple Intelligences which meets
with the criteria for a behavior to be intelligent. He believes that there are 8
types of intelligences: Spatial, Linguistic, Logical-mathematical, Bodily-kinesthetic,
Musical, Interpersonal, Intrapersonal and Naturalistic.
Spatial intelligence deals with spatial judgment, and ability to visualize with
the mind’s eye. Potential careers for them are Architect, Artist, and Engineer.
Linguistic intelligence deals with spoken or written words. Potential careers for
them are Writer, Lawyer and Teacher.
Logical-mathematical intelligence deals with logic, abstractions, reasoning and
numbers. Potential careers for them are Scientist, Mathematician, Computer
programmer, and Engineer.
Intrapersonal intelligence deals with introspective and self-reflective capacities.
Potential careers for them are Philosopher, Writer, Theorist and Scientist.
Naturalistic intelligence deals with the ability to recognize and categorize
plants, animals and other objects in nature. Potential careers for them are
Farmers, Botanists and Chef.
Note: The JOB frame will only cater for job titles that are in italics i.e. Engineer, Writer,
Scientist and Chef.

AI Final Sem. 1 2012/2013

Page: 14

More Related Content

What's hot

Stuart russell and peter norvig artificial intelligence - a modern approach...
Stuart russell and peter norvig   artificial intelligence - a modern approach...Stuart russell and peter norvig   artificial intelligence - a modern approach...
Stuart russell and peter norvig artificial intelligence - a modern approach...
Lê Anh Đạt
 

What's hot (20)

Backtracking
BacktrackingBacktracking
Backtracking
 
Control Strategies in AI
Control Strategies in AIControl Strategies in AI
Control Strategies in AI
 
Lecture 16 memory bounded search
Lecture 16 memory bounded searchLecture 16 memory bounded search
Lecture 16 memory bounded search
 
P, NP, NP-Complete, and NP-Hard
P, NP, NP-Complete, and NP-HardP, NP, NP-Complete, and NP-Hard
P, NP, NP-Complete, and NP-Hard
 
UNIT I LINEAR DATA STRUCTURES – LIST
UNIT I 	LINEAR DATA STRUCTURES – LIST 	UNIT I 	LINEAR DATA STRUCTURES – LIST
UNIT I LINEAR DATA STRUCTURES – LIST
 
Design and analysis of algorithms
Design and analysis of algorithmsDesign and analysis of algorithms
Design and analysis of algorithms
 
knowledge representation using rules
knowledge representation using rulesknowledge representation using rules
knowledge representation using rules
 
Birch Algorithm With Solved Example
Birch Algorithm With Solved ExampleBirch Algorithm With Solved Example
Birch Algorithm With Solved Example
 
Np cooks theorem
Np cooks theoremNp cooks theorem
Np cooks theorem
 
Classification Using Decision tree
Classification Using Decision treeClassification Using Decision tree
Classification Using Decision tree
 
Fuzzy expert system
Fuzzy expert systemFuzzy expert system
Fuzzy expert system
 
Forward Backward Chaining
Forward Backward ChainingForward Backward Chaining
Forward Backward Chaining
 
Minimum spanning tree
Minimum spanning treeMinimum spanning tree
Minimum spanning tree
 
Lecture 14 Heuristic Search-A star algorithm
Lecture 14 Heuristic Search-A star algorithmLecture 14 Heuristic Search-A star algorithm
Lecture 14 Heuristic Search-A star algorithm
 
Problem Solving
Problem Solving Problem Solving
Problem Solving
 
Church Turing Thesis
Church Turing ThesisChurch Turing Thesis
Church Turing Thesis
 
Stuart russell and peter norvig artificial intelligence - a modern approach...
Stuart russell and peter norvig   artificial intelligence - a modern approach...Stuart russell and peter norvig   artificial intelligence - a modern approach...
Stuart russell and peter norvig artificial intelligence - a modern approach...
 
Presentation on Breadth First Search (BFS)
Presentation on Breadth First Search (BFS)Presentation on Breadth First Search (BFS)
Presentation on Breadth First Search (BFS)
 
ID3 ALGORITHM
ID3 ALGORITHMID3 ALGORITHM
ID3 ALGORITHM
 
N Queens problem
N Queens problemN Queens problem
N Queens problem
 

Viewers also liked (12)

UHB2422 / ULAB2112 - Final exam paper with answer sample
UHB2422 / ULAB2112 - Final exam paper with answer sampleUHB2422 / ULAB2112 - Final exam paper with answer sample
UHB2422 / ULAB2112 - Final exam paper with answer sample
 
UHB 3022 / ULAB 3122 - Final Exam Paper
 UHB 3022 / ULAB 3122 - Final Exam Paper UHB 3022 / ULAB 3122 - Final Exam Paper
UHB 3022 / ULAB 3122 - Final Exam Paper
 
UHB2422 / ULAB2112 - Final exam paper
UHB2422 / ULAB2112 - Final exam paperUHB2422 / ULAB2112 - Final exam paper
UHB2422 / ULAB2112 - Final exam paper
 
Tercera practica
Tercera practicaTercera practica
Tercera practica
 
AI Lesson 04
AI Lesson 04AI Lesson 04
AI Lesson 04
 
Stamp ai sp16
Stamp ai sp16Stamp ai sp16
Stamp ai sp16
 
ULAB3122 / UHS3022 - Final Exam Paper (2009)
ULAB3122 / UHS3022 - Final Exam Paper (2009)ULAB3122 / UHS3022 - Final Exam Paper (2009)
ULAB3122 / UHS3022 - Final Exam Paper (2009)
 
SCSJ3203 - Theory Science Computer - Midterm Paper
SCSJ3203 - Theory Science Computer - Midterm PaperSCSJ3203 - Theory Science Computer - Midterm Paper
SCSJ3203 - Theory Science Computer - Midterm Paper
 
Academic Reports (Lim Zhong Heng)
Academic Reports (Lim Zhong Heng)Academic Reports (Lim Zhong Heng)
Academic Reports (Lim Zhong Heng)
 
KBS Lecture Notes
KBS Lecture NotesKBS Lecture Notes
KBS Lecture Notes
 
UICI 2022 -Bab 01 manusia dan ilmu (nota)
UICI 2022 -Bab 01 manusia dan ilmu (nota)UICI 2022 -Bab 01 manusia dan ilmu (nota)
UICI 2022 -Bab 01 manusia dan ilmu (nota)
 
Algorithms and Flowcharts
Algorithms and FlowchartsAlgorithms and Flowcharts
Algorithms and Flowcharts
 

Similar to SCSJ3553 - Artificial Intelligence Final Exam paper - UTM

Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docxMath 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
alfredacavx97
 
Spreadsheets 101
Spreadsheets 101Spreadsheets 101
Spreadsheets 101
whita1bd
 
Heuristic Search
Heuristic SearchHeuristic Search
Heuristic Search
butest
 
MISY 3331 Advanced Database ConceptsAssignment 3Dr. Sotirios .docx
MISY 3331 Advanced Database ConceptsAssignment 3Dr.  Sotirios .docxMISY 3331 Advanced Database ConceptsAssignment 3Dr.  Sotirios .docx
MISY 3331 Advanced Database ConceptsAssignment 3Dr. Sotirios .docx
altheaboyer
 
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
uroosavayani
 
College Algebra MATH 107 Spring, 2015, V4.8 Page 1 of .docx
College Algebra   MATH 107   Spring, 2015, V4.8 Page 1 of .docxCollege Algebra   MATH 107   Spring, 2015, V4.8 Page 1 of .docx
College Algebra MATH 107 Spring, 2015, V4.8 Page 1 of .docx
monicafrancis71118
 
Lesson 4 Advanced Spreadsheet Skills/Post-Test
Lesson 4 Advanced Spreadsheet Skills/Post-TestLesson 4 Advanced Spreadsheet Skills/Post-Test
Lesson 4 Advanced Spreadsheet Skills/Post-Test
daki01
 
Day 7 distributive property
Day 7 distributive propertyDay 7 distributive property
Day 7 distributive property
Erik Tjersland
 

Similar to SCSJ3553 - Artificial Intelligence Final Exam paper - UTM (20)

De vry math221 all ilabs latest 2016 november
De vry math221 all ilabs latest 2016 novemberDe vry math221 all ilabs latest 2016 november
De vry math221 all ilabs latest 2016 november
 
De vry math 221 all ilabs latest 2016 november
De vry math 221 all ilabs latest 2016 novemberDe vry math 221 all ilabs latest 2016 november
De vry math 221 all ilabs latest 2016 november
 
IT 405
IT 405IT 405
IT 405
 
Grade 8 math_review
Grade 8 math_reviewGrade 8 math_review
Grade 8 math_review
 
Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docxMath 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
Math 107 College AlgebraName Olufemi Akinyemi Final Examination F.docx
 
3rd Semester Computer Science and Engineering (ACU) Question papers
3rd Semester Computer Science and Engineering  (ACU) Question papers3rd Semester Computer Science and Engineering  (ACU) Question papers
3rd Semester Computer Science and Engineering (ACU) Question papers
 
Lecture 01 (Mean, Median, Mode).pdf
Lecture 01 (Mean, Median, Mode).pdfLecture 01 (Mean, Median, Mode).pdf
Lecture 01 (Mean, Median, Mode).pdf
 
Spreadsheets 101
Spreadsheets 101Spreadsheets 101
Spreadsheets 101
 
Heuristic Search
Heuristic SearchHeuristic Search
Heuristic Search
 
6957 June13 exam_paper
6957 June13 exam_paper6957 June13 exam_paper
6957 June13 exam_paper
 
cheyene ppt.pptx
cheyene ppt.pptxcheyene ppt.pptx
cheyene ppt.pptx
 
DATA INTERPRETATION.pptx
DATA INTERPRETATION.pptxDATA INTERPRETATION.pptx
DATA INTERPRETATION.pptx
 
MISY 3331 Advanced Database ConceptsAssignment 3Dr. Sotirios .docx
MISY 3331 Advanced Database ConceptsAssignment 3Dr.  Sotirios .docxMISY 3331 Advanced Database ConceptsAssignment 3Dr.  Sotirios .docx
MISY 3331 Advanced Database ConceptsAssignment 3Dr. Sotirios .docx
 
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
---Orientation-Session---Business-Statistics-22092023-044926pm (2).pdf
 
Model #2-Grade 8 Pre-Algebra-DEMO-FINAL
Model #2-Grade 8 Pre-Algebra-DEMO-FINALModel #2-Grade 8 Pre-Algebra-DEMO-FINAL
Model #2-Grade 8 Pre-Algebra-DEMO-FINAL
 
Assessment Model #2 Pre-Algebra Grade 8
Assessment Model #2 Pre-Algebra Grade 8Assessment Model #2 Pre-Algebra Grade 8
Assessment Model #2 Pre-Algebra Grade 8
 
College Algebra MATH 107 Spring, 2015, V4.8 Page 1 of .docx
College Algebra   MATH 107   Spring, 2015, V4.8 Page 1 of .docxCollege Algebra   MATH 107   Spring, 2015, V4.8 Page 1 of .docx
College Algebra MATH 107 Spring, 2015, V4.8 Page 1 of .docx
 
Lesson 4 Advanced Spreadsheet Skills/Post-Test
Lesson 4 Advanced Spreadsheet Skills/Post-TestLesson 4 Advanced Spreadsheet Skills/Post-Test
Lesson 4 Advanced Spreadsheet Skills/Post-Test
 
402_Information_Tech_SQP.pdf
402_Information_Tech_SQP.pdf402_Information_Tech_SQP.pdf
402_Information_Tech_SQP.pdf
 
Day 7 distributive property
Day 7 distributive propertyDay 7 distributive property
Day 7 distributive property
 

More from Abdul Khaliq

ULAB3122 / UHS3022 - Final Exam Paper
ULAB3122 / UHS3022 - Final Exam PaperULAB3122 / UHS3022 - Final Exam Paper
ULAB3122 / UHS3022 - Final Exam Paper
Abdul Khaliq
 
Soalan orienteering
Soalan orienteeringSoalan orienteering
Soalan orienteering
Abdul Khaliq
 
orienteering - saling pandang
orienteering - saling pandangorienteering - saling pandang
orienteering - saling pandang
Abdul Khaliq
 
orienteering - cerun
orienteering - cerunorienteering - cerun
orienteering - cerun
Abdul Khaliq
 
orenteering - mengenal cerun
orenteering - mengenal cerunorenteering - mengenal cerun
orenteering - mengenal cerun
Abdul Khaliq
 
Computational mathematic
Computational mathematicComputational mathematic
Computational mathematic
Abdul Khaliq
 
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
Abdul Khaliq
 

More from Abdul Khaliq (19)

ULAB3122 / UHS3022 - Final Exam Paper
ULAB3122 / UHS3022 - Final Exam PaperULAB3122 / UHS3022 - Final Exam Paper
ULAB3122 / UHS3022 - Final Exam Paper
 
Soalan orienteering
Soalan orienteeringSoalan orienteering
Soalan orienteering
 
Orienteering - titik utara
Orienteering - titik utaraOrienteering - titik utara
Orienteering - titik utara
 
orienteering - saling pandang
orienteering - saling pandangorienteering - saling pandang
orienteering - saling pandang
 
orienteering - cerun
orienteering - cerunorienteering - cerun
orienteering - cerun
 
orenteering - mengenal cerun
orenteering - mengenal cerunorenteering - mengenal cerun
orenteering - mengenal cerun
 
Orienteering - kompas prismatik
Orienteering - kompas prismatikOrienteering - kompas prismatik
Orienteering - kompas prismatik
 
UICI 2022 - Bab 04 teknologi dalam islam (nota)
UICI 2022 - Bab 04 teknologi dalam islam (nota)UICI 2022 - Bab 04 teknologi dalam islam (nota)
UICI 2022 - Bab 04 teknologi dalam islam (nota)
 
UICI 2022 - Bab 03 sains dan islam (nota)
UICI 2022 - Bab 03 sains dan islam (nota)UICI 2022 - Bab 03 sains dan islam (nota)
UICI 2022 - Bab 03 sains dan islam (nota)
 
UICI 2022 - Bab 02 perpindahan ilmu (nota)
UICI 2022 - Bab 02 perpindahan ilmu (nota)UICI 2022 - Bab 02 perpindahan ilmu (nota)
UICI 2022 - Bab 02 perpindahan ilmu (nota)
 
Computational mathematic
Computational mathematicComputational mathematic
Computational mathematic
 
A intro uici 2022 sains teknologi dan manusia
A intro uici 2022   sains teknologi dan manusiaA intro uici 2022   sains teknologi dan manusia
A intro uici 2022 sains teknologi dan manusia
 
UICI 2022 - sains dan islam
UICI 2022 - sains dan islamUICI 2022 - sains dan islam
UICI 2022 - sains dan islam
 
UICI 2022 - Perpindahan ilmu
UICI 2022 - Perpindahan ilmuUICI 2022 - Perpindahan ilmu
UICI 2022 - Perpindahan ilmu
 
UICI 2022 - Manusia dan ilmu
UICI 2022 - Manusia dan ilmuUICI 2022 - Manusia dan ilmu
UICI 2022 - Manusia dan ilmu
 
Dinamika Malaysia - Konsep sejarah [hamidah[k] 2011
Dinamika Malaysia - Konsep sejarah [hamidah[k] 2011Dinamika Malaysia - Konsep sejarah [hamidah[k] 2011
Dinamika Malaysia - Konsep sejarah [hamidah[k] 2011
 
Dinamika Malaysia - Islam di malaysia [hamidah[k] 2011
Dinamika Malaysia - Islam di malaysia [hamidah[k] 2011Dinamika Malaysia - Islam di malaysia [hamidah[k] 2011
Dinamika Malaysia - Islam di malaysia [hamidah[k] 2011
 
Dinamika Malaysia - Masyarakat multi etnik di malaysia [hamidah[k] 2011
Dinamika Malaysia - Masyarakat multi etnik di malaysia [hamidah[k] 2011Dinamika Malaysia - Masyarakat multi etnik di malaysia [hamidah[k] 2011
Dinamika Malaysia - Masyarakat multi etnik di malaysia [hamidah[k] 2011
 
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
Dinamika Malaysia - Sistem politik & kerajaan (UHS1152)[hamidah[k] 2011
 

Recently uploaded

The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
heathfieldcps1
 

Recently uploaded (20)

Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptxBasic Civil Engineering first year Notes- Chapter 4 Building.pptx
Basic Civil Engineering first year Notes- Chapter 4 Building.pptx
 
How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17How to Create and Manage Wizard in Odoo 17
How to Create and Manage Wizard in Odoo 17
 
The basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptxThe basics of sentences session 3pptx.pptx
The basics of sentences session 3pptx.pptx
 
Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)Jamworks pilot and AI at Jisc (20/03/2024)
Jamworks pilot and AI at Jisc (20/03/2024)
 
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
Beyond_Borders_Understanding_Anime_and_Manga_Fandom_A_Comprehensive_Audience_...
 
Interdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptxInterdisciplinary_Insights_Data_Collection_Methods.pptx
Interdisciplinary_Insights_Data_Collection_Methods.pptx
 
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
TỔNG ÔN TẬP THI VÀO LỚP 10 MÔN TIẾNG ANH NĂM HỌC 2023 - 2024 CÓ ĐÁP ÁN (NGỮ Â...
 
Basic Intentional Injuries Health Education
Basic Intentional Injuries Health EducationBasic Intentional Injuries Health Education
Basic Intentional Injuries Health Education
 
21st_Century_Skills_Framework_Final_Presentation_2.pptx
21st_Century_Skills_Framework_Final_Presentation_2.pptx21st_Century_Skills_Framework_Final_Presentation_2.pptx
21st_Century_Skills_Framework_Final_Presentation_2.pptx
 
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
80 ĐỀ THI THỬ TUYỂN SINH TIẾNG ANH VÀO 10 SỞ GD – ĐT THÀNH PHỐ HỒ CHÍ MINH NĂ...
 
How to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptxHow to setup Pycharm environment for Odoo 17.pptx
How to setup Pycharm environment for Odoo 17.pptx
 
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptxCOMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
COMMUNICATING NEGATIVE NEWS - APPROACHES .pptx
 
Tatlong Kwento ni Lola basyang-1.pdf arts
Tatlong Kwento ni Lola basyang-1.pdf artsTatlong Kwento ni Lola basyang-1.pdf arts
Tatlong Kwento ni Lola basyang-1.pdf arts
 
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptxOn_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
On_Translating_a_Tamil_Poem_by_A_K_Ramanujan.pptx
 
Understanding Accommodations and Modifications
Understanding  Accommodations and ModificationsUnderstanding  Accommodations and Modifications
Understanding Accommodations and Modifications
 
ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.ICT role in 21st century education and it's challenges.
ICT role in 21st century education and it's challenges.
 
Fostering Friendships - Enhancing Social Bonds in the Classroom
Fostering Friendships - Enhancing Social Bonds  in the ClassroomFostering Friendships - Enhancing Social Bonds  in the Classroom
Fostering Friendships - Enhancing Social Bonds in the Classroom
 
SOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning PresentationSOC 101 Demonstration of Learning Presentation
SOC 101 Demonstration of Learning Presentation
 
ICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptxICT Role in 21st Century Education & its Challenges.pptx
ICT Role in 21st Century Education & its Challenges.pptx
 
Python Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docxPython Notes for mca i year students osmania university.docx
Python Notes for mca i year students osmania university.docx
 

SCSJ3553 - Artificial Intelligence Final Exam paper - UTM

  • 1. SECTION A : True / False TOTAL 10 MARKS Answer TRUE or FALSE for the following and justify your answer by stating the reason for each answer. There are 5 questions in this section. Each question carries 2 marks. 1. Depth first search will perform best if the goal state lies in upper left-hand side of the tree. 2. Alpha-beta pruning is a procedure to reduce the amount of computation and searching during minimax. 3. A recursive procedure breaks a large and difficult problem into smaller problems. 4. The concept of frames in AI is similar to that of files in data organization. 5. One of applications of machine learning to large databases is web mining such as Google. AI Final Sem. 1 2012/2013 Page: 1
  • 2. SECTION B : Short Explanation Questions TOTAL 10 MARKS Answer each question in the space provided. There are 5 questions in this section. Each question carries 2 marks. 1. A heuristic evaluation function f(n) may be calculated using the formula f(n) = g(n) + h(n). In the 8-puzzle game h(n) can be: a) _____________________________________________________________________ b) _____________________________________________________________________ 2. What are the 2 rules for alpha beta pruning to stop the searching? 3. Explain the difference between forward and backward chaining. How do we choose between forward and backward chaining? 4. State the similarities and differences between a semantic network and a conceptual graph. 5. In crime domain, what machine learning applications can be applied to assist in the detection of criminals? AI Final Sem. 1 2012/2013 Page: 2
  • 3. SECTION C : Structured Questions TOTAL 80 MARKS Answer all questions in the space provided. There are 4 questions in this section. Use extra paper(s) if necessary. Each question carries a total of 20 marks. Question 1 (a) – Uninformed Search Total 10 marks Based on Figure: 1, answer questions (i) to (iii). S A H D B I F F F P Q G Figure: 1 i) Perform a Breadth-First search on the above tree. List the nodes on OPEN and CLOSED for each iteration. S = Start, and F = Goal. Iteration ii) OPEN [ 3 marks ] CLOSED The Breadth-First search algorithm can be implemented in a ___________________________________ order or with a __________. AI Final Sem. 1 2012/2013 [1.5 marks] Page: 3
  • 4. iii) Perform a Depth-First search on the above tree. List the nodes on OPEN and CLOSED for each iteration. S = Start, and F = Goal. Iteration iv) OPEN CLOSED The Depth-First Search algorithm can be implemented in a ___________________________ order or with a ________. v) [ 3 marks ] [1.5 marks] In Sudoku game application which search technique is better to be applied (Best first or depth first search ? ). Give a short reason why (BFS/DFS) is more suitable for Sudoku. [ 1 marks] AI Final Sem. 1 2012/2013 Page: 4
  • 5. Question 1(b) – Informed Search Total 10 marks Figure: 2 shows a tree where each node is assigned a heuristic value. Based on this tree, answer questions (i) to (iii). A, 3 B, 3 C, 2 D, 2 H, 1 N, 0 E, 3 I, 2 O, 0 F, 1 J, 1 K, 0 P, 2 G, 2 L, 1 M, 2 Q, 2 R, 2 S, 3 Figure: 2 i) Apply the Best-First search from the start state A to reach to the goal state, K. Show all the steps you will perform by filling in the table below. Node Evaluated ii) OPEN [4 marks] CLOSED What is the solution path for the Best-First search performed on this tree? AI Final Sem. 1 2012/2013 [1 mark] Page: 5
  • 6. iii) What are the evaluation function that is the f(n) values for nodes A, B, G, I and Q? Show how you obtain each value. AI Final Sem. 1 2012/2013 [5 marks] Page: 6
  • 7. Question 2a – Minimax Search Total 10 marks Refer to Figure: 3 to answer this question. MAX 3 6 7 5 6 9 5 6 7 4 5 6 8 9 Figure: 3 Apply the minimax algorithm to the game tree in Figure: 3 above, where it is the MAXIMIZER’s turn to play. The values estimated by the evaluation function are indicated at the leaf nodes. Assume that the search always visits children left-to-right. Compute the backed-up values computed by the minimax algorithm. Show your answer by writing values at the appropriate nodes in the above tree. [7m] a. Indicate the proper move of the maximizer by marking the line with bold indicator ( ) to the root’s outgoing edges. AI Final Sem. 1 2012/2013 [3m] Page: 7
  • 8. Question 2b – Alpha-Beta Pruning Total 10 marks Refer to Figure 3 above, answer the following questions a. Using alpha-beta pruning (and standard left-to-right evaluation of nodes), how many of the leaves get evaluated? b. Indicate all parts of the tree that are cut off. [4m] [3m] c. if the standard right-to-left evaluation of nodes is applied to the search tree in Figure 3 above: i. are the minimax value computed at the root will be changed. (just write down yes or no) ii. [1.5m] are the number of nodes pruned will be changed. (just write down yes or no) [1.5m] AI Final Sem. 1 2012/2013 Page: 8
  • 9. Question 3 (a) – 15 marks A production system maintains a set of rules about the characteristics of fruits as follows: Rule 1: IF THEN Rule 2: IF THEN Rule 3: IF Shape = long AND Colour = green OR yellow Fruit = banana Shape = round OR oblong AND Diameter > 4 inches Fruitclass = vine THEN Shape = round AND Diameter < 4 inches Fruitclass = tree Rule 4: IF THEN Seedcount = 1 Seedclass = stonefruit Rule 5: IF THEN Seedcount > 1 Seedclass = multiple Rule 6: IF Fruitclass = vine AND Colour = green Fruit = watermelon THEN Rule 7: IF THEN Rule 8: IF THEN Rule 9: IF THEN Rule 10: IF THEN Rule 11: IF THEN Fruitclass = vine AND Surface = smooth AND Colour = yellow Fruit = honeydew Fruitclass = vine AND Surface = rough AND Colour = tan Fruit = cantaloupe Fruitclass = tree AND Colour = orange AND Seedclass = stonefruit Fruit = apricot Fruitclass = tree AND Colour = orange AND Seedclass = multiple Fruit = orange Fruitclass = tree AND Colour = red AND Seedclass = stonefruit Fruit = cherry AI Final Sem. 1 2012/2013 Page: 9
  • 10. Rule 12: IF THEN Rule 13: IF THEN Rule 14: IF THEN i) Fruitclass = tree AND Colour = orange AND Seedclass = stonefruit Fruit = peach Fruitclass = tree AND Colour = red OR yellow OR green AND Seedclass = multiple Fruit = apple Fruitclass = tree AND Colour = purple AND Seedclass = stonefruit Fruit = plum Use FORWARD CHAINING to describe the production system table including its working memory, conflict set and rule fired to establish a fruit. Initial data given is : Shape = round Diameter > 4 inches Surface = smooth Colour = yellow Terminate when the final value for Fruit in the working memory. Iteration # AI Final Sem. 1 2012/2013 Working memory [6 marks] Conflict set Rule fired Page: 10
  • 11. ii) Given the fruit to search is apple, use BACKWARD CHAINING to describe the production system table including its working memory, conflict set and rule fired to establish the initial data for this fruit. State the initial facts required to establish that the fruit searched is an apple. [9 marks] Iteration # Working memory Conflict set Rule fired The initial facts required to establish fruit to search is apple are: AI Final Sem. 1 2012/2013 Page: 11
  • 12. Question 3 (b) – 5 marks i) How is blackboard systems related to production systems? Give a diagrammatic example of such an application. [2.5 marks] ii) How can the concept of agents be applied in the blackboard architecture? [2.5 marks] AI Final Sem. 1 2012/2013 Page: 12
  • 13. Question 4 (a) – 10 marks Develop a knowledge representation by drawing a SEMANTIC NETWORK to model the classification of musical instruments as described below. Musical Instruments are classified according to five major categories namely Idiophones, Membranophones, Aerophones, Chordophones and Electrophones. Idiophones are played by striking, shaking, plucking, or rubbing. Examples of struck idiophones are bells and cymbals. Shaken Idiophones are rattles. Examples of plucked idiophones are harps. Membranophones are played by striking or rubbing. Examples are kettledrums and snare drums. They are played by striking on them. Membranophones are made from stretched skin or membrane. Aerophones are played by blowing or breathing. Trumpets and Horns players must blow or compress their lips to set the air into motion. For flutes, the player’s breath is directed against the sharp edge of a hole to set the air into motion. Chordophones may be plucked or bowed. Examples are Harps. Electrophones are played using electronic circuits. Examples are Electric guitar. AI Final Sem. 1 2012/2013 Page: 13
  • 14. Question 4 (b) – 10 marks Model your knowledge by assembling the partial description given about Multiple Intelligences below into a STRUCTURED FRAME-BASED representation. Gardner (1983) introduced the Theory of Multiple Intelligences which meets with the criteria for a behavior to be intelligent. He believes that there are 8 types of intelligences: Spatial, Linguistic, Logical-mathematical, Bodily-kinesthetic, Musical, Interpersonal, Intrapersonal and Naturalistic. Spatial intelligence deals with spatial judgment, and ability to visualize with the mind’s eye. Potential careers for them are Architect, Artist, and Engineer. Linguistic intelligence deals with spoken or written words. Potential careers for them are Writer, Lawyer and Teacher. Logical-mathematical intelligence deals with logic, abstractions, reasoning and numbers. Potential careers for them are Scientist, Mathematician, Computer programmer, and Engineer. Intrapersonal intelligence deals with introspective and self-reflective capacities. Potential careers for them are Philosopher, Writer, Theorist and Scientist. Naturalistic intelligence deals with the ability to recognize and categorize plants, animals and other objects in nature. Potential careers for them are Farmers, Botanists and Chef. Note: The JOB frame will only cater for job titles that are in italics i.e. Engineer, Writer, Scientist and Chef. AI Final Sem. 1 2012/2013 Page: 14