Skip to content
ml-recall

#complexity

20 questions from Search & Planning, Multi-Agent Systems, Nearest Neighbors & Kernel Methods, Probabilistic & Graphical Models, Time Series, Attention & Transformers, Graph Neural Networks, NLP Fundamentals, Text Representation & Embeddings, Value-Based Methods

Timed test

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

Take a test
Q 1 / 20Score 0 / 0

Question 1: Short answer

mediumAI-checkedSearch & Planning

A search tree of depth dd has a varying branching factor: every node on level ii (root on level 0) has d−id - i children, so the root has dd children and the nodes on level dd have none. For d=4d = 4, how many nodes does the tree have in total?

a whole number