Quiz on Search Algorithms

Quiz on Search Algorithms

University

40 Qs

quiz-placeholder

Similar activities

PKL CICIMANJA

PKL CICIMANJA

12th Grade - University

35 Qs

Cuestionario de Repaso Final Entorno Económico Digital

Cuestionario de Repaso Final Entorno Económico Digital

University

40 Qs

Quiz on Electricity and Electronics

Quiz on Electricity and Electronics

12th Grade - University

41 Qs

Quiz on History and Careers in Computing

Quiz on History and Careers in Computing

University

40 Qs

Soal Pilihan Ganda

Soal Pilihan Ganda

University

40 Qs

Pre-Test AI by Morning

Pre-Test AI by Morning

University

40 Qs

Project Management - Risk Management

Project Management - Risk Management

University

45 Qs

Latihan Soal Informatika Kelas 7

Latihan Soal Informatika Kelas 7

7th Grade - University

35 Qs

Quiz on Search Algorithms

Quiz on Search Algorithms

Assessment

Quiz

Information Technology (IT)

University

Practice Problem

Hard

Created by

Kanchan Taksale

Used 6+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

40 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What data structure is used in BFS?

Stack

Queue

Linked List

Tree

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is true for BFS?

It uses LIFO structure

It may not find the shortest path

It explores all nodes at one depth before moving to the next

It is faster than DFS

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

BFS is optimal when:

All actions have the same cost

Graph has cycles

Goal node is far

Nodes have variable cost

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

BFS is a type of:

Informed search

Blind search

Heuristic search

Local search

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which traversal guarantees the shortest path in unweighted graphs?

DFS

A*

UCS

BFS

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What data structure is used in DFS?

Queue

Stack

Heap

Array

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

DFS is not guaranteed to find the optimal path because:

It is incomplete

It explores the deepest path first

It uses heuristics

It doesn’t store visited nodes

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?