AI & Technical question

Explain concept of 'recursion' to grandma?

Practice this question out loud. An AI interviewer asks it, follows up like a real interviewer would, and scores your answer. Type or speak.

What this question tests

Whether you can translate a technical concept into an intuitive, jargon-free explanation for a non-technical audience.

Pick a concrete, everyday analogy, such as Russian nesting dolls or looking in a mirror facing another mirror.
Explain the core idea in plain terms: something that solves a problem by using a smaller version of itself.
Walk through a simple example out loud, like finding the bottom of a stack of boxes by opening one box at a time until you hit an empty one.
Name the base case explicitly, the point where it stops, since that is what keeps it from going forever.
Avoid technical terms like stack, function call, or base case unless you immediately translate them.
Check understanding by asking grandma to restate the idea back in her own words.

Uses a genuinely intuitive analogy a non-technical person would picture immediately, like nested dolls.
States the base case, the stopping point, clearly, since that is the part people most often miss.
Keeps the explanation under a minute and free of jargon like recursion, stack, or function.
Shows the explanation adapts to a real audience, not a memorized technical definition read aloud.

Explaining it with code or technical terms like stack overflow instead of a plain analogy.
Forgetting to mention the base case, leaving the idea sounding like it never stops.

Chapters of the AI PM course that teach what this question tests.