Which AI pioneer developed the Dartmouth proposal in 1955 alongside John McCarthy, Marvin Minsky, and Nathaniel Rochester?
Claude Shannon (father of information theory) co-authored the 1955 Dartmouth Summer Research Project proposal on Artificial Intelligence.
An environment where the agent's experience is divided into independent atomic episodes (perceiving and then acting) is called:
In episodic environments, each episode consists of the agent perceiving and acting; the choice of action in one episode does not affect future episodes.
Which data structure is fundamentally used to implement Breadth-First Search (BFS)?
Breadth-First Search uses a First-In-First-Out (FIFO) queue to expand nodes level-by-level in order of shallowest depth.
Depth-First Search (DFS) uses which underlying data structure for managing fringe nodes?
Depth-First Search uses a Last-In-First-Out (LIFO) stack (or recursion call stack) to explore as deep as possible along each branch before backtracking.
Which search algorithm expands the node with the lowest path cost g(n) first?
Uniform-Cost Search (UCS) expands unvisited nodes in order of their cumulative path cost g(n) from the start state.