Lecture SEVEN.

Lecture SEVEN.

University

11 Qs

quiz-placeholder

Similar activities

MPS   INTERNAL 2 TEST

MPS INTERNAL 2 TEST

University

6 Qs

A-Level Computer Science Data Structures Quiz

A-Level Computer Science Data Structures Quiz

12th Grade - University

14 Qs

PDS - 04225 Lists, Stacks and Queues - Chapter 5

PDS - 04225 Lists, Stacks and Queues - Chapter 5

University

10 Qs

UNIT 3

UNIT 3

University

10 Qs

DBMS - Indexing

DBMS - Indexing

University

10 Qs

AlgoMania Quiz

AlgoMania Quiz

University

15 Qs

Graph Traversal Algorithms Quiz

Graph Traversal Algorithms Quiz

12th Grade - University

13 Qs

Unit 2 - AI by Prof. R. Rajkumar

Unit 2 - AI by Prof. R. Rajkumar

University

15 Qs

Lecture SEVEN.

Lecture SEVEN.

Assessment

Quiz

Computers

University

Easy

Created by

Ahmed Mohamed

Used 89+ times

FREE Resource

11 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

What is the main advantage of Informed Search over Uninformed Search?

Simplicity

Easier implementation

Less memory usage

Faster solution

2.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

What is the purpose of IDS ?

To combine the benefits of BFS and DFS

To use problem-specific knowledge to guide search

To find a solution more quickly

To expand the frontier node with the lowest path cost

3.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

IDS gets DFS’s ______ advantages with BFS’s ______.

accuracy, efficiency

complexity, space

space , time

time, complexity

4.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

Is IDS complete? _____ .
Is IDS optimal? ______ .

-YES, if m infinite
-YES, if cost=1

-YES, if m finite
-YES, if cost=1

Maybe YES maybe NO

  • -YES
    -YES, if cost=1

5.

MULTIPLE SELECT QUESTION

15 mins • 10 pts

When we can use IDS?

when there is a smaller search space

when there is a larger search space

when somewhat quicker performance is accepted.

when depth of the solution is not known.

when you have enough memory

Answer explanation

Media Image

6.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

What is the strategy of Uniform Cost Search?

Expand the deepest unexpanded node

Expand the shallowest unexpanded node

Expand the frontier node with the lowest path cost

Expand the frontier node with the highest path cost

7.

MULTIPLE CHOICE QUESTION

15 mins • 10 pts

Sometimes ______ called cost-sensitive search.

BFS

DFS

IDS

UCS

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?