ISRO 2023 Quiz 34

Relation R is decomposed using a set of functional dependencies F, and relation S is decomposed using another set of functional dependencies G. One decomposition is definitely BCNF, the other is definitely 3NF, but it is not known which is which. To make a guaranteed identification, which on one of the following tests should be used on the decompositions? (Assume that the closures of F and G are available.)

Which of the following statement is/are true?

A cycle in wait-for graph corresponding to a resource allocation graph indicates:

Let G be a graph with 11 edges and minimum degree is 3 then find the maximum number of vertices in G

What will come in the place of blank in the following series?

6, 10, 18, 34, ?, 130