BCS403 - Database Management Systems
Model-wise Important Questions (Sorted Module-wise)
Module 1: Introduction to DBMS
Important Questions:
1. Three-schema architecture – definition, diagram, and need for mapping. (Set-1 Q2a, Set-2 Q1a)
2. Types of end users with examples (Set-1 Q1a)
3. Advantages of DBMS (Set-1 Q1b, Set-2 Q1b)
4. Data Models and their categories (Set-2 Q2a)
5. Component modules of DBMS with diagram (Set-2 Q2b)
6. Responsibilities of DBA & Database Designers (Set-2 Q2c)
Short Questions:
• Characteristics of DBMS (Set-1 Q1c)
• Data Dictionary and Weak Entity (Set-2 Q1c)
Module 2: ER Model, Relational Model, SQL & Relational Algebra
Important Questions:
1. Relational constraints (entity & referential integrity) (Set-1 Q3a, Q3c; Set-2 Q3c)
2. Relational Algebra operations: JOIN, UNION, DIFFERENCE, SELECT (Set-2 Q4a, Set-1 Q4c)
3. E-R to Relational Mapping steps with example (Set-2 Q4b)
4. SQL Queries on Sailors-Boats-Reserves schema (Set-1 Q4a)
5. Generalization & Specialization (Set-1 Q3b)
Additional:
• Unary operations (Set-2 Q3b)
• Join types: Equijoin & Natural Join (Set-1 Q4b)
Module 3: SQL, Functional Dependencies, Normalization
Important Questions:
1. Normalization: 1NF, 2NF, 3NF with examples (Set-1 Q5b)
2. Functional Dependency (FD), Minimal Cover (Set-1 Q6a, Set-2 Q5c)
3. Inference Rules for FD with proof (Set-2 Q5c)
4. Update anomalies in SQL (Both sets – Q6b)
Additional:
• Informal guidelines for schema design (Both sets – Q5c/5b)
• SQL DDL/DML commands (Insert, Update, Alter, Drop) (Set-2 Q5a)
• Cursors in Embedded SQL (Set-1 Q5a)
Module 4: Transactions & Triggers
Important Questions:
1. Transaction states and diagram (Set-1 Q7a, Set-2 Q7a)
2. ACID properties (Both sets – Q8b)
3. System log and its working (Both sets – Q8a)
4. Assertions & Triggers with examples (Both sets – Q7b)
5. Stored Procedures with example (Both sets – Q8c)
Module 5: Concurrency Control & NoSQL
Important Questions:
1. Two-phase locking protocol (Both sets – Q9a)
2. Concurrency control using Timestamps (Set-1 Q9b)
3. Need for concurrency control with example (Both sets – Q9c)
4. CAP theorem in NoSQL (Both sets – Q10a)
5. MongoDB CRUD operations (Both sets – Q10b)
6. NoSQL Graph DB (Neo4j) (Both sets – Q10c)
Extra (Set-2):
• Define Schedule with example (Q9b)
Highly Repeated / Common Across Papers
• Three Schema Architecture
• Functional Dependency & Minimal Cover
• Referential Integrity
• ACID Properties
• Assertions, Triggers
• MongoDB & Neo4j (NoSQL)