Full lecture content, question patterns, and worked examples for every topic. Each page contains theory from the BITS Pilani slides, exam-focused question breakdowns, and solving strategies.
Entities, attributes, relationships, cardinality, weak entities, specialization. Full mapping rules for 1:1, 1:N, M:N, weak entities, multi-valued attributes.
Codd's model, keys, integrity constraints, NULL and 3-valued logic, relational algebra operators, outer joins, relational calculus, Codd's theorem.
Update anomalies, functional dependencies, Armstrong's axioms, closure algorithm, candidate key finding, 1NF–BCNF, lossless join, dependency preservation, canonical cover, 3NF synthesis.
Multi-valued dependencies, the CTX motivation, Fagin's theorem, trivial MVDs, 4NF definition, 4NF decomposition algorithm. Why BCNF is not enough.
Storage hierarchy, disk mechanics, access time calculation, elevator algorithm, flash memory, blocking factor formula, heap/sorted/hash files, slotted pages, RAID.
Primary/secondary/sparse/dense indexes, multi-level index, B+ tree structure, degree calculation, insertion/deletion, bulk loading. Extendible hashing, linear hashing, R-tree MINDIST for NN queries.
ACID properties, transaction states, lost update / dirty read / inconsistent analysis, conflict serializability, precedence graph, view serializability, recoverability, 2PL variants, timestamp ordering, protocol comparison.
Log records, immediate vs deferred update, WAL protocol, checkpointing, undo/redo classification, worked recovery examples, shadow paging, compensating transactions.
| Module | Topics |
|---|---|
| Data Modeling | ER Model & Mapping · Relational Model |
| Schema Design | Normalization & FDs · MVDs & 4NF |
| Storage & Indexing | Storage & File Organization · Indexing |
| Query Processing | Query Processing & Optimization |
| Transactions | Transaction Management · Crash Recovery |