Fundamentals of Artificial Intelligence
Fundamentals of Artificial Intelligence
Fundamentals of Artificial Intelligence
Which of the following is NOT a step in the process of using a cost matrix to assess and manage
risks?
● Identifying potential risks
● Evaluating the likelihood and impact of each risk
● Determining the cost of each risk
● Implementing risk mitigation measures
What is the main disadvantage of using iterative deepening over a depth-first search algorithm?
● It requires less memory to store the visited nodes
● It requires less computation time to search the tree
● It requires more memory to store the visited nodes
● It requires more computation time to search the tree
In uncertain knowledge, which of the following is a valid inference rule that allows you to infer the truth
of a statement based on the falsehood of another statement and the truth of a third statement?
● Modus tollens
● Disjunctive syllogism
● Modus ponens
● Affirming the consequent
What is the relationship between the maximum entropy distribution and the available information in
maximum entropy without explicit constraints?
● The maximum entropy distribution incorporates some of the available information
● The maximum entropy distribution incorporates all the available information
● The maximum entropy distribution incorporates none of the available information
● The maximum entropy distribution is independent of the available information
Which of the following is NOT an example of a problem that could be solved using a greedy search
algorithm?
● Solving the knapsack problem (choosing a set of items to maximize value while staying within
a weight limit)
● Finding the shortest path between two points on a map
● Solving a puzzle such as the Tower of Hanoi
● Sorting a list of numbers in ascending order
In first-order predicate logic, what is an open formula?
● A formula that is always true
● A formula that contains only predicates
● A formula that contains a free variable
● A formula that contains only closed terms
Can minmax search handle games with more than two players?
● No, minmax search can only be used for two-player games
● Yes, by using a modified version of the algorithm
● It depends on the game
● Yes, by using the same algorithm as for two-player games
What is the time complexity of depth-first search in terms of the number of nodes, n, and the number
of edges, m?
● O(m)
● ONo
● O(n + m)
● O(n * m)
What is the main advantage of heuristic search over other search algorithms?
● It is more accurate
● It can find solutions to problems with a large search space more efficiently
● It can find solutions to problems with a small search space more efficiently
● It is faster
Which of the following is NOT a criterion for a formal system to be subject to Gödel's incompleteness
theorems?
● The system must be finite
● The system must be capable of expressing basic arithmetic
● The system must be consistent
● The system must be complete
What are some factors that can influence an individual's subjective probability?
● Objective, observable data and statistical analysis
● Personal beliefs, opinions, and experiences
● The outcome of a coin flip
● All of the above
What is the relationship between the Shannon entropy and the information in a distribution in
maximum entropy without explicit constraints?
● The Shannon entropy is maximized when the information in a distribution is uniform
● The Shannon entropy is proportional to the information in a distribution
● The Shannon entropy is the information in a distribution
● The Shannon entropy is the inverse of the information in a distribution
What is the relationship between the maximum entropy distribution and the underlying distribution in
maximum entropy without explicit constraints?
● The maximum entropy distribution is the same as the underlying distribution
● The maximum entropy distribution is independent of the underlying distribution
● The maximum entropy distribution is similar to the underlying distribution
● The maximum entropy distribution is different from the underlying distribution
What is the main advantage of using iterative deepening over a depth-first search algorithm?
● It allows the search to cover fewer nodes in more time
● It allows the search to cover more nodes in less time
● It allows the search to cover fewer nodes in less time
● It allows the search to cover more nodes in more time
In which of the following scenarios would a heuristic search algorithm be least useful?
● When the search space is small and the optimal solution is not important
● When the search space is large and the optimal solution is not important
● When the search space is large and the optimal solution is important
● When the search space is small and the optimal solution is important
What is the primary goal of godelization?
● To prove the existence of God
● To create a system of logic that is consistent and complete
● To encode information in a way that is resistant to tampering or corruption
● To create a system of logic that is consistent but incomplete
Which of the following is NOT a criterion for a statement to be considered unprovable within a
godelized system of logic?
● It is not a combination of theorems of the system
● It is not a negation of a theorem of the system
● It is not a contradiction of a theorem of the system
● It is not a theorem of the system
In which of the following scenarios would a heuristic search algorithm be most useful?
● When the search space is large and the optimal solution is not important
● When the search space is large and the optimal solution is important
● When the search space is small and the optimal solution is not important
● When the search space is small and the optimal solution is important
In what type of search problem is it guaranteed that a heuristic search algorithm will find the optimal
solution in a reasonable amount of time?
● Constraint satisfaction problems
● Traveling salesman problems
● Decision tree problems
● None of the above
In uncertain knowledge, which of the following is a valid inference rule that allows you to infer the truth
of a statement based on the truth of multiple other statements?
● Modus ponens
● Conjunction
● Affirming the consequent
● Modus tollens
Which of the following is NOT a way in which Gödel's incompleteness theorems have influenced the
field of mathematics education?
● They have led to the abandonment of the study of mathematics
● They have sparked debates about the importance of proof in mathematics
● They have led to the development of new teaching methods
● They have led to the development of new mathematics curricula
What is a cost matrix in the context of machine learning?
● A matrix that represents the cost of making predictions
● A matrix that represents the cost of implementing a model
● A matrix that represents the cost of training a model
● A matrix that represents the cost of deploying a model
Which of the following is NOT a way in which Gödel's incompleteness theorems have influenced the
field of philosophy?
● They have led to new discussions about the nature of reality
● They have led to the abandonment of the use of reasoning
● They have led to the development of new philosophical systems
● They have sparked debates about the limits of knowledge
Incorrect answers. Choose one of the answers not colored in red for a chance to get
the correct answer.
In uncertain knowledge, which of the following is a valid inference rule that allows you to infer the
falsehood of a statement based on the falsehood of another statement?
● Modus ponens
● Denying the antecedent
● Affirming the consequent
● Modus tollens
Which of the following is NOT a factor that can impact the performance of heuristic search
algorithms?
● The type of problem being solved
● The quality of the heuristic function
● The size of the search space
● The number of processors in the computer
In what way is the principle of maximum entropy related to the principle of maximum ignorance?
● They are independent of each other
● The principle of maximum entropy is a special case of the principle of maximum ignorance
● They are equivalent
● The principle of maximum ignorance is a special case of the principle of maximum entropy
Which of the following is NOT a consequence of Gödel's incompleteness theorems for the formal
system of Peano arithmetic?
● The consistency of the system cannot be proven within the system
● The system cannot prove its own completeness
● The system cannot prove its own consistency
● There are always unprovable statements within the system
What is the probability of an event occurring if it is twice as likely to happen as not happen?
● 75%
● 0%
● 50%
● 25%
What is probability?
● A measure of the likelihood of an event occurring
● A measure of the likelihood of an event occurring divided by the total number of events
● A measure of the likelihood of an event NOT occurring divided by the total number of events
● A measure of the likelihood of an event NOT occurring
In a binary cost matrix, what do the elements in the first row and first column represent?
● The cost of predicting the positive class when the actual class is negative
● The cost of predicting the negative class when the actual class is positive
● The cost of predicting the negative class when the actual class is negative
● The cost of predicting the positive class when the actual class is positive
Which of the following statements about the principle of maximum entropy is NOT true?
● It assumes that the system is in a state of maximum disorder
● It is used to predict the behavior of a system in equilibrium
● It can be used to predict the probability of different outcomes in a system
● It is based on the idea that the probability of a state is proportional to its energy
What is the name of the godelized system of logic that is based on the axioms of set theory?
● ZF set theory
● PA set theory
● ZFC set theory (might be the correct answer)
● PA+ set theory
What is the main advantage of using iterative deepening over a breadth-first search algorithm?
● It allows the search to cover more nodes in less time
● It allows the search to cover more nodes in more time
● It allows the search to cover fewer nodes in less time
● It allows the search to cover fewer nodes in more time
How is the maximum entropy distribution found in maximum entropy without explicit constraints?
● By using a gradient descent algorithm
● By using an iterative optimization algorithm
● By using a support vector machine algorithm
● By using a least squares algorithm
In what type of search problem is it guaranteed that a heuristic search algorithm will find the optimal
solution?
● Constraint satisfaction problems
● Decision tree problems
● Traveling salesman problems
● None of the above
How is the principle of maximum entropy related to the maximum likelihood principle in statistics?
● They are equivalent
● The maximum likelihood principle is a special case of the principle of maximum entropy
● The principle of maximum entropy is a special case of the maximum likelihood principle
● They are independent of each other
In what year did Kurt Godel first present his incompleteness theorems?
● 1952
● 1879
● 1931
● 1975
Which of the following is NOT a factor that is typically considered when evaluating the likelihood of a
risk?
● Severity of the risk
● Likelihood of detection
● Duration of the risk
● Probability of occurrence