Skip to content
ml-recall

#memory

16 questions from Search & Planning, Optimization & Calculus, Data & Features, Neural Network Basics, Training Deep Networks, Deep Learning Frameworks, Attention & Transformers, Computer Vision Basics, Fine-tuning & PEFT

Timed test

16 questions · 16 min · score and explanations at the end

Take a test
Q 1 / 16Score 0 / 0

Question 1: Single choice

mediumAI-checkedSearch & Planning

A path-search problem has a very large branching factor, all actions cost the same, and every solution is a fairly short (but unknown) number of steps. You want a path with the fewest steps and memory is the bottleneck. Which search fits best?

Choose one option