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.

Question

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 ?

Answer 1

The correct option is (A), which is "tree".

	x₁	x₂	x₃	x₄	x₅
x₁	0	1	4	3	6
x₂	1	0	3	5	3
x₃	4	3	0	2	5
x₄	3	5	2	0	1
x₅	6	3	5	1	0

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

The Correct Option is A

Solution and Explanation

Top Questions on Database Concepts

Questions Asked in GATE AR exam