Prelim Exam - A.I. - Part 1

Prelim Exam - A.I. - Part 1

University

40 Qs

quiz-placeholder

Similar activities

FA4 CANVA TEST

FA4 CANVA TEST

7th Grade - University

40 Qs

database

database

University

40 Qs

Midterm Exam

Midterm Exam

University

35 Qs

Latihan Soal AAS Ganjil Kelas 7

Latihan Soal AAS Ganjil Kelas 7

7th Grade - University

40 Qs

PHP Quiz

PHP Quiz

University

35 Qs

OP 4 SPECIAL EXAM MIDTERM

OP 4 SPECIAL EXAM MIDTERM

University

40 Qs

CPU's

CPU's

University

40 Qs

Desktop Publishing Quiz 2

Desktop Publishing Quiz 2

University

40 Qs

Prelim Exam - A.I. - Part 1

Prelim Exam - A.I. - Part 1

Assessment

Quiz

Computers

University

Medium

Created by

Ronald Baldemoro

Used 2+ 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

45 sec • 1 pt

Which of the following best defines a search space?

The final solution of a problem

A set of possible solutions a system may have

The memory required for searching

The sequence of percepts an agent receives

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The start state in a search problem refers to:

The most optimal solution

The initial point where the agent begins searching

The goal state of the problem

The path cost of the first step

3.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which property of a search algorithm guarantees finding a solution if one exists?

Optimality

Completeness

Time complexity

Space complexity

4.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

The function that checks if the current state meets the goal is called:

Start state

Search tree

Goal test

Transition model

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

In a search tree, the “fringe” refers to:

The root node

All expanded nodes

The leaves (nodes available for expansion)

The internal states already visited

6.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Which search strategy explores all nodes at the current depth before moving deeper?

Depth-First Search

Breadth-First Search

Hill Climbing

A* Search

7.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

A search algorithm is considered optimal if it:

Finds the fastest solution

Always finds a solution

Guarantees the best (lowest cost) solution

Uses the least amount of memory

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

By signing up, you agree to our Terms of Service & Privacy Policy

Already have an account?