ARTIBA ARTIFICIAL INTELLIGENCE ENGINEER
CERTIFICATION FINAL PAPER 2026 TEST PAPER
◉ Rational Agent. Answer: An entity that acts to achieve the best
outcome or, when there is uncertainty, the best expected outcome.
◉ Search Tree. Answer: A representation of all the possible moves
branching out from the initial state of the problem
◉ Frontier. Answer: The set of states unevaluated but discovered
from evaluated states.
◉ Completeness. Answer: Refers to whether the algorithm is
guaranteed to find a solution when there is one.
◉ Optimality. Answer: Refers to whether the optimal solution is
found.
◉ Time Complexity. Answer: the amount of time taken by an
algorithm to run as a function of the length of the input.
◉ Measuring Time. Answer: Often measured in terms of the number
of nodes generated during the search.
,◉ Measuring Space. Answer: Often measured in terms of the
maximum number of nodes generated during the search.
◉ Space Complexity. Answer: How much memory an algorithm
needs.
◉ Branching Factor (b). Answer: Maximum number of successors of
any node.
◉ Depth of the Shallowest Goal Node (d). Answer: Refers to the
height of the shallowest goal node.
◉ Breadth First Search (BFS). Answer: Expand the shallowest node
on the frontier.
◉ Breadth First Search: Completeness. Answer: A search solution is
complete if b (Branching Factor) and d (Depth of the Shallowest Goal
Node) are finite.
◉ Breadth First Search: Optimality. Answer: A search solution is
optimal if path cost is a non-descending function of node depth.
◉ Breadth First Search: Time Complexity. Answer: O(b^d)
, ◉ Breadth First Search: Space Complexity. Answer: O(b^d)
◉ Depth First Search (DFS). Answer: Expand the deepest node on
the frontier.
◉ Depth First Search: Completeness. Answer: A search solution is
complete if it's a graph-search and there is finite state space. It's not
if it's a tree search.
◉ Depth First Search: Optimality. Answer: The search solution is not
optimal.
◉ Depth First Search: Time Complexity. Answer: O(b^m)
b - Branching Factor
m - Max Depth
◉ Depth First Search: Space Complexity. Answer: O(bm)
b - Branching Factor
m - Max Depth
CERTIFICATION FINAL PAPER 2026 TEST PAPER
◉ Rational Agent. Answer: An entity that acts to achieve the best
outcome or, when there is uncertainty, the best expected outcome.
◉ Search Tree. Answer: A representation of all the possible moves
branching out from the initial state of the problem
◉ Frontier. Answer: The set of states unevaluated but discovered
from evaluated states.
◉ Completeness. Answer: Refers to whether the algorithm is
guaranteed to find a solution when there is one.
◉ Optimality. Answer: Refers to whether the optimal solution is
found.
◉ Time Complexity. Answer: the amount of time taken by an
algorithm to run as a function of the length of the input.
◉ Measuring Time. Answer: Often measured in terms of the number
of nodes generated during the search.
,◉ Measuring Space. Answer: Often measured in terms of the
maximum number of nodes generated during the search.
◉ Space Complexity. Answer: How much memory an algorithm
needs.
◉ Branching Factor (b). Answer: Maximum number of successors of
any node.
◉ Depth of the Shallowest Goal Node (d). Answer: Refers to the
height of the shallowest goal node.
◉ Breadth First Search (BFS). Answer: Expand the shallowest node
on the frontier.
◉ Breadth First Search: Completeness. Answer: A search solution is
complete if b (Branching Factor) and d (Depth of the Shallowest Goal
Node) are finite.
◉ Breadth First Search: Optimality. Answer: A search solution is
optimal if path cost is a non-descending function of node depth.
◉ Breadth First Search: Time Complexity. Answer: O(b^d)
, ◉ Breadth First Search: Space Complexity. Answer: O(b^d)
◉ Depth First Search (DFS). Answer: Expand the deepest node on
the frontier.
◉ Depth First Search: Completeness. Answer: A search solution is
complete if it's a graph-search and there is finite state space. It's not
if it's a tree search.
◉ Depth First Search: Optimality. Answer: The search solution is not
optimal.
◉ Depth First Search: Time Complexity. Answer: O(b^m)
b - Branching Factor
m - Max Depth
◉ Depth First Search: Space Complexity. Answer: O(bm)
b - Branching Factor
m - Max Depth
