SUK · Third Year B.Tech. Computer Science and Engineering (Data Science) · NEP 2020
Database Engineering
DS3102 · Semester V · 3 credits · ISE 10 + mid-semester 30 + ESE 60
Unit 1: Introduction to DBMS
7 hoursFile systems versus DBMS, views of data, instances and schemas; relational and ER models, keys, the database design process and schema diagrams; extended ER features; database system structure and users; relational algebra and tuple and domain relational calculus.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Purpose of a DBMS
- Three-schema architecture, schemas and instances
- ER model and ER diagrams
- Extended ER features
- Relational algebra
- Tuple and domain relational calculus
Unit 2: Structured Query Language
7 hoursSQL data types; DDL, DML and DCL statements; aggregate functions, GROUP BY, HAVING and ORDER BY, set operations, joins, nested queries and views; PL/SQL functions, procedures, triggers and cursors.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- DDL, DML, DCL and TCL
- Aggregate functions and set operations
- Joins and views
- Nested queries
- PL/SQL procedures and functions
- Triggers
Unit 3: Functional Dependency and Normalization
6 hoursDomain and referential integrity; pitfalls in relational design; functional dependencies, closures and canonical cover; normal forms from 1NF to 5NF.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Integrity constraints
- Functional dependencies
- Normalisation: 1NF to BCNF
- Fourth normal form and multivalued dependencies
Unit 4: Data Storage and Indexing
7 hoursFile organisation, organisation of records in files and buffer management; ordered indices (primary, secondary, dense, sparse, multilevel), B-tree and B+-tree indexing and multiple-key access; static and dynamic hashing and bitmap indices.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- File organisation and buffer management
- Indexing: ordered, B+-tree and hash indices
Unit 5: Transaction Processing and Concurrency Control
8 hoursTransactions and ACID properties, schedules, conflict and view serialisability, recoverable schedules; lock-based, multiple-granularity, timestamp-based (Thomas' write rule) and validation-based protocols.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Transactions and ACID properties
- Conflict and view serialisability
- Recoverable schedules
- Lock-based concurrency control
- Timestamp-based concurrency control
- Validation-based protocols and multiple granularity
Unit 6: Deadlock Handling and Data Recovery
7 hoursDeadlock prevention, detection and recovery; failure classification, storage and log-based recovery.
Examined in the 60-mark end-semester paper, and in the mid-semester exam if it is taught by then
- Deadlock handling in databases
- Log-based recovery and checkpoints
Unit contents are summarised from the official SUK syllabus . AiCanCode.org is not affiliated with Shivaji University, Kolhapur.