Databases
Relational model, SQL, normalization, transactions and indexing
This is the Databases syllabus taught for GATE Computer Science & IT. Each topic opens as a full chapter — theory, worked examples and the traps that paper actually uses.
Topics in Databases
- Entities, Relationships and TablesFrom a campus-shop ER sketch to the three tables a relational database actually stores.
- Indexing and B+ TreesClustered versus secondary indexes and B+ trees that find a campus-shop sale without a full scan.
- Isolation Levels and LockingWhich accidents a kiosk session may still see, from READ UNCOMMITTED to SERIALIZABLE, and how 2PL implements the stronger ones.
- Second, Third and Boyce–Codd FormSplit the campus-shop leftovers: partial FDs, transitive wardens, and BCNF determinants.
- Functional Dependencies and First Normal FormFDs, attribute closure, candidate keys and atomic cells — the rules that make the campus-shop tables split later.
- Relations, Keys and Basic SQLWhat a relation is, how keys name a row, relational algebra, and SELECT/WHERE on one campus-shop table.
- SQL Joins, Groups and NULLJoin the campus-shop tables, group sales, and handle missing values in SQL.
- Transactions, Accidents and RecoveryACID on one sale, dirty/lost/phantom accidents, conflict serializability and write-ahead logging.
Practise Databases
Reading every chapter below is free and needs no account. Practice, mocks and progress live in the app.
Continue with Google — freeNo card, no trial. Works offline once installed.