Six Papers Analyzed
The source set used for this PYQ intelligence page.
- SQL joins & aggregates
- 2NF + lossless join
- Recovery & query processing
- FD closure & candidate keys
- BCNF decomposition
- Serializability & checkpoint
- 1NF/2NF/4NF + BCNF
- Closure problems
- Timestamp & deadlock
- ER + relational algebra
- FD + lossless join
- Hashing
- Normalization to 3NF
- 2PL + serializability
- Query optimization
- 3NF/BCNF + lossless join
- Timestamp + 2PL
- Indexing & views
Quick PYQ Signals
ER-related concepts
Appeared in every analyzed paper.
FD / Normalization
Repeated through definitions and problems.
Concurrency block
Schedules, serializability, locks, timestamp, deadlock.
SQL / Querying
SQL or relational-query concepts recur strongly.
Recurring Topic Frequency
Frequency is based on the six papers analyzed; related subtopics are grouped into broader concept blocks.
| Concept Block | Approx. Papers | Priority | What RGPV Asked |
|---|---|---|---|
| Functional Dependency / Normalization | 6 / 6 | S++ | FD, closure, keys, 2NF, 3NF, BCNF, lossless decomposition |
| ER Model | 6 / 6 | S++ | Entities, attributes, relationships, strong/weak entities, ER diagrams |
| Concurrency / Transactions | 5+ / 6 | S+ | Schedules, serializability, 2PL, timestamp, deadlock, recoverability |
| SQL / Relational Querying | 5+ / 6 | S+ | DDL, SELECT, joins, aggregates, UNION/INTERSECTION, views, triggers |
| Indexing / Hashing | 5 / 6 | A+ | Primary/secondary/clustering, multilevel, static/extendible hashing |
| Query Processing / Optimization | 4 / 6 | A | Processing phases, optimization, cost and performance |
| Recovery | 4 / 6 | A | Log, checkpoint, shadow paging, recoverability |
Top 25 High-Yield Topics
Best order for focused exam preparation.
Five Master Study Blocks
Use these blocks instead of memorizing individual PYQs.
ER + Relational Fundamentals
DBMS architecture, data abstraction, file system vs DBMS, ER model, entities, attributes, keys and integrity constraints.
Relational Algebra + SQL
Selection, projection, joins, union, intersection, difference, SQL DDL/DML, queries, views and triggers.
Normalization
FD, closure, candidate keys, 1NF, 2NF, 3NF, BCNF, 4NF, lossless decomposition and dependency preservation.
Transactions + Concurrency
ACID, states, schedules, serializability, precedence graph, locking, 2PL, timestamp, deadlock and recoverability.
Storage + Indexing
File organization, secondary storage, primary/secondary/clustering index, multilevel index, hashing, B/B+ tree.
Query Processing + Recovery
Query phases, optimization, cost, log, checkpoint, shadow paging, deferred/immediate update and recovery.
Problem-Solving Questions You Must Practice
These are the recurring practical patterns visible in the papers.
Normalization Problems
- Find attribute closure.
- Find all candidate keys.
- Identify the highest normal form.
- Convert a relation to 2NF.
- Convert a relation to 3NF.
- Decompose a relation into BCNF.
- Check lossless join.
- Check dependency preservation.
Concurrency Problems
- Classify serial and non-serial schedules.
- Find conflicting operations.
- Construct a precedence graph.
- Test conflict serializability.
- Find equivalent serial order.
- Apply 2PL concepts.
- Analyze deadlock situations.
- Understand timestamp ordering.
Relational Algebra / SQL
- Selection and projection.
- Joins and outer joins.
- UNION and INTERSECTION.
- Aggregate queries.
- GROUP BY and HAVING.
- Subqueries and conditions.
- Views and triggers.
Indexing / Hashing
- Primary vs secondary index.
- Single vs multilevel index.
- Clustering index.
- Dense vs sparse index.
- Static hashing.
- Extendible hashing.
- B-Tree and B+ Tree basics.
How RGPV Changes the Question
The same concept is often tested using different command words.
Best Exam Strategy
1. First Priority
Functional Dependency → Closure → Candidate Key → 2NF → 3NF → BCNF → Lossless Join.
2. Second Priority
Transactions → Schedules → Serializability → Precedence Graph → 2PL → Timestamp → Deadlock.
3. Scoring Areas
ER diagrams, relational algebra, SQL queries, indexing and hashing should be practiced with examples.
Last-Night Top 15
If time is extremely limited.
- Functional Dependency + Attribute Closure
- Candidate Key
- 2NF
- 3NF
- BCNF
- Lossless Join + Dependency Preservation
- ER Diagram + Strong/Weak Entity
- Relational Algebra
- Conflict Serializability + Precedence Graph
- 2PL
- Timestamp Ordering
- Deadlock
- Primary/Secondary/Multilevel Index
- Static/Extendible Hashing
- SQL Queries + UNION/INTERSECTION + Views/Triggers