Databases · Relational Algebra
Official IIT answer key · IIT Kharagpur · Audited Aug 2026
GATE CSE 2014 Set 3 Q21 · MCQ · 1 mark
Key concept
No account needed
Sit 4 related Relational AlgebraPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
Relational Algebra in GATE CS is tested through both procedural evaluation (calculating the size or contents of an output relation from given instance tables) and semantic/algebraic properties (query optimization equivalences and self-join query semantics). Questions test core operators such as selection ( ), projection ( ), set union ( ), renaming ( ), and theta/equi-joins ( ). Questions alternate between 1-mark mechanical/equivalence checks and 2-mark semantic interpretation or multi-step tuple evaluations.
Full Relational Algebra guide →What is the optimized version of the relation algebra expression A1( A2( F1( F2(r)))), where A1, A2 are sets of attributes in r with A1 A2 and F1, F2 are Boolean expressions based on the attributes in r?
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.
