CS-502 RGPV B.Tech
Database Management Systems (DBMS)
Previous year papers and the official syllabus are free to read, no account needed.
Previous Year Papers
4 papers, latest Dec 2025
Syllabus, notes and important questions for CS-502
Syllabus units
Topics as the official RGPV syllabus lists them.
Unit 1 DBMS Concepts and Architecture 13 topics
- Introduction, Database approach vs Traditional file accessing approach
- Advantages of database systems
- Data models, Schemas and instances
- Data independence
- Database language and interfaces
- Overall database structure
- Functions of DBA and designer
- ER data model: entities and attributes, entity types
- Defining the E‑R diagram
- Concept of generalization, aggregation and specialization
- Transforming ER diagram into tables
- Object‑oriented data model, network data model, relational data model
- Comparison between the three types of models
Unit 2 Relational Data Models 8 topics
- Domains, tuples, attributes, relations and characteristics of relations
- Keys and key attributes of relation
- Relational database schemas and integrity constraints
- Referential integrity, intension and extension
- SQL – DDL and DML, integrity constraints, complex queries, various joins, indexing, triggers, assertions
- Relational algebra and relational calculus
- Relational algebra operations: select, project, join, division, outer union
- Tuple‑oriented and domain‑oriented relational calculus and its operations
Unit 3 Database Design and Query Optimization 5 topics
- Introduction to normalization, normal forms, functional dependency
- Decomposition, dependency preservation and lossless join
- Problems with null‑valued and dangling tuples, multivalued dependencies
- Query optimization: introduction, steps of optimization, algorithms for select, project and join
- Optimization methods – heuristic based and cost‑estimation based
Unit 4 Transaction Processing and Concurrency Control 7 topics
- Transaction system, testing of serializability, serializable schedules, conflict & view serializable schedules
- Recoverability and recovery from transaction failures, log‑based recovery, checkpoints, deadlock handling
- Concurrency control techniques: locking, time‑stamping protocols, validation‑based protocol, multiple granularity
- Multiversion concurrency control and recovery with concurrent transactions
- Introduction to distributed databases, data mining, data warehousing
- Object technology and DBMS, comparative study of OODBMS vs DBMS
- Temporal, deductive, multimedia, web & mobile databases
Unit 5 Relational DBMS (Oracle/PL‑SQL/MySQL) 11 topics
- Architecture, physical files, memory structures, background processes
- Table spaces, segments, extents and blocks; dedicated server and multi‑threaded server
- Distributed database, database links, snapshots
- Data dictionary, dynamic performance views
- Security, role management, privilege management, profiles, invoker‑defined security model
- SQL queries, data extraction from single/multiple tables, equi‑join, non‑equi‑join, self‑join, outer join
- Special operators: LIKE, ANY, ALL, EXISTS, IN; hierarchical queries, inline queries, flashback queries
- ANSI SQL, anonymous blocks, nested anonymous blocks, branching and looping constructs
- Cursor management – nested and parameterized cursors, Oracle exception handling
- Stored procedures, IN/OUT/IN OUT parameters, user‑defined functions and their limitations
- Triggers, mutating table errors, instead‑of triggers
Unit 6 == END OF UNITS==
The syllabus lists no separate topics for this unit.
Exam insights
Counted from 4 past CS-502 papers.
Marks asked per paper, by unit
-
Unit 1 DBMS Concepts and architecture Introduction 24 marks
-
Unit 2 Relational Data models 19 marks
-
Unit 3 Data Base Design 26 marks
-
Unit 4 Transaction Processing Concepts 28 marks
-
Unit 5 Study of Relational Database Management Systems through Oracle/PL SQL QL/MySQL 14 marks
Average marks of the questions from each unit in one paper. You answer only some of them, so the total is more than the paper’s maximum.
Asked again and again
-
Find all candidate keys and determine the highest normal form of a relation $R$ from its functional dependencies.
Asked 3 times: 2023, 2022, 2020
-
Draw the precedence graph for a given concurrent schedule and determine whether it is conflict serializable.
Asked 2 times: 2025, 2022
-
Explain the detailed system architecture / structure of a DBMS, including its major layers and components
Asked 2 times: 2024, 2023