Data base Management System (CY-405) - Important Questions

Define DBMS and compare DBMS vs traditional file-based storage system, including drawbacks of file systems / benefits of DBMS.

Explain what the entity-relationship model is, including Entity, Entity Type and Entity Set, illustrated with a simple example.

Explain the architecture of a DBMS with diagram and describe its main components.

Differentiate DBMS vs traditional file systems and explain how DBMS provides data independence with examples.

Explain different types of data models in DBMS?

Draw and explain an ER diagram for a Hospital Management System with Patients, Doctors and Appointments, including relationships and constraints.

State and explain the various features / components of the E-R model.

Explain the various levels of data abstraction in a DBMS.

What is Null Attribute? With suitable diagram explain Weak and Strong Entity Set.

Explain different types of relationships amongst tables in a DBMS. Explain different types of attributes in a DBMS.

Discuss about File Organization and Access methods.

Define data, database, and database management system. Discuss the advantages of DBMS?

Explain the different types of integrity constraints and rules to ensure data integrity and consistency in a DBMS.

Explain the different types of relational keys and the role of primary and candidate keys in ensuring data integrity and uniqueness

Use UNION and INTERSECTION operations in SQL to combine data from two tables.

Determine the impact of views on database performance and justify their usage in specific scenarios.

What are the SQL statements for destroying and altering tables? Explain with examples.

Write SQL SELECT queries on a student database to filter by marks and enrollment in courses.

Define triggers in SQL. Write a trigger that updates the total order amount in an "Orders" table whenever a new order is added in an "OrderItems" table.

Write relational algebra queries for the Sailors-Boats-Reserves database.

Define degree and cardinality of a relation and determine them for a given table.

Explain how to write queries in relational algebra with examples.

Explain tuples and attributes with examples.

Describe the different types of keys and explain the different operations in relational algebra

Explain the concept of lossless join decomposition and its importance in database normalization.

Define and explain functional dependencies with examples and their importance in database normalization.

Normalize a given relation to 2NF and 3NF

Explain what normalization means and describe the different normal forms with suitable examples

Find candidate key(s) of a relation scheme given a set of functional dependencies.

Examine a relational schema with functional dependencies and identify violations of 3NF or BCNF

Design a normalized schema ensuring BCNF and lossless join decomposition

Explain relation schemas in detail with suitable examples.

Explain the steps to convert a relation from 3NF to BCNF

Find candidate keys of a relation, identify its highest normal form, and decompose it to BCNF

Find the attribute closure of given attribute sets under a set of functional dependencies.

Explain the difference between a relation and a relation schema and discuss their relationship.

Explain the two-phase locking (2PL) protocol and its role in ensuring serializability and concurrency control

Explain timestamp-based concurrency control mechanism for multi-user database systems.

Propose a methodology for testing serializability in large transaction schedules.

Define deadlock in databases and describe techniques for deadlock prevention, detection and resolution.

Define a transaction and explain its properties and states.

Differentiate serial vs non-serial schedules and test whether a given schedule is serializable.

What is a schedule? Explain serial and non-serial schedules.

Explain how the lock manager implements lock and unlock requests

Explain ACID characteristics in relational databases and define the structure of a relational database schema.

State and explain shadow paging with suitable example.

Explain serializability including conflict and view serializability with examples.

Explain deadlocks and explain deadlock avoidance and deadlock prevention.

Describe the phases of query processing in a DBMS and explain how query optimization relates to / contributes to efficiency.

Write short notes on any two of: Secondary Storage Devices, Shadow paging, Schemas and Instances, Views and Stored procedures.

Propose a case study of a contemporary DBMS, analyzing its storage structures, indexing methods, and query optimization techniques.

Distinguish between primary and secondary indices and evaluate their impact on query performance.

Write short notes on query processing, data independence, union/intersection, dependency preservation (any two).

Explain the purpose of indexing and how a primary index differs from a clustering index.

Explain extendable hashing for indexing records with hash directory illustration.

Explain how a hash function enables quick data retrieval for student records.

Explain static hashing and its advantages in DBMS.

Write short notes on any two:

Write an algorithm to implement project and join operations of relational algebra.

Compare single-level and multi-level indices.

Write short notes on (any two):