informed-search-quiz

informed-search-quiz

University

6 Qs

quiz-placeholder

Similar activities

AI QUIZ

AI QUIZ

University

10 Qs

Kuis 3  - ASD - A

Kuis 3 - ASD - A

University

10 Qs

LnT C/C++ Sesi 12

LnT C/C++ Sesi 12

University

10 Qs

Viva - Practical - Main

Viva - Practical - Main

University

10 Qs

Data Structure & Algorithm

Data Structure & Algorithm

University

10 Qs

AI unit 1

AI unit 1

University

10 Qs

Artificial Intelligence

Artificial Intelligence

University

10 Qs

Data Structure#1

Data Structure#1

University

10 Qs

informed-search-quiz

informed-search-quiz

Assessment

Quiz

Computers

University

Medium

Created by

Syed Raza

Used 6+ times

FREE Resource

6 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What is another name we can use for informed search strategies?

Uninformed search

Heuristic search

Breadth-first search

Depth-first search

2.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What is the purpose of using heuristic information in search strategies?

To expand all nodes equally

To minimize the cost of the path

To minimize the cost of the search

To select the most promising nodes

3.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What is the heuristic function used in the example of the 8-puzzle?

Counting the number of misplaced tiles

Counting the number of expanded nodes

Counting the number of goal nodes

Counting the number of search steps

4.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What is the evaluation function f(n) in algorithm A*?

f(n) = g(n) + h(n)

f(n) = g(n) - h(n)

f(n) = g(n) * h(n)

f(n) = g(n) / h(n)

5.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What is the goal of the A* algorithm?

To find the optimal solution

To explore all possible states

To minimize the evaluation function

To maximize the heuristic function

6.

MULTIPLE CHOICE QUESTION

3 mins • 1 pt

What does the heuristic function estimate in A* algorithm?

The distance to the goal node

The cost of reaching the current node

The number of misplaced tiles

The number of expanded nodes