Search Algorithms

Search Algorithms

University

18 Qs

quiz-placeholder

Similar activities

Spreadsheet Fundamentals - Quiz2

Spreadsheet Fundamentals - Quiz2

University

20 Qs

Coding Karel 2

Coding Karel 2

KG - University

20 Qs

ITE TEST 2

ITE TEST 2

University

20 Qs

Computer Hardware - CPU & GPU

Computer Hardware - CPU & GPU

7th Grade - University

16 Qs

Java Quiz 4

Java Quiz 4

University

15 Qs

Skill Competition Quiz 2024

Skill Competition Quiz 2024

10th Grade - University

20 Qs

Binary Tree

Binary Tree

University

14 Qs

Python Quiz

Python Quiz

University

15 Qs

Search Algorithms

Search Algorithms

Assessment

Quiz

Computers

University

Hard

Created by

Eben Sophia Paul

Used 30+ times

FREE Resource

AI

Enhance your content in a minute

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

18 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Searching is a Sequence of Steps that transforms the _______________ to the _______________.

Initial State , Goal State

Goal State , Initial State

Start State, Initial State

Goal State, Start State

2.

MULTIPLE SELECT QUESTION

30 sec • 1 pt

Un-informed Search Examples are

Breadth First Search

Depth First Search

Bidirectional search

All of these

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following search algorithm requires less memory?

Depth First Search

Optimal Search

Breadth-First Search

Linear Search

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A heuristic is a way

To discover something or an idea embedded in a program

To compare two nodes in a search tree to see if one is better than other

To search and measure how far a node in a search tree seems to be from goal

All Above

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Dijkstra’s algorithm / Uniform-cost search expands the node n with the ......

Heuristic cost

Lowest path cost

Highest path cost

Average path cost

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A* evaluates nodes by combining g(n), the cost to reach the node, and f(n), the cost to get from the node to the goal.

TRUE

FALSE

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the followings have no additional information about the states

Uninformed search

Informed search

All

None

Create a free account and access millions of resources

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?