Search Header Logo

AI and ES Unit 2

Authored by Sumathi Narayanasamy

Computers

University

Used 4+ times

AI and ES Unit 2
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

 Depth-First Search is implemented with _______ data structure.

LIFO

FIFO

LILO

Priority Queue

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Best First search expands the node n with the __________

Heuristic cost

Average path cost

lowest path cost

highest path cost

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When is breadth-first search optimal?

 

when there is more number of nodes

when there is less number of nodes

when all step costs are unequal

when all step costs are equal

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure conveniently used to implement Best First Search?

Queue

linked list

stacks

priority queue

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

  What is the major component/components for measuring the performance of problem solving?

Completeness

optimality

All of these

time complexity

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

     Which is the best way to go for Game playing problem?

Optimal approach

Heuristic approach (Some knowledge is stored)

Linear approach

Random approach

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is Space Complexity of Depth First search algorithm?

O(4b)

O(b^2)

O(b^b)

O(bm)

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?