Skip to content
GATETECH

GATE CS Databases questions

Practise Databases questions for GATE CS. Explore official PYQs and original subject-wise quizzes, check answers and view available solutions. Free, no sign-in.

Separate schema constraints from assumptions in the question. For SQL, trace joins and grouping; for normalisation, work from the stated functional dependencies.

Subject, topic, year and type filter the full library. Match any choice within a filter, and all selected filter categories. Search, source and sort apply to this page.

19 on this page
Official PYQ2000DatabasesFile Organization and Indexing (B and B+ Trees)MCQ · 1 mark
B+^{+}-trees are preferred to binary trees in databases because
Official PYQ1999DatabasesTuple Calculus and SQLMCQ · 1 mark
Which of the following is/are correct?
Official PYQ1999DatabasesNormal FormsMCQ · 1 mark
Consider the schema R=(S,T,U,V)R=(S,T, U, V) and the dependencies S→T,T→U,U→VS \rightarrow T, T \rightarrow U, U \rightarrow V and V→SV \rightarrow S. Let R=(R1 and R2)R = (R1\text{ and } R2) be a decomposition such that R1∩R2≠ϕR1 \cap R2 \neq \phi. The decomposition is
Official PYQ1999DatabasesTransactions and Concurrency ControlMCQ · 1 mark
For the schedule given below, which of the following is correct: …
Official PYQ1999DatabasesFile Organization and Indexing (B and B+ Trees)MCQ · 1 mark
Which of the following is correct?
Official PYQ1999DatabasesNormal FormsMCQ · 1 mark
Let R=(A,B,C,D,E,F)R = (A, B, C, D, E, F) be a relation scheme with the following dependencies C→F,E→A,EC→D,A→BC \rightarrow F, E \rightarrow A, EC \rightarrow D, A \rightarrow B. Which one of the following is a key for RR?
Official PYQ1999DatabasesTuple Calculus and SQLMCQ · 1 mark
The relational algebra expression equivalent to the following tuple calculus expression: {t∣t∈r∧(t[A]=10∧t[B]=20)}\left\{t \mid t \in r \land \left(t[A] = 10 \land t[B]=20\right)\right\} is
Official PYQ1999DatabasesRelational Model: Relational AlgebraMCQ · 1 mark
Consider the join of a relation RR with a relation SS. If RR has mm tuples and SS has nn tuples then the maximum and minimum sizes of the join respectively are
Official PYQ1998DatabasesTuple Calculus and SQLMCQ · 1 mark
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s expression) is incorrect? R1 and R2 are relations, C1 and C2 are selection conditions and A1 and A2 are attributes of R1.
Official PYQ1998DatabasesFile Organization and Indexing (B and B+ Trees)MCQ · 1 mark
There are five records in a database. …
Official PYQ1998DatabasesRelational Model: Relational AlgebraMCQ · 1 mark
Given two union compatible relations R1(A,B)R_1(A, B) and R2(C,D)R_2 (C, D), what is the result of the operation R1⋈A=C∧B=DR2R_1 \Join_{ A = C \wedge B = D} R_2?
Official PYQ1998DatabasesNormal FormsMCQ · 1 mark
Which normal form is considered adequate for normal relational database design?
Official PYQ1997DatabasesIntegrity ConstraintsMCQ · 1 mark
Let R(a,b,c)R (a, b, c) and S(d,e,f)S(d, e, f) be two relations in which dd is the foreign key of SS that refers to the primary key of RR. Consider the following four operations RR and SS Insert into RR Insert into SS Delete from RR Delete from SS Which of the following can cause violation of the referential integrity constraint above?
Official PYQ1997DatabasesNormal FormsMCQ · 1 mark
For a database relation R(a,b,c,d)R(a, b, c, d), where the domains a,b,c,da, b, c, d include only atomic values, only the following functional dependencies and those that can be inferred from them hold a→ca \rightarrow c b→db \rightarrow d This relation is
Official PYQ1994DatabasesNormal FormsNAT · 1 mark
State True or False with reason Logical data independence is easier to achieve than physical data independence.
Official PYQ1994DatabasesNormal FormsNAT · 1 mark
State True or False with reason There is always a decomposition into Boyce-Codd normal form (BCNF) that is lossless and dependency preserving.
Official PYQ1993DatabasesFile Organization and Indexing (B and B+ Trees)NAT · 1 mark
An ISAM\text{ISAM} (indexed sequential) file consists of records of size 6464 bytes each, including key field of size 1414 bytes. An address of a disk block takes 22 bytes. If the disk block size is 512512 bytes and there are 16K16K records, compute the size of the data and index areas in terms of number blocks. How many levels of tree\text{tree} do …
Official PYQ1990DatabasesNormal FormsMSQ · 1 mark
Indicate which of the following statements are true: A relational database which is in 33NF may still have undesirable data redundancy because there may exist:
Official PYQ1987DatabasesNormal FormsNAT · 1 mark
State whether the following statements are TRUE or FALSE: A relation rr with schema (X,Y)(X, Y) satisfies the function dependency X→YX \rightarrow Y, The tuples ⟨1,2⟩\langle 1, 2\rangle and ⟨2,2⟩\langle 2, 2 \rangle can both be in rr simultaneously.