RTMNU · Third Year B.Tech Computer Engineering · NEP 2020
Database Management System
BCME5T15 · Semester V · 3 credits · College 30 + university 70
Unit 1: Introduction and the E/R Model
8 hoursThe purpose of database systems, views of data, data models and the three-schema architecture, and the components of a DBMS; conceptual modelling with the E/R model — entities, entity types, attributes, relationships, relationship types and E/R diagram notation.
Examined in the 70-mark end-semester paper
Unit 2: Relational Model and SQL
8 hoursThe relational data model — relations, the schema–instance distinction, keys, referential integrity and foreign keys — and the relational algebra operators; SQL data definition, tables, keys and foreign keys and update behaviour; querying in SQL with aggregation, GROUP BY and HAVING; embedded SQL.
Examined in the 70-mark end-semester paper
- The relational model and Codd's rules
- Keys in the relational model
- Integrity constraints
- Relational algebra
- SQL: DDL and DML
- SQL functions and aggregate queries
- Embedded SQL, JDBC and ODBC
Unit 3: Database Design
8 hoursDependencies and normal forms: functional dependencies, Armstrong's axioms, the closure of a set of FDs and minimal covers; 1NF, 2NF, 3NF and BCNF, decompositions and their desirable properties, and the 3NF and BCNF normalisation algorithms; 4NF and 5NF.
Examined in the 70-mark end-semester paper
- Functional dependencies
- Normalisation: 1NF, 2NF, 3NF and BCNF
- Lossless join and dependency preservation
- Fourth normal form and multivalued dependencies
- Join dependencies and fifth normal form
Unit 4: Transactions
6 hoursTransaction processing and error recovery: transaction concepts and ACID properties, concurrency control and locking-based protocols, and error recovery and logging with undo, redo and undo–redo logging.
Examined in the 70-mark end-semester paper
Unit 5: Implementation Techniques
6 hoursData storage and indexes: file organisations, primary and secondary index structures, hash-based indexes and dynamic hashing, multi-level indexes and B+ trees.
Examined in the 70-mark end-semester paper
- Indexing: ordered, B+-tree and hash indices
- B-trees and B+ trees
- Rehashing and extendible hashing
Unit contents are summarised from the official RTMNU syllabus . AiCanCode.org is not affiliated with Rashtrasant Tukadoji Maharaj Nagpur University (RTMNU).