Computer Engineering is coming soon
We're still writing and reviewing the notes for every subject, and we'll open it when every subject is ready. Meanwhile you can practise aptitude, ask Aria about any subject, or see the branches that are ready.
Computer Engineering
Database Management Systems
ER model, SQL and PL/SQL, normalisation, transactions, NoSQL.
Your progress in this subject0 of 21 · 0%
- 1Database systems and their purposeOverview of what database systems are, why engineers use them, their core concepts, architecture, and typical exam-style answers for the purpose of clear revision.
- 2Database system structure and data modelsStructure of a database system (three-schema architecture, schemas vs instances, data independence) and common data models (relational, hierarchical, network, object-oriented) with precise definitions, diagrams to draw, formulas, worked model answers, exam tips and quick checks.
- 3The ER modelThe ER model (Entity-Relationship model) is a high-level conceptual tool for designing and communicating the logical structure of a database using entities, attributes and relationships.
- 4Extended ER features and mapping ER diagrams to tablesExtended ER features (weak entities, multi-valued/composite attributes, specialization/generalization, aggregation, n-ary relationships) and clear step-by-step rules for mapping any ER diagram into relational tables.
- 5SQL: DDL and DMLPractical, exam-focused notes on SQL Data Definition Language (DDL) and Data Manipulation Language (DML): what each statement does, exact syntax to remember, worked SQL examples with expected outputs, common exam mistakes and quick practice questions.
- 6SQL functions and aggregate queriesClear, exam-focused notes on SQL scalar and aggregate functions, GROUP BY, HAVING, NULL handling, and grouping extensions (ROLLUP/GROUPING SETS) with definitions, syntax to remember, worked SQL examples and common mistakes.
- 7Joins, set operations and nested queriesClear, exam-focused notes on SQL joins (inner, outer, cross, natural), set operations (UNION, INTERSECT, EXCEPT/MINUS) and nested queries (subqueries, correlated and non-correlated) with definitions, laws, syntax, worked SQL examples and common mistakes.
- 8Views, indexes, DCL and TCLConcise study notes on Views, Indexes, DCL and TCL explaining definitions, rules, SQL syntax, examples and exam tips for engineering students.
- 9PL/SQL: control statements and cursorsPL/SQL control statements (IF, CASE, LOOP, FOR, WHILE, EXIT) and cursors (implicit, explicit, cursor FOR loop, REF CURSOR) for processing query results and controlling flow in stored programs.
- 10Stored procedures, functions and triggersPractical, exam-focused notes on stored procedures, functions and triggers: definitions, syntax, semantics, examples and common exam mistakes for DBMS courses.
- 11The relational model and Codd's rulesClear, exam-oriented notes on the relational model (relations, schemas, tuples, domains, keys) and Codd's rules with exact definitions, formal conditions, worked model answers, common exam mistakes and quick checks.
- 12Integrity constraintsClear, exam-focused notes on integrity constraints in the relational model: definitions, formal laws, SQL examples, common mistakes and practice questions.
- 13Functional dependenciesClear, exam-focused notes on functional dependencies: definitions, Armstrong's axioms and derived rules, attribute closure, minimal cover, algorithms and worked examples for finding closures, keys and minimal covers.
- 14Normalisation: 1NF, 2NF, 3NF and BCNFClear, exam-oriented notes on relational normalisation: definitions, laws (Armstrong's axioms), algorithms for finding keys and decomposing into 1NF, 2NF, 3NF and BCNF, with worked examples and common mistakes.
- 15Transactions and ACID propertiesTransactions group multiple database operations into one atomic unit and ACID (Atomicity, Consistency, Isolation, Durability) are the properties that make transactions reliable and safe under failures and concurrency.
- 16Schedules and serialisabilitySchedules and serialisability: how to decide whether interleaved transaction executions are correct (equivalent to some serial order), how to test that (conflict / precedence graph), and how recoverability, cascading aborts and strictness relate.
- 17Recoverable schedules and cascading abortsRecoverable schedules ensure transactions that read others' updates wait for those writers to commit; cascadeless and strict schedules are stronger forms that prevent cascading aborts and dirty-accesses.
- 18Concurrency control and lockingClear, exam-ready notes on concurrency control and locking: definitions (schedule, serializability, locks), two-phase locking and its variants, lock compatibility, deadlocks and detection, with worked examples and exam tips.
- 19NoSQL data modelsClear, exam-focused notes on NoSQL data models: definitions, types (key-value, document, wide-column, graph, time-series), modeling rules, when to choose each, examples and typical exam questions.
- 20CAP theorem and BASEClear explanation of the CAP theorem (formal statement, assumptions, diagram to draw) and BASE (Basically Available, Soft state, Eventual consistency) with examples, common mistakes and exam guidance.
- 21MongoDB: CRUD, indexing and aggregationPractical study notes on using MongoDB for CRUD (Create, Read, Update, Delete), how indexes work and how to write aggregation pipelines, aimed at engineering exam preparation.
Coming next in Database Management Systems
- Keys in the relational model· notes coming
- Relational algebra· notes coming
- Fourth normal form and multivalued dependencies· notes coming
- Timestamp-based protocols· notes coming
- Log-based recovery· notes coming
- Deadlock handling in databases· notes coming
- Cloud and distributed databases· notes coming
- Object-oriented databases· notes coming
- Extended relational algebra operations· notes coming
- Tuple and domain relational calculus· notes coming
- Embedded SQL, JDBC and ODBC· notes coming
- Database design process· notes coming
- Lossless join and dependency preservation· notes coming
- Join dependencies and fifth normal form· notes coming
- Indexing: ordered, B+-tree and hash indices· notes coming
- Validation-based protocols and multiple granularity· notes coming