Uninformed Search Algorithms Quiz

Uninformed Search Algorithms Quiz

University

15 Qs

quiz-placeholder

Similar activities

Unit 6: Loops and Traversals Test

Unit 6: Loops and Traversals Test

9th - 12th Grade

17 Qs

AP CSP Linear Search

AP CSP Linear Search

12th Grade

10 Qs

ONE 6th FORM A* & Dijkstras and complexities

ONE 6th FORM A* & Dijkstras and complexities

12th Grade

20 Qs

Algorithm questions

Algorithm questions

12th Grade - University

20 Qs

AP Computer Science Principles Unit 6

AP Computer Science Principles Unit 6

9th - 12th Grade

15 Qs

Code.org Lesson 1-14

Code.org Lesson 1-14

9th - 12th Grade

15 Qs

AP CSP Code.org Unit 6

AP CSP Code.org Unit 6

9th - 12th Grade

17 Qs

Unit 6 AP CSP

Unit 6 AP CSP

9th - 12th Grade

17 Qs

Uninformed Search Algorithms Quiz

Uninformed Search Algorithms Quiz

Assessment

Quiz

Computers

University

Hard

Created by

R.VIDHYA HICET AIML FACULTY

Used 4+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which type of search algorithm operates in a brute force way?

Optimal Search

Informed Search

Uninformed Search

Heuristic Search

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is another name for Uninformed search algorithms?

Blind Search

Selective Search

Intelligent Search

Efficient Search

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which search algorithm expands all successor nodes at the current level before moving to nodes of the next level?

Bidirectional Search

Depth-first Search

Breadth-first Search

Uniform-cost Search

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What data structure is used to implement Breadth-first Search?

Heap

FIFO Queue

Priority Queue

Stack

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which search algorithm provides a solution if any solution exists?

Depth-first Search

Depth-limited Search

Uniform-cost Search

Breadth-first Search

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the main advantage of Depth-first Search in terms of memory?

Memory intensive

Requires lots of memory

Memory efficient

Memory optimized

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which search algorithm may go into an infinite loop?

Depth-limited Search

Depth-first Search

Breadth-first Search

Uniform-cost Search

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?