What is the time complexity of building a heap from an unsorted array of size \(n\)?

• (A) \(O(n \log n)\)
• (B) \(O(n)\)
• (C) \(O(\log n)\)
• (D) \(O(n^2)\)

In Operating Systems, which condition ensures that a process cannot be preempted from its resource until it completes its task?

• (A) Mutual Exclusion
• (B) Hold and Wait
• (C) No Preemption
• (D) Circular Wait

If a relation is both symmetric and antisymmetric, what must be true about the elements in that relation?

• (A) All elements must be comparable
• (B) The relation must be transitive
• (C) Only pairs of the form \( (a,a) \) can exist
• (D) The relation must contain all ordered pairs

Which activation function is zero-centered and ranges between \(-1\) and \(1\)?

• (A) Sigmoid
• (B) ReLU
• (C) Tanh
• (D) Softmax

What is the determinant of an identity matrix of any order \(n\)?

• (A) \(0\)
• (B) \(1\)
• (C) \(n\)
• (D) \(-1\)

In Linear Regression, what is the primary goal of the Ordinary Least Squares (OLS) method?

• (A) Maximize the variance of predictions
• (B) Minimize the sum of squared residuals
• (C) Maximize the correlation between variables
• (D) Minimize the number of features

Which data structure is used by the system to implement recursion?

• (A) Queue
• (B) Stack
• (C) Linked List
• (D) Heap

A high variance in a machine learning model is a primary indicator of which problem?

• (A) Underfitting
• (B) Overfitting
• (C) High bias
• (D) Data normalization

In a Binary Search Tree, which traversal method produces the elements in non-decreasing order?

• (A) Preorder Traversal
• (B) Inorder Traversal
• (C) Postorder Traversal
• (D) Level Order Traversal

What is the probability of getting a sum of \(9\) when two fair dice are rolled simultaneously?

• (A) \( \frac{1}{12} \)
• (B) \( \frac{1}{9} \)
• (C) \( \frac{1}{8} \)
• (D) \( \frac{1}{6} \)

Which layer of the OSI model is responsible for IP addressing and routing?

• (A) Data Link Layer
• (B) Network Layer
• (C) Transport Layer
• (D) Session Layer

How many edges are there in a complete graph with \(n\) vertices?

• (A) \(n(n-1)\)
• (B) \( \frac{n(n-1)}{2} \)
• (C) \(n^2\)
• (D) \( \frac{n(n+1)}{2} \)

In SQL, which clause is used to filter the results of an aggregate function?

• (A) WHERE
• (B) GROUP BY
• (C) HAVING
• (D) ORDER BY

What is the value of \((AB)^T\) in matrix algebra?

• (A) \(A^T B^T\)
• (B) \(B^T A^T\)
• (C) \(AB\)
• (D) \(A^T B\)

Which ensemble technique reduces variance by training multiple trees on different subsets of data?

• (A) Boosting
• (B) Bagging
• (C) Stacking
• (D) Gradient Descent