Which of the following algo is NOT an example of uninformed search?

The correct option is A*.

In computer science, search algorithms are generally classified into two main categories: uninformed (blind) search and informed (heuristic) search.

1. Uninformed Search:
These algorithms have no additional information about the states beyond the problem definition. They can only generate successors and distinguish a goal state from a non-goal state. They do not know how close a non-goal state is to the goal. Examples include:
- BFS (Breadth-First Search): Explores all nodes at the present depth level before moving to nodes at the next depth level.
- DFS (Depth-First Search): Explores as far as possible along each branch before backtracking.
- Depth Limited Search: A variation of DFS that runs with a predetermined depth limit to avoid infinite paths.

2. Informed Search:
These algorithms use domain-specific hints or "heuristics" to estimate how close a state is to the goal, allowing them to search more efficiently.
- A* Search: It uses a heuristic function, typically denoted as $h\left(n\right)$, representing the estimated cost from the current node $n$ to the goal, combined with the actual cost to reach that node, $g\left(n\right)$. Because it uses heuristic information to guide its search, it is an informed search algorithm rather than an uninformed one.

Therefore, A* is NOT an example of uninformed search.