What are common examiner traps in ER Model?

Assuming the owner entity set must also have total participation in an identifying relationship (only the weak entity set MUST have total participation). Confusing ER model expressive capability (which permits multivalued and composite attributes) with the relational model (where 1NF enforces single atomic values per cell). Forgetting to merge 1:n relationship sets into the entity on the 'many' (n) side when computing minimal table counts. Treating relationship sets in text as entity sets in diagram selection questions (e.g., swapping rectangle and diamond notation). Confusing the direction of Many-to-One: assuming Many-to-One from A to B means A has multiple B entities, rather than multiple A entities mapping to one B entity. Overlooking NULL constraint implications during table merging: merging on partial participation creates NULL foreign keys. Confusing double rectangles (weak entity) with double diamonds (identifying relationship) or double ovals (multivalued attribute).

GATE CSE ER Model PYQs

Standard yield5.1% of Databases

GATE tests the ER-model and conceptual design across foundational definitions, standard notation mapping, ER-to-relational schema conversion, and weak entity co… Read the guide

Take topic test

Questions: 8
Asked: since 2012
Total marks: 9
Marks / paper: 0.3

8 GATE CSE ER Model PYQs with solutions, from Databases. Browse all GATE CSE PYQs.

Questions

Every official paper that asked this topic, newest first.

GATE CSE 2026 Set 2 · Q15In the context of DBMS, consider the two sets $\textbf{T}$ and $\textbf{S}$ given below. Which one of the following is the correct match from $\textbf{T}$ to $\textbf{S}$ ?MCQ1 markEasyDiagramSolve
GATE CSE 2024 Set 1 · Q20Let S be the specification: "Instructors teach courses. Students register for courses. Courses are allocated classrooms. Instructors guide students." Which one of the following ER diagrams CORRECTLY represents S?MCQ1 markEasyDiagramSolve
GATE CSE 2024 Set 2 · Q20In the context of owner and weak entity sets in the ER (Entity-Relationship) data model, which one of the following statements is TRUE?MCQ1 markEasySolve
GATE CSE 2020 · Q14Which one of the following is used to represent the supporting many-one relationships of a weak entity set in an entity-relationship diagram?MCQ1 markEasySolve
GATE CSE 2018 · Q11In an Entity-Relationship (ER) model, suppose $R$ is a many-to-one relationship from entity set E1 to entity set E2. Assume that E1 and E2 participate totally in $R$ and that the cardinality of E1 is greater than the cardinality of E2. Which one of the following is true about $R$ ?MCQ1 markMediumSolve
GATE CSE 2017 Set 2 · Q17An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A?MCQ1 markMediumSolve
GATE CSE 2015 Set 1 · Q41Consider an Entity-Relationship (ER) model in which entity sets $E_1$ and $E_2$ are connected by an $m:n$ relationship $R_{12}$ . $E_1$ and $E_3$ are connected by a $1:n$ (1 on the side of $E_1$ and $n$ on the side of $E_3$ ) relationship $R_{13}$ . $E_1$ has two single-valued attributes $a_{11}$ …NAT2 marksEasySolve
GATE CSE 2012 · Q14Given the basic ER and relational models, which of the following is INCORRECT?MCQ1 markEasySolve

What GATE tests in ER Model

Concepts, patterns, formulas and traps distilled from past papers.

GATE tests the ER-model and conceptual design across foundational definitions, standard notation mapping, ER-to-relational schema conversion, and weak entity constraints. Questions range from conceptual 1-mark MCQs verifying properties of entities/relationships and DBMS schema architectures to 2-mark NATs calculating the minimum number of relational tables needed in 3NF. The focus is on precision regarding atomicity, participation constraints, and table reduction rules.

Core concepts

Atomic vs Multivalued vs Composite attributes
1NF atomicity difference between ER model and Relational model
Weak entity sets, owner/identifying entity sets, and partial keys (discriminators)
Total vs partial participation constraints in identifying relationships
Cardinality ratios (1:1, 1:n, m:n) and schema reduction to minimal 3NF tables
ER diagram visual symbols (rectangles for entities, diamonds for relationships)
Three-schema architecture (External/View, Conceptual/Logical, Internal/Physical)
Mapping Cardinalities (One-to-One, One-to-Many, Many-to-One, Many-to-Many)
Participation Constraints (Total vs. Partial Participation)
ER to Relational Schema Reduction (Table Merging Conditions)
Weak Entity Sets and Identifying Relationships
ER Diagram Graphical Notations (Double Borders, Underlines)

Recurring question patterns

ER-to-Relational Schema Conversion Table Count
OccasionalNAT2 marks2015
Given an ER diagram description with multiple entity sets, cardinality ratios ( $1:1$ , $1:n$ , $m:n$ ), and keys/attributes, calculate the minimum number of relations (tables) in 3NF needed to represent the design without anomalies.
ER Conceptual Constraints and Properties
CommonMCQ1 marks2024, 2012
True/false or INCORRECT identification questions targeting ER definitions such as multivalued vs composite attributes, owner vs weak entity sets, identifying relationships, and existence/participation dependencies.
Specification to ER Diagram Matching
OccasionalMCQ1 marks2024
Given a brief natural language enterprise specification, choose the diagram that correctly maps nouns/actions to entity rectangles, relationship diamonds, and proper connections without spurious entities.
DBMS Multi-Schema Architecture Matching
RareMCQ1 marks2026
Matching columns connecting external, logical/conceptual, and physical/internal schema levels with their respective database artifacts (views, relations, file structures/indexes).
ER-to-Relational Table Reduction and Merging
OccasionalMCQ1 marks2017
Questions evaluate the exact conditions (cardinality ratio and total/partial participation) under which a relationship relation can be merged with an participating entity relation without creating spurious null values or violating functional dependencies.
Cardinality and Participation Constraint Interpretation
OccasionalMCQ1 marks2018
Given an ER setup with explicit cardinality ratios, participation constraints, and relative entity set sizes (e.g., $|E_1| > |E_2|$ ), deduce the exact bounds on associations (e.g., 'at least one', 'at most one', or 'exactly one') between entities.
ER Diagrammatic Notational Standards
OccasionalMCQ1 marks2020
Direct identification of standard Chen-style ER diagram notations for structural constructs such as weak entity sets, identifying relationship sets, multivalued attributes, and partial keys.

Formulas GATE uses

ER to Relational Table Count ($m:n$ Relationship)

\text{Relations}(E_1, E_2, R_{12}) = 1(E_1) + 1(E_2) + 1(R_{12}) = 3

Used when an $m:n$ relationship exists between two independent entity sets; the relationship cannot be merged into either entity table.

ER to Relational Table Count ($1:n$ Relationship Merge)

\text{Relations}(E_1, E_3, R_{13}) = 1(E_1) + 1(E_3 \bowtie R_{13}) = 2

Used when a $1:n$ relationship connects $E_1$ (1-side) and $E_3$ ( $n$ -side); the relationship is merged into the relation on the $n$ -side by embedding the foreign key.

Exact Association under Total Participation & Functional Mapping

\text{Many-to-One }(E_1 \to E_2) + \text{Total Participation of } E_1 \implies \forall e_1 \in E_1, |\{e_2 \in E_2 \mid (e_1, e_2) \in R\}| = 1

Used to determine the exact number of associations an entity has when it is on the 'many' side with total participation.

Pigeonhole Principle in Many-to-One Relationships

|E_1| > |E_2| \land \text{Total}(E_1) \land (E_1 \xrightarrow{\text{many-to-one}} E_2) \implies \exists e_2 \in E_2 : |\{e_1 \in E_1 \mid (e_1, e_2) \in R\}| > 1

Used when reasoning about the minimum number of associations on the 'one' side when entity set cardinalities differ.

Examiner traps in ER Model

Assuming the owner entity set must also have total participation in an identifying relationship (only the weak entity set MUST have total participation).
Confusing ER model expressive capability (which permits multivalued and composite attributes) with the relational model (where 1NF enforces single atomic values per cell).
Forgetting to merge 1:n relationship sets into the entity on the 'many' (n) side when computing minimal table counts.
Treating relationship sets in text as entity sets in diagram selection questions (e.g., swapping rectangle and diamond notation).
Confusing the direction of Many-to-One: assuming Many-to-One from A to B means A has multiple B entities, rather than multiple A entities mapping to one B entity.
Overlooking NULL constraint implications during table merging: merging on partial participation creates NULL foreign keys.
Confusing double rectangles (weak entity) with double diamonds (identifying relationship) or double ovals (multivalued attribute).

How questions are asked

Evaluate correct/incorrect statements on ER and Relational model constraints
Calculate minimal number of relational tables in 3NF from ER specification
Identify the correct ER diagram representing a textual scenario
Match-the-following between DBMS schema levels and their components
Conceptual condition matching for relational schema reduction
Formal constraint interpretation with entity set size inequalities
Direct ER diagram notation identification

Paper trends

Shift from purely verbal definitions (2012) and conversion counting (2015) to visual ER diagram comprehension, weak entity participation rigor (2024), and foundational architectural mappings (2026).
2026, 2024, 2015, 2012
ER questions predominantly remain 1-mark easy conceptual checks in MCQ format, with 2-mark NAT questions reserved for relational schema reduction problems.
2024, 2015
Questions consistently carry 1 mark as MCQs without complex numerical calculation, shifting between formal semantic constraint deduction and graphical notation identification.
2020, 2018, 2017

Difficulty notes

Easy: Direct theoretical definitions (participation of weak entities, attribute types, 3-schema level matching, or picking the right diagram layout). Medium: Converting ER diagrams with mixed cardinalities ( $1:1$ , $1:n$ , $m:n$ ), total/partial participation, or weak entities into minimal tables without redundant keys or NULL violations. Hard: Complex ER schemas containing ternary relationships, self-referential relationships, and inheritance hierarchies requiring precise minimal candidate key and table derivation.