Search Algorithms

Search Algorithms

University

18 Qs

quiz-placeholder

Similar activities

Data Structures and Algorithms Quiz - BATCH 1

Data Structures and Algorithms Quiz - BATCH 1

University

23 Qs

Kuis PKB

Kuis PKB

University

20 Qs

TEKNIK SEARCHING

TEKNIK SEARCHING

University

20 Qs

Artificial Intelligence - Unit - 1

Artificial Intelligence - Unit - 1

University

23 Qs

Graph Theory Data Structures

Graph Theory Data Structures

University

17 Qs

Kuis Artificial Intelligence

Kuis Artificial Intelligence

University

15 Qs

1 Binary Search Trees

1 Binary Search Trees

University

20 Qs

Lecture EIGHT.

Lecture EIGHT.

University

20 Qs

Search Algorithms

Search Algorithms

Assessment

Quiz

Computers

University

Hard

Created by

Eben Sophia Paul

Used 18+ times

FREE Resource

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
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?