that more closely mirror the actual exam’s difficulty compared to official samples. Several detailed guides, such as the MBZUAI Screening Test Complete Guide
What is your specific major? ()
def mystery_func(arr): for i in range(len(arr)): for j in range(0, len(arr)-i-1): if arr[j] > arr[j+1]: arr[j], arr[j+1] = arr[j+1], arr[j] return arr print(mystery_func([64, 34, 25, 12])) Use code with caution. A) [12, 25, 34, 64] B) [64, 34, 25, 12] C) [25, 12, 34, 64] D) [12, 34, 25, 64]
What is the time complexity (Big-O) of searching for an element in a balanced Binary Search Tree (BST)? mbzuai entry exam sample questions best
Master the MBZUAI Entrance Exam: Best Sample Questions and Preparation Guide
Neural network with one hidden layer: Input ( x \in \mathbbR^d ), weight ( W_1 \in \mathbbR^h \times d ), bias ( b_1 ), ReLU activation, output weight ( w_2 \in \mathbbR^h ), sigmoid output. Derive the gradient of binary cross-entropy loss w.r.t ( W_1 ). Show dimensions at each step.
The math section evaluates your fluency in fields critical to machine learning. Focus on , Calculus , and Probability . that more closely mirror the actual exam’s difficulty
Given a 5x5 grayscale image and a 3x3 kernel. If you use a stride of 2 and no padding, what is the dimension of the output feature map? a) 3x3 b) 2x2 c) 5x5 d) 4x4
What will the following Python code snippet output?
A data point ( X ) is generated as follows: First, flip a fair coin. If heads, ( X \sim \textUniform(0, 1) ). If tails, ( X \sim \textUniform(1, 3) ). What is ( E[X] )? A) [12, 25, 34, 64] B) [64, 34,
Calculating Big-O time complexity for sorting algorithms like bubble sort. Data Structures:
Calculus, Linear Algebra (matrices, determinants, rank), Probability, and Optimization. Programming:
Multiple-choice questions (MCQs) and objective analytical problems. Duration: Typically 60 to 90 minutes. Core Pillars:
These questions test your ability to solve complex problems logically.
Many applicants waste time on irrelevant topics. MBZUAI include: