BSCS Bachelor of Science in Computer Science: Artificial Intelligence Fundamentals 2

Question 1

Which search algorithm uses a heuristic function h(n) to estimate the cost from node n to the goal and expands the node with the lowest f(n) = g(n) + h(n)?

Accepted Answer

A* search

Answer

A* search combines the actual path cost g(n) with a heuristic estimate h(n) to find the optimal path efficiently.

Question 2

In a Bayesian network, what does a conditional probability table (CPT) specify?

Accepted Answer

The probability of a node given all possible combinations of its parents' values

Answer

A CPT for a node lists P(node | parent combinations), capturing all conditional dependencies.

Question 3

What is the primary purpose of the softmax function in a neural network's output layer for multi-class classification?

Accepted Answer

Normalize outputs into a probability distribution summing to 1

Answer

Softmax exponentiates each output and divides by the sum, converting raw scores into class probabilities.

Question 4

Which phenomenon occurs when a decision tree is trained to perfectly fit training data, including noise, resulting in poor generalization?

Accepted Answer

Overfitting

Answer

Overfitting happens when a model captures noise and random fluctuations in training data rather than the true underlying pattern.

Question 5

In reinforcement learning, what is the Bellman equation used for?

Accepted Answer

Expressing the value of a state recursively in terms of immediate reward and future value

Answer

The Bellman equation decomposes V(s) = R + γ·V(s'), forming the foundation for dynamic programming in RL.

BSCS - Bachelor of Science in Computer Science Practice Test

BSCS - Bachelor of Science in Computer Science Practice Test

BSCS Bachelor of Science in Computer Science: Artificial Intelligence Fundamentals 2