AIR Unit 1 Quiz
AI Fundamentals Quiz
Welcome to the AI Fundamentals Quiz! This quiz is designed to test your knowledge of core concepts in Artificial Intelligence, including search algorithms, heuristic fun
Whether you're a student, a professional in the field, or simply curious about AI, this quiz is for you. It consists of 10 multiple-choice questions that will challenge your understanding of AI principles.
- Test your grasp of AI concepts
- Understand different search algorithms
- Learn about heuristics and their importance
What is true about Artificial Intelligence?
The ability to solve problems”.
The ability to act rationally.
The ability to act like humans
All of the above
Which of the following are Informed search algorithms?
Best First Search
A* Search
Iterative Deeping Search
Both a & b
If there is a solution, breadth first search is _______________to find it
Difficult
Guareented
Not able to find
None of the above
Which search strategy is combining the benefits of both BFS and DFS?
Depth Limited Search
A*
Iterative Deepening Depth first search
Best first search
Admissibility of the heuristic function is given as:
Depth
The quality of heuristic
Unknown nodes
None of the above
What is the termination criteria in Hill climbing
When no successor of the node has better heuristic value.
When successor of the node has better heuristic value.
When no ancestor of the node has better heuristic value.
When ancestor of the node has better heuristic value.
What is true about variable neighborhood function?
A. Neighbourhood functions that are sparse lead to quicker movement during search
B. Algorithm has to inspect very fewer neighbours
VDN stars searching with sparse Neighbourhood functions, when it reaches an optimum, it switches to denser function.
D. All of the above
_______________________requires Linear Space but uses backtracking
Breadth First Search
Recursive Best First Search (RBFS)
A*
IDA*
Which property asks that the algorithm is locally admissible?
Admissibility
Monotonicity
Informedness
None of the above
A* Search Algorithm _______________
A. Does not expand the node which have the lowest value of f(n),
B. Finds the shortest path through the search space using the heuristic function I.e f(n)=g(n) + h(n)
C. Terminates when the goal node is not found.
D. All of the above
{"name":"AIR Unit 1 Quiz", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Welcome to the AI Fundamentals Quiz! This quiz is designed to test your knowledge of core concepts in Artificial Intelligence, including search algorithms, heuristic functions, and more.Whether you're a student, a professional in the field, or simply curious about AI, this quiz is for you. It consists of 10 multiple-choice questions that will challenge your understanding of AI principles.Test your grasp of AI conceptsUnderstand different search algorithmsLearn about heuristics and their importance","img":"https:/images/course2.png"}