PAHSU · Third Year B.Tech. Computer Science and Engineering · NEP 2020
Database Engineering
CSEPCC-09 · Semester V · 4 credits · ISE 30 + ESE 70
4 credits with its lab; the lab adds ICA 25 and an oral/practical exam (POE) of 25.
Unit 1: Introduction to Database Systems
7 hoursDatabase applications and purpose; views of data and database languages; data storage, querying, transaction management and database architecture; the ER model: notation, constraints and keys, weak entity sets and Codd's rules; extended ER: generalisation and aggregation; mapping cardinality and reducing ER diagrams to tables.
Examined in the 70-mark end-semester paper
Unit 2: Relational Data Model, Relational Algebra and Calculus
7 hoursStructure of relational databases and schemas; keys and relationships; fundamental, additional and extended relational algebra operations; tuple and domain relational calculus.
Examined in the 70-mark end-semester paper
- The relational model and Codd's rules
- Relational algebra
- Extended relational algebra operations
- Tuple and domain relational calculus
Unit 3: Introduction to SQL
7 hoursSQL DDL and basic query structure; set operations, null values, aggregate functions and nested subqueries; modifying the database; joins, views, transactions, integrity constraints, data types and authorisation; JDBC, ODBC and embedded SQL; functions, procedures and triggers.
Examined in the 70-mark end-semester paper
Unit 4: Relational Database Design
5 hoursCharacteristics of good relational designs; functional dependencies and normal forms 1NF, 2NF, 3NF and BCNF; multivalued dependencies and 4NF; the database design process.
Examined in the 70-mark end-semester paper
- Functional dependencies
- Normalisation: 1NF, 2NF, 3NF and BCNF
- Fourth normal form and multivalued dependencies
- Database design process
Unit 5: Indexing and Hashing
6 hoursOrdered indices, B+-tree and B-tree index files, multiple-key access; static and dynamic hashing; indexing versus hashing; bitmap indices; index definition in SQL.
Examined in the 70-mark end-semester paper
- Indexing: ordered, B+-tree and hash indices
- Rehashing and extendible hashing
Unit 6: Transaction Processing
6 hoursTransaction concepts and models; atomicity and durability; isolation and the ACID properties; storage structure; schedules, serialisability and recoverability.
Examined in the 70-mark end-semester paper
Unit 7: Concurrency Control and Recovery Systems
7 hoursLock-based protocols and deadlock handling; multiple granularity and timestamp-based protocols; failure classification, storage, recovery and atomicity, recovery algorithms and buffer management.
Examined in the 70-mark end-semester paper
- Concurrency control and locking
- Deadlock handling in databases
- Validation-based protocols and multiple granularity
- Timestamp-based protocols
- Log-based recovery
Unit contents are summarised from the official PAHSU syllabus . AiCanCode.org is not affiliated with Punyashlok Ahilyadevi Holkar Solapur University (PAHSU).