GATE · Databases · United Kingdom

Databases for the GATE Exam — UK candidates

10% of the GATE test plan. Relational algebra, SQL, ER modelling, normalisation, transaction management, and indexing — approximately 10% of GATE CS. Calibrated for British candidates.

High-stakes exams reward two skills equally: knowledge and test-craft. This page focuses on both for one of the most failure-prone areas. Databases sits at roughly 10% of the Graduate Aptitude Test in Engineering content distribution — Databases is one of the most straightforward topics to score in GATE CS if candidates master SQL and normalisation. ER-to-relational mapping and functional-dependency analysis appear in virtually every paper. Transaction isolation levels and serializability testing are the more conceptually difficult sub-topics. Pass rates for the GATE are published annually by the awarding body and vary by cohort and locale. For UK candidates preparing for GATE, the calibration of study to local context matters: UK candidates often take exams for both domestic licensure (NMC, GMC) and migration purposes. IELTS UKVI is a separate, higher-stakes track.

Pass rates for GATE (United Kingdom) are published periodically by the awarding body.

Common failure modes

These are the patterns that cause most candidates to lose marks on this topic. Recognising them in advance is half the work.

!Confusing natural join (merges on common attribute name) with equi-join (explicit equality condition)
!Normalisation errors: misidentifying partial dependencies for 2NF or transitive dependencies for 3NF
!Forgetting that BCNF requires every determinant to be a superkey, not just a candidate key
!Misapplying conflict serialisability test — forgetting to check for cycles in the precedence graph
!SQL NULL logic errors: NULL compared with any value (including NULL) yields UNKNOWN, not TRUE or FALSE

Study tips

1Drill relational algebra: σ (selection), π (projection), ⋈ (natural join), ÷ (division). GATE gives relational algebra expressions and asks for the result — don't confuse the operators.
2Practice finding all functional dependencies' closures for a given relation and identifying all candidate keys.
3For normalisation, always verify: 1NF (atomic values), 2NF (no partial dependencies), 3NF (no transitive dependencies), BCNF (every determinant is a superkey).
4Memorise the ACID properties and their implementation: Atomicity (undo log), Consistency (constraints), Isolation (locking/MVCC), Durability (redo log).
5Practice SQL: GROUP BY + HAVING, nested subqueries with EXISTS/IN, and outer joins are the most frequently tested SQL constructs.
6In the UK, GATE schedules and reschedules align with state holiday calendars and post-Brexit fee adjustments — confirm pricing on the awarding body's site before booking.

Sample GATE Databases questions

These sample items mirror the format and difficulty of real GATE questions. Practice with thousands more on the free Koydo question bank.

1
Relation R(A, B, C) with FDs: A→B, B→C. The highest normal form R is in is:
- A1NF
- B2NFCorrect
- C3NF
- DBCNF
Why this answer?
(GATE CS style) The candidate key is A (since A→B and B→C give A→ABC). C is transitively dependent on A via B (A→B→C). This violates 3NF. R is in 2NF (no partial dependencies since key is single-attribute) but not 3NF.
2
In SQL, the result of: SELECT * FROM T WHERE col = NULL is:
- AAll rows where col is NULL
- BNo rows (empty result)Correct
- CAn error
- DAll rows in T
Why this answer?
(GATE CS style) In SQL, any comparison with NULL evaluates to UNKNOWN, not TRUE. The WHERE clause retains only rows where the condition is TRUE. Therefore no rows satisfy col = NULL. The correct syntax is col IS NULL.
3
A schedule is conflict-serializable if and only if its precedence (serialization) graph is:
- AA tree
- BAcyclic (has no cycles)Correct
- CA complete graph
- DBipartite
Why this answer?
(GATE CS style) A schedule is conflict-serializable iff its precedence graph (directed graph with an edge from Tᵢ to Tⱼ for each conflicting operation pair) contains no directed cycle. A topological sort of the acyclic graph gives the equivalent serial order.

Frequently asked questions

Is SQL tested in GATE or only relational algebra?

Both are tested. GATE typically includes 1–2 SQL questions (query output prediction or query writing) and 1–2 relational-algebra or normalisation questions per paper.

What is the difference between 3NF and BCNF, and does GATE test it?

In 3NF every non-prime attribute must be non-transitively dependent on every candidate key. BCNF is stricter: every functional dependency X→Y must have X as a superkey. GATE tests both definitions and asks which normal form a given relation satisfies — this distinction appears almost every year.

What is the GATE pass rate for British candidates?

Pass rates for GATE candidates in United Kingdom are published periodically by the awarding body. Practice questions, full-length simulations, and weak-area drills are the highest-impact way to improve your odds.

How long should British candidates study Databases for the GATE?

For most candidates, focused mastery of Databases requires 20–40 hours of deliberate practice — drilling sample questions, reviewing failure modes, and timing yourself against exam conditions. UK candidates often take exams for both domestic licensure (NMC, GMC) and migration purposes. IELTS UKVI is a separate, higher-stakes track. Combine Databases study with full-length mock exams in the final two weeks before your test date.

Practice GATE branch-specific questions free with Koydo.

CS, EE, ME, CE, ECE — full GATE syllabus with PYQs.

Start free GATE practice →Practice this topic with AI

Related study guides

Regulatory citation: GATE 2024 CS Syllabus — Databases (ER Model, Relational Model, SQL, Relational Algebra, Functional Dependencies, Normalisation, Transactions, Indexing).