List of top Data Science and Artificial Intelligence Questions on Database Concepts asked in GATE AR

Consider the dataset with six datapoints : {(x₁, y₁), (x₂, y₂), ..., (x₆, y₆)}, where x₁ = \(\begin{bmatrix} 1 \\ 0 \end{bmatrix}\), x₂ = \(\begin{bmatrix} 0 \\ 1 \end{bmatrix}\), x₃ = \(\begin{bmatrix} 0 \\ -1 \end{bmatrix}\), x₄ = \(\begin{bmatrix} -1 \\ 0 \end{bmatrix}\), x₅ = \(\begin{bmatrix} 2\\ 2 \end{bmatrix}\), x6 = \(\begin{bmatrix} -2 \\ -2 \end{bmatrix}\) and the labels are given by y₁ = y₂ = y₅ = 1, and y₃ = y₄ = y₆ = -1 .A hard  margin linear support vector machine is trained on the above dataset. Which ONE of the following sets is a possible set of support vectors?

Given the relational schema R = (U, V, W, X, Y, Z) and the set of functional dependencies :
{U → V,U → W, WX → Y,WX → Z,V → X}
Which of the following functional dependencies can be derived from the above set ?

Consider the table below, where the (i,j)^th element of the table is the distance between points x_i and x_j. Single linkage clustering is performed on data points, x₁, x₂, x₃, x₄, x₅.

	x1	x2	x3	x4	x5
x1	0	1	4	3	6
x2	1	0	3	5	3
x3	4	3	0	2	5
x4	3	5	2	0	1
x5	6	3	5	1	0

Which ONE of the following is the correct representation of the clusters produced ?

Consider performing depth-first search (DFS) on an undirected and unweighted graph G starting at vertex s. For any vertex u in G, d[u] is the length of the shortest path from s to u. Let (u, v) be an edge in G such that d[u] < d[v]. If the edge (u, v) is explored first in the direction from u to v during the above DFS, then (u, v) becomes a _____ edge.

Match the items in Column 1 with the items in Column 2 in the following table :

Column 1		Column 2
(p)	Principal Component Analysis	(i)	Discriminative Model
(q)	Naïve Bayes Classification	(ii)	Dimensionality Reduction
(r)	Logistic Regression	(iii)	Generative Model