Quiz on Informed and Uninformed Algorithms-AI-17.02.2025

Quiz on Informed and Uninformed Algorithms-AI-17.02.2025

20 Qs

quiz-placeholder

Similar activities

Unit 1a Assessment Review

Unit 1a Assessment Review

12th Grade

17 Qs

Worded fractions

Worded fractions

4th Grade

15 Qs

G7 STEM Q1 Final Examination

G7 STEM Q1 Final Examination

KG - University

15 Qs

Beginner Grammar 3 Entrance Test

Beginner Grammar 3 Entrance Test

KG - University

17 Qs

Accountancy Class XII Quiz-2

Accountancy Class XII Quiz-2

12th Grade - University

20 Qs

FinalTest 1stSem 24-25 M3

FinalTest 1stSem 24-25 M3

9th - 12th Grade

20 Qs

Web Development Technologies II Viva Quiz

Web Development Technologies II Viva Quiz

KG - University

19 Qs

Quiz on Informed and Uninformed Algorithms-AI-17.02.2025

Quiz on Informed and Uninformed Algorithms-AI-17.02.2025

Assessment

Quiz

others

Practice Problem

Medium

Created by

Elumalaivasan P

Used 4+ times

FREE Resource

AI

Enhance your content in a minute

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

20 questions

Show all answers

1.

OPEN ENDED QUESTION

30 sec • Ungraded

Reg.No (Ex. RA2311027010076)

Evaluate responses using AI:

OFF

2.

OPEN ENDED QUESTION

30 sec • Ungraded

Full Name

Evaluate responses using AI:

OFF

3.

OPEN ENDED QUESTION

30 sec • Ungraded

Section

Evaluate responses using AI:

OFF

4.

OPEN ENDED QUESTION

30 sec • Ungraded

Mail-Id

Evaluate responses using AI:

OFF

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is an uninformed search algorithm?

A* Search
Greedy Best-First Search
Breadth-First Search (BFS)
Iterative Deepening A* (IDA*)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which search algorithm guarantees the shortest path in an unweighted graph?

Depth-First Search (DFS)
Breadth-First Search (BFS)
A* Search
Uniform Cost Search (UCS)

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following is a feature of Depth-First Search (DFS)?

It is guaranteed to find the optimal solution.
It explores all nodes at the current depth level before moving to the next.
It explores a node as far as possible before backtracking.
It uses a heuristic function to guide the search.

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?