Quiz on BFS and DFS Algorithms

Quiz on BFS and DFS Algorithms

University

15 Qs

quiz-placeholder

Similar activities

Búsquedas

Búsquedas

University

12 Qs

Multiple-Choice Quiz: Algorithms Lab 2

Multiple-Choice Quiz: Algorithms Lab 2

University

10 Qs

Sư phạm Tin học

Sư phạm Tin học

University

10 Qs

NETWORKING PART 02

NETWORKING PART 02

University

10 Qs

Quiz về Lập Trình Robot

Quiz về Lập Trình Robot

University

17 Qs

AI Unit 2 Quiz

AI Unit 2 Quiz

University

10 Qs

IT6 (Quiz 4)

IT6 (Quiz 4)

University

15 Qs

Quiz về Thuật Toán Tìm Kiếm Theo Chiều Sâu (DFS)

Quiz về Thuật Toán Tìm Kiếm Theo Chiều Sâu (DFS)

University

19 Qs

Quiz on BFS and DFS Algorithms

Quiz on BFS and DFS Algorithms

Assessment

Quiz

Information Technology (IT)

University

Medium

Created by

Kanchan Taksale

Used 1+ times

FREE Resource

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What type of data structure does BFS use?

Stack

Priority Queue

Queue

Tree

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the main characteristic of uninformed search algorithms?

They use heuristics

They are always optimal

They do not use domain knowledge

They use backtracking

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is true about BFS?

It always finds the deepest path

It uses LIFO order

It finds the shortest path if all step costs are equal

It never consumes more memory than DFS

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In BFS, nodes are explored in what order?

Alphabetical order

Last-visited first

Deepest node first

Level by level

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which real-world activity best represents BFS?

Solving a maze

Finding an item in a supermarket row-by-row

Navigating deep menu options in a food app

Searching nested folders

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm uses recursion or a stack?

BFS

Dijkstra

DFS

A*

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

In DFS, the search goes as deep as possible before...

Halting

Skipping nodes

Backtracking

Returning an error

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?