Related Database Management PYQs
A relation R(A, B, C) has functional dependencies F = {A -> B, B -> C}. If R is decomposed into R1(A, B) and R2(B, C), this decomp…
Consider a schema R(A, B, C, D) with functional dependencies F = {AB -> C, C -> D, D -> A}. What are all the candidate keys of R?
Consider the relation scheme R=(E,F,G,H,I,J,K,L,M,N) and the set of functional dependencies {{E,F}→{G}, {F}→{I,J}, {E,H}→{K,L}, {K…
Given the following statements: S1: A foreign key declaration can always be replaced by an equivalent check assertion in SQL. S2: …
Consider the following four schedules due to three transactions (indicated by the subscript) using read and write on a data item x…
Given the following two statements: S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF. S2: AB→C, D→E,…
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.