wayground logo

Free Printable Worksheets

NEW

Font size

S
M
L
XL
Worksheets

AI QUIZ

Total questions: 63

Worksheet time: 32mins

Name
Class
Date
1.

What is the primary goal of supervised learning in AI?

a)

To discover hidden patterns in data

b)

To improve performance through feedback

c)

To train models using labeled data

d)

To generate new data points

2.

Which concept involves training a model to make decisions through rewards and penalties?

a)

Supervised Learning

b)

Unsupervised Learning

c)

Reinforcement Learning

d)

Neural Networks

3.

What is a common challenge in AI known as the 'black box' problem?

a)

Difficulty in understanding AI algorithms

b)

High computational cost

c)

Lack of Data

d)

Ethical concerns

4.

Which problem arises from an AI system?

a)

Overfitting

b)

Underfitting

c)

Bias and fairness issues

d)

High accuracy

5.

What does the term 'overfitting' refer to in AI?

a)

When a model performs well on training data but poorly on new data

b)

When a model performs well on both training and test data

c)

When a model is too simple to capture the complexity of the data

d)

When a model's accuracy is very high

6.

What challenge is addressed by the problem of 'scalability' in AI?

a)

The ability to handle increasing amounts of data

b)

The speed of data processing

c)

The complexity of algorithm design

d)

The ethical implications of AI

7.

Which of the following is a common issue with AI systems that involve natural language processing?

a)

Inability to understand numerical data

b)

Difficulty in handling ambiguity and context

c)

Limited hardware resources

d)

High computational cost

8.

What is an AI?

a)

software

b)

device

c)

system

d)

machine

9.

What is an 'intelligent agent' in the context of AI?

a)

program that performs a specific task

b)

that follows pre-defined commands

c)

that perceives its environment and takes actions to achieve goals

d)

that performs calculations

10.

Which of the following is NOT a characteristic of an intelligent agent?

a)

A) Perception

b)

B) Decision-Making

c)

C) Goal-Orientation

d)

D) Data Storage

11.

What does the term 'autonomy' refer to in the context of intelligent agents?

a)

The ability to store large amounts of data

b)

The capacity to act without human intervention

c)

The speed at which the agent operates

d)

The ability to analyze data

12.

According to the rational agent model, how should an agent act?

a)

By maximizing its expected performance measure

b)

By following a set of predefined rules

c)

By imitating human behavior

d)

By performing tasks as quickly as possible

13.

What is the ‘performance measure’ in the context of intelligent agents?

a)

A metric for the agent's computational efficiency

b)

A way to evaluate how well the agent achieves its goals

c)

A measure of the agent’s processing speed

d)

The amount of data the agent can handle

14.

What is the primary challenge in solving the 8 Queens problem using a search algorithm?

a)

The size of the state space is very large

b)

The problem involves numerical calculations

c)

There are multiple solutions that need to be found

d)

The chessboard is of variable size

15.

Which search strategy expands the shallowest nodes first?

a)

Depth-First Search

b)

Breadth-First Search

c)

Best-First Search

d)

Iterative Deepening Search

16.

In which search strategy are nodes expanded based on a cost?

a)

Uniform Cost Search

b)

A* Search

c)

Depth-First Search

d)

Random Search

17.

Which search strategy is typically used when the solution is expected to be found at a deep level in the search tree?

a)

Depth-First Search

b)

Breadth-First Search

c)

Greedy Search

d)

Iterative Deepening Search

18.

What is the purpose of the Minimax algorithm in game playing?

a)

To find the optimal move for a player assuming the opponent also plays optimally

b)

To generate random moves in a game

c)

To evaluate the probability of winning a game

d)

To minimize the computational cost of searching

19.

In the Minimax algorithm,

a)

The maximum possible

b)

The minimum possible

c)

The minimum value a

d)

The minimum number of

20.

What does the 'min' part represent?

a)

score for the player

b)

score that the opponent will allow

c)

player can achieve given optimal opponent play

d)

moves needed to win

21.

What is the primary disadvantage of the basic Minimax algorithm?

a)

It is not able to handle deterministic games

b)

It can be computationally expensive due to the large number of possible game states

c)

It does not guarantee an optimal solution

d)

It cannot be used in zero-sum games

22.

What is the main advantage of Alpha-Beta Pruning over the standard Minimax algorithm?

a)

It guarantees a faster solution by exploring fewer nodes in the game tree

b)

It can handle non-deterministic games

c)

It improves the accuracy of the game evaluation

d)

It provides a better heuristic function

23.

In Alpha-Beta Pruning, what does the 'alpha' value represent?

a)

The best value that the maximizer can

b)

The worst value that the maximizer can

c)

The maximum value the minimizer is

d)

The threshold for pruning the tree

24.

What does the 'beta' value represent in Alpha-Beta Pruning?

a)

The best value that the minimizer can guarantee at that level or below

b)

The worst value that the maximizer can guarantee at that level or below

c)

The maximum value the maximizer is guaranteed to achieve

d)

The threshold for pruning the tree

25.

When does Alpha-Beta Pruning cut off a branch of the game tree?

a)

When the value of a node is less than or equal to the alpha value

b)

When the value of a node is greater than or equal to the beta value

c)

When the value of a node is less than the beta value

d)

When the value of a node is greater than the alpha value

26.

In which type of games is Alpha-Beta Pruning most effective?

a)

Games with a very large state space and multiple possible moves

b)

Games with very few possible moves and a small state space

c)

Games with stochastic elements

d)

Games where optimal play is not possible

27.

Which of the following is a sound argument?

a)

Modus Ponens

b)

Affirming the Consequent

c)

Denying the Antecedent

d)

Affirming the Disjunct

28.

In first-order logic, which of the following is a valid quantifier?

a)

∧ (AND)

b)

∨ (OR)

c)

∀ (For all)

d)

⊕ (XOR)

29.

What is a predicate in first-order logic?

a)

A variable

b)

A function

c)

A statement that may contain variables

d)

A logical operator

30.

Which of the following is an example of a first-order logic sentence?

a)

P

b)

P(x)

c)

x > y

d)

∀x P(x)

31.

What does the symbol "∃" represent in first-order logic?

a)

For all

b)

There exists

c)

Not

d)

Implies

32.

Which of the following represents a constant in first-order logic?

a)

x

b)

loves(John, Mary)

c)

∀y

d)

42

33.

What is a domain in first-order logic?

a)

The set of all possible sentences

b)

The set of all possible sentences

c)

The set of all possible functions

d)

The set of all possible variables

34.

What is the difference between propositional logic and first-order logic?

a)

Proposition logic is more expressive

b)

First-order logic includes quantifiers and variables

c)

Proposition logic includes quantifiers and variables

d)

First-order logic only deals with true/false values

35.

Which of the following is a function in first-order logic?

a)

x

b)

f(x)

c)

∀x

d)

P(x)

36.

What is unification in the context of first-order logic?

a)

A) A process of combining two logic systems

b)

B) A process of determining if two expressions are identical

c)

C) A method of simplifying expressions

d)

D) A way to solve a set of equations

37.

In logic, what does the term "ground term" refer to?

a)

A term that contains variables

b)

A term with no variables

c)

A term that is always true

d)

A term that is always false

38.

What does the resolution principle in first-order logic help with?

a)

Proving tautologies

b)

Simplifying logical expressions

c)

Deriving contradictions

d)

Establishing the validity of arguments

39.

Which of the following is an example of a domain-independent planning approach?

a)

A) A navigation system in a specific building

b)

B) A chess-playing algorithm

c)

C) The STRIPS planning system

d)

D) A customer service chatbot

40.

What is a "causal link" in a partial order planning algorithm?

a)

A sequence of actions with no dependencies

b)

A relationship between an action and a goal state

c)

A connection between a precondition of one action and the effect of another

d)

A list of all actions in a plan

41.

What does it mean if a plan is "consistent"?

a)

All actions are executed in parallel

b)

There are no conflicts between the actions in the plan

c)

The plan can be executed in reverse order

d)

The plan has the shortest possible sequence of actions

42.

"threat" in partial order planning?

a)

that must be executed immediately

b)

that could interfere with the causal links of the plan

c)

cannot be achieved

d)

condition that must be maintained throughout the plan

43.

In the context of planning, what is a "satisfying assignment"?

a)

An assignment of actions to agents

b)

A plan that satisfies the goal conditions

c)

An assignment of values to variables that satisfies all constraints

d)

An assignment of tasks to resources

44.

What is the main objective of a planning agent?

a)

To maximize its reward function

b)

To find the shortest path to the goal state

c)

To generate a sequence of actions that leads from the initial state to the goal state

d)

To learn from its environment

45.

In planning, what is "backtracking"?

a)

A method for checking all possible states

b)

A technique for undoing actions to explore alternative plans

c)

A way to measure the complexity of a plan

d)

A method for optimizing the order of actions

46.

What is a "flaw" in partial order planning?

a)

An error in the planning algorithm

b)

A missing precondition or unresolved threat in the plan

c)

An action that cannot be executed

d)

A state that cannot be reached

47.

Which of the following best describes a "totally ordered plan"?

a)

A plan with all actions executed simultaneously

b)

A plan where actions can be performed in any order

c)

A plan where all actions are in a strict sequence

d)

A plan with some actions in parallel and others in sequence

48.

What is the purpose of "plan refinement" in partial order planning?

a)

To remove unnecessary actions from the plan

b)

To resolve flaws and ensure consistency

c)

To minimize the cost of the plan

d)

To identify the optimal sequence of actions

49.

In the context of planning, what does "scheduling" refer to?

a)

The allocation of resources to tasks

b)

The process of determining the order and timing of actions

c)

The identification of the initial state

d)

The definition of the goal state

50.

What is a "linearization"?

a)

A single sequence of actions

b)

A plan that involves

c)

A plan that does not

d)

A plan with all

51.

What is the purpose of pruning in decision tree learning?

a)

A) To add more branches to the tree

b)

B) To remove unnecessary branches and reduce overfitting

c)

C) To increase the depth of the tree

d)

D) To split continuous data into categories

52.

What is the main disadvantage of decision trees?

a)

They cannot handle large datasets

b)

They are prone to overfitting

c)

They are difficult to interpret

d)

They only work with numerical data

53.

In a decision tree, what is a "leaf node"?

a)

A node that performs a test on an attribute

b)

A node that splits the data into subsets

c)

A terminal node that provides the final decision or classification

d)

A node that merges different branches

54.

Which of the following best describes "entropy" in decision tree?

a)

A measure of the balance in a dataset

b)

A measure of the impurity or disorder of a node

c)

A metric for evaluating model accuracy

d)

A method for handling missing values

55.

What is a characteristic of a partial order plan?

a)

actions derived from a partial order plan

b)

only one action

c)

require any ordering of actions

d)

actions executed in parallel

56.

How the performance of a decision tree is typically evaluated?

a)

Using the accuracy, precision, recall, and F1 score

b)

By measuring its training time

c)

By counting the number of attributes used

d)

By calculating its entropy

57.

What is the role of a "training set" in machine learning?

a)

To test the model's performance

b)

To validate the model's parameters

c)

To train the model and adjust its parameters

d)

To handle missing values

58.

What does "overfitting" mean in the context of decision trees?

a)

The model performs well on training data but poorly on unseen data

b)

The model is too simple and underperforms

c)

The model is too complex and does not generalize well

d)

The model ignores significant features

59.

Which of the following techniques can help reduce overfitting in decision trees?

a)

Increasing the depth of the tree

b)

Using more attributes for splitting

c)

Applying pruning methods

d)

Ignoring irrelevant features

60.

The 'generalization' ability of a learning model refer to?

a)

model's ability to memorize training data

b)

capacity to adapt to new, unseen data

c)

model's accuracy on training data

d)

model's computational efficiency

61.

Which of the following is a benefit of decision trees?

a)

They are highly resistant to overfitting

b)

They can handle both categorical and continuous data

c)

They are complex and difficult to interpret

d)

They require extensive preprocessing of data

62.

What is the primary role of the 'learning element' in a learning agent?

a)

To execute actions based on current knowledge

b)

To adapt and improve performance based on feedback

c)

To provide feedback on performance

d)

To monitor environmental changes

63.

How does ensemble learning enhance decision tree performance?

a)

By training multiple trees and combining their predictions

b)

By increasing the depth of individual trees

c)

By reducing the number of attributes used

d)

By simplifying the decision tree structure