A recursive function to compute the nth Fibonacci number is defined as: ( F(0) = 0, F(1) = 1, F(n) = F(n-1) + F(n-2) ). How many total calls (including the initial call) are made to compute ( F(4) )?
You have three matrices: ( A ) (shape 3x4), ( B ) (shape 4x5), and ( C ) (shape 5x2). You want to compute ( (A \times B) \times C ). What is the shape of the resulting matrix? mbzuai entry exam sample questions
The online entry exam is a critical 45-minute proctored assessment designed to evaluate your foundational knowledge in mathematics, programming, and core AI concepts. Since the exam is fully automated and high-stakes, understanding the types of questions and topics covered is the most effective way to prepare. MBZUAI Entry Exam Overview Format: 15–20 multiple-choice questions (MCQs). Duration: 45 minutes. A recursive function to compute the nth Fibonacci