Key takeaways
- Candidate keys, normal forms, serializability and SQL queries carry most marks.
- Write each query in both relational algebra and SQL when you practise.
- Each section has exam tips and formula boxes, and the last page lists the most asked practice questions.
- These are original Uncodemy revision notes, not official university notes; check your own syllabus.
About these DBMS handwritten notes
This page offers Uncodemy's Database Management Systems notes as a free handwritten-style PDF. Database Management Systems explains how data is modelled, stored, queried and kept consistent when many users work with it at once. The notes are written in short points with neat tables, labelled diagrams, boxed formulas and exam tips, so you can revise a full unit in one sitting instead of reading a long textbook chapter.
Please note: these are original Uncodemy revision notes. They follow the common syllabus that most Indian universities share for this subject, but they are not official university notes. Check your own university syllabus and add anything it lists that is missing here.
What's inside the DBMS notes
The PDF is arranged in 8 sections plus a final page of most asked practice questions. The sections follow the usual unit order of a Database Management Systems syllabus, so you can map them to your own units quickly. Here is what each section covers.
Introduction to DBMS
DBMS vs file system, the three-schema architecture with physical and logical data independence, and DDL, DML and DCL.
ER model
Entities, attributes, relationships, cardinality and participation, weak entities, and the rules for converting an ER diagram to tables.
Relational model and keys
Super, candidate, primary and foreign keys, integrity constraints and relational algebra operations.
SQL
DDL and DML commands, joins with examples, GROUP BY and HAVING, nested queries and other common query forms.
Functional dependency and normalisation
Armstrong's axioms, attribute closure, a solved candidate key example, 1NF to BCNF, and lossless join and dependency preservation.
Transactions and concurrency control
ACID properties, transaction states, serial and concurrent schedules, conflict serializability, and locking with 2PL and timestamp protocols.
Recovery
Failure types, log-based recovery, checkpoints and how the system recovers after a crash.
Indexing and file organisation
Primary, secondary, dense and sparse indexes, B tree and B+ tree, and hashing for file organisation.
Most asked questions (practice)
Ten exam-style questions, from the three-schema architecture to B+ tree order.
How to use handwritten notes to revise DBMS
DBMS mixes design, queries and numericals. Use the notes to revise each kind of question, not only the definitions.
- Find candidate keys with attribute closure for three new relations before the exam.
- Write ten SQL queries on one schema, using joins, GROUP BY, HAVING and a nested query.
- Draw a precedence graph for two schedules and decide if each is conflict serializable.
- Convert one ER diagram of your own, such as a library, into tables using the rules in the notes.
A simple three-pass method works well with handwritten notes. In the first pass, read one section and underline only what you do not already know. In the second pass, close the notes and write the definitions, diagrams and steps for that section on a blank sheet, then compare and correct in a different colour. In the third pass, a day or two later, answer two or three exam-style DBMS questions in timed conditions using only memory. Add your own examples and doubts in the margins so the PDF becomes your personal revision copy.
Formulas, diagrams and definitions to memorise
- Armstrong's axioms: reflexivity, augmentation and transitivity, plus union, decomposition and pseudo-transitivity.
- Normal form tests: 2NF (no partial dependency), 3NF (no transitive dependency on non-prime attributes), BCNF (every determinant is a super key).
- Lossless join test: the common attributes of two relations must be a key of at least one of them.
- ACID properties and the transaction state diagram.
- Precedence graph rule: a schedule is conflict serializable if its graph has no cycle.
Common mistakes that cost marks
- Listing a super key as a candidate key without checking minimality.
- Decomposing to BCNF without checking whether dependencies are preserved, and not saying so.
- Using WHERE instead of HAVING to filter grouped results in SQL.
- Missing a conflicting pair (read-write, write-read or write-write on the same item) when drawing the precedence graph.
Exam focus: DBMS topics that carry the most marks
These DBMS topics carry the most marks in most university papers and in GATE.
- Keys, attribute closure and candidate keys.
- Normalisation up to BCNF, lossless join and dependency preservation.
- SQL and relational algebra queries.
- Serializability, 2PL, timestamp protocols, recovery and B+ trees.
Typical long questions
- Explain the three-schema architecture and data independence.
- Draw an ER diagram for a hospital and convert it into tables.
- Find all candidate keys of a relation using attribute closure.
- Explain 1NF, 2NF, 3NF and BCNF and normalise a given relation.
- Check if a decomposition is lossless and dependency preserving.
- Test conflict serializability of a schedule using a precedence graph.
- Explain two-phase locking and timestamp-based protocols.
Marks per question change between universities and years, so confirm the pattern on a recent official paper. In long answers, start with a definition, add a labelled diagram or table, explain the steps and finish with an example or comparison. Underline the key term in each answer and leave a line between steps, because examiners mark faster when the structure is easy to see.
A 7-day revision plan for DBMS
- Day 1: Introduction to DBMS, ER model.
- Day 2: Relational model and keys, SQL.
- Day 3: Functional dependency and normalisation, Transactions and concurrency control.
- Day 4: Recovery.
- Day 5: Indexing and file organisation.
- Day 6: redo the numericals: two candidate key problems, one normalisation to BCNF, one serializability test and a set of SQL queries.
- Day 7: answer the most asked practice questions at the end of the notes from memory, then solve one official previous year paper in three hours and mark the units that cost you time.
Keep a single sheet of formulas, definitions and diagrams from the notes for the last hour before the exam, and do not start new topics on the final day.
Who these notes are for
- B.Tech CSE and IT students preparing for the semester DBMS exam.
- BCA and MCA students with a database paper.
- GATE CS aspirants revising keys, normal forms, serializability and B+ trees.
- Freshers revising SQL and database basics before developer, data or testing interviews.
The notes are a revision aid, not a first textbook. If a DBMS topic is new to you, learn it from your prescribed book or class lectures first, then come back to the notes to compress and revise it. For practice, pair them with the DBMS Important Questions PDF page and your university's official previous year papers. If your syllabus has a topic that is not covered here, you can ask for it through the handwritten notes request page linked below.
Download Database Management Systems Handwritten Notes PDF
Database Management Systems Handwritten Notes PDF
The PDF carries the same content as this page in a clean, print-ready layout, so you can read it offline and keep it for revision.
7 pages · 283 KB · PDF · Updated 5 Nov 2026