BCA 102T Database Management System (DBMS) Notes from Unnati Educations run to 104 pages across 4 units, with 32 solved SQL queries and 15 relational algebra examples shown with output, plus 129 exam-style questions tagged by topic. They follow the GGSIPU BCA Semester 2 syllabus for the batch admitted in 2024-25 onwards.
Scheme: BCA Scheme and Syllabus w.e.f. 2024-25 | Applies to: batch admitted in 2024-25 onwards | Verified against: syllBCA1styr240124.pdf (24 Jan 2024)
On this page
- BCA 102T at a glance: credits, units and exam pattern
- BCA 102T notes unit-wise
- BCA 102T exam corner
- Excerpt: super, candidate and primary keys (page 18)
- Do the BCA 102T notes cover the full syllabus?
- Who writes and checks these notes?
- BCA 102T, the BCA 102P lab and other Sem 2 papers
- How to write BCA 102T answers
- BCA 102T DBMS notes FAQs
- Get the full notes on WhatsApp
BCA 102T Database Management System (DBMS) at a glance: GGSIPU BCA Sem 2 credits, units and exam pattern
BCA 102T is one of the 10 GGSIPU BCA Semester 2 papers. Facts below are from the official PDFs.
| Code and title | BCA 102T · Database Management System (DBMS) |
|---|---|
| Category and credits | CCT (core theory) · 4 credits · L-T-C 4-0-4 |
| Marks | 100: 40 internal + 60 end-term |
| Applies to | Batch admitted in 2024-25 onwards |
| End-term pattern | Q1: 10 short questions of 2 marks, at least 2 per unit. Then 1 of 2 questions per unit, 10 marks each (20 + 40 = 60 marks) |
| Units | 4 (10, 13, 12 and 9 teaching hours) |
| Paired lab | BCA 102P DBMS Lab · CCP · 1 credit · 100: 40 + 60 |
The official PDF numbers the units without titles, so unit names here are the notes' own.
BCA 102T Database Management System (DBMS) Notes unit-wise: 32 solved SQL queries, 15 relational algebra examples and 129 exam questions across 4 units
BCA 102T Unit 1: Introduction to DBMS and ER Model
Pages 5 to 26, topics 1.1 to 1.20. Part A covers DBMS versus file processing, the three-schema architecture, five data models and data independence. Part B builds ER diagrams with cardinality, weak entities and EER specialisation, ending in a full college ER diagram (page 21). 21 two-mark and 10 ten-mark questions.
Quick look: data independence (from page 15)
| Basis | Logical | Physical |
|---|---|---|
| Change made in | Conceptual schema | Internal schema |
| Protects | External schemas, programs | Conceptual schema |
| Difficulty | Harder | Easier |
| Example | Adding an Email column | Adding an index |
Quick look: logical vs physical data independence (from page 15)
- Basis
- Change made in
- Logical
- Conceptual schema
- Physical
- Internal schema
- Basis
- Protects
- Logical
- External schemas, programs
- Physical
- Conceptual schema
- Basis
- Difficulty
- Logical
- Harder
- Physical
- Easier
- Basis
- Example
- Logical
- Adding an Email column
- Physical
- Adding an index
BCA 102T Unit 2: Structured Query Language (SQL)
Pages 27 to 58, topics 2.1 to 2.22. One sample COURSE and STUDENT database, with NULLs on purpose, runs through all 32 solved queries, so every answer shows real output. It covers DDL to TCL, constraints, correlated subqueries, GROUP BY with HAVING, all four joins, views, triggers and stored procedures. 24 two-mark and 10 ten-mark questions.
Quick look: NULL logic (from page 39)
| Expression | Result |
|---|---|
NULL = NULL | UNKNOWN |
5 + NULL | NULL |
FALSE AND UNKNOWN | FALSE |
TRUE OR UNKNOWN | TRUE |
Quick look: three-valued logic with NULL (from page 39)
- Expression
NULL = NULL- Result
- UNKNOWN
- Expression
5 + NULL- Result
- NULL
- Expression
FALSE AND UNKNOWN- Result
- FALSE
- Expression
TRUE OR UNKNOWN- Result
- TRUE
BCA 102T Unit 3: Relational Model, Algebra and Normalization
Pages 59 to 84, topics 3.1 to 3.19. Codd's 12 rules come first, then 15 solved relational algebra examples, from selection to division and outer joins, each with its output. The 8-step ER-to-relational mapping is applied to the Unit 1 diagram, and one badly designed table is carried from 1NF to BCNF. 23 two-mark and 10 ten-mark questions.
Quick look: A⁺ for F = {A → BC, CD → E, B → D, E → A} (from page 76)
- Start with A⁺ = A.
- A → BC gives ABC.
- B → D gives ABCD; then CD → E gives ABCDE.
- A⁺ holds every attribute, so A is a candidate key.
BCA 102T Unit 4: Transactions, Recovery, Security, QBE and NoSQL
Pages 85 to 104, topics 4.1 to 4.15. A money transfer opens the unit in SQL, with a failed CHECK undone by ROLLBACK. Then ACID, lost update timelines, two-phase locking, backups, log-based recovery, GRANT and REVOKE, Query by Example, and four NoSQL types. 21 two-mark and 10 ten-mark questions.
Quick look: deferred vs immediate update (from page 93)
| Basis | Deferred | Immediate |
|---|---|---|
| Database written | After commit | Before commit too |
| Undo needed? | No | Yes |
| Redo needed? | Yes | Yes |
| Log needs old value? | No | Yes |
Quick look: deferred vs immediate update (from page 93)
- Basis
- Database written
- Deferred
- After commit
- Immediate
- Before commit too
- Basis
- Undo needed?
- Deferred
- No
- Immediate
- Yes
- Basis
- Redo needed?
- Deferred
- Yes
- Immediate
- Yes
- Basis
- Log needs old value?
- Deferred
- No
- Immediate
- Yes
BCA 102T exam corner: 89 two-mark and 40 ten-mark questions mapped to the DBMS topics that answer them
Each question carries the topic number that answers it: "WHERE vs HAVING (2.16)" points to page 46.
| Unit | 2 Marks | 10 Marks | Solved examples |
|---|---|---|---|
| 1 | 21 | 10 | 1 ER diagram |
| 2 | 24 | 10 | 32 SQL queries |
| 3 | 23 | 10 | 15 relational algebra, 3 worked problems |
| 4 | 21 | 10 | 1 SQL transaction |
BCA 102T question bank and solved work by unit
- Unit
- 1
- 2 Marks
- 21
- 10 Marks
- 10
- Solved examples
- 1 ER diagram
- Unit
- 2
- 2 Marks
- 24
- 10 Marks
- 10
- Solved examples
- 32 SQL queries
- Unit
- 3
- 2 Marks
- 23
- 10 Marks
- 10
- Solved examples
- 15 relational algebra, 3 worked problems
- Unit
- 4
- 2 Marks
- 21
- 10 Marks
- 10
- Solved examples
- 1 SQL transaction
The BCA 102T notes list 89 two-mark and 40 ten-mark exam-style questions across 4 units, plus 47 solved SQL and relational algebra examples with output.
- Unit 1 (10 Marks): ER diagram for a hospital with a weak entity. Pointer: double rectangle, double diamond, dashed partial key (page 20).
- Unit 2 (2 Marks): DELETE vs TRUNCATE vs DROP. Pointer: DELETE is DML; TRUNCATE keeps the structure, DROP removes it (topic 2.6).
- Unit 3 (10 Marks): A 3NF relation not in BCNF. Pointer: TEACHES(Student, Subject, Teacher) with Teacher → Subject (page 80).
- Unit 4 (2 Marks): Incremental vs differential backup. Pointer: since the last backup, versus since the last full one (page 92).
More practice sits in the BCA 102T important questions.
Super key, candidate key and primary key in DBMS: excerpt from page 18 of the BCA 102T notes
Excerpt from page 18
1.16 Keys in DBMS
A key is an attribute, or a set of attributes, that uniquely identifies each entity (row) in an entity set (table). Take this STUDENT table to understand every key.
| Roll_No | Enrol_No | Aadhaar_No | Name | Course |
|---|---|---|---|---|
| 101 | IPU2501 | 4521-xxxx | Riya | BCA |
| 102 | IPU2502 | 7845-xxxx | Aman | BCA |
| 103 | IPU2503 | 1298-xxxx | Riya | BBA |
Sample STUDENT table used to explain keys (page 18)
- Roll_No
- 101
- Enrol_No
- IPU2501
- Aadhaar_No
- 4521-xxxx
- Name
- Riya
- Course
- BCA
- Roll_No
- 102
- Enrol_No
- IPU2502
- Aadhaar_No
- 7845-xxxx
- Name
- Aman
- Course
- BCA
- Roll_No
- 103
- Enrol_No
- IPU2503
- Aadhaar_No
- 1298-xxxx
- Name
- Riya
- Course
- BBA
Super key
Any set of one or more attributes that can uniquely identify a row. It may contain extra attributes. Examples: {Roll_No}, {Enrol_No}, {Roll_No, Name} and {Aadhaar_No, Course}.
Candidate key
A minimal super key: no attribute can be removed from it. Examples: {Roll_No}, {Enrol_No} and {Aadhaar_No}. {Roll_No, Name} is a super key but not a candidate key, because Name is extra.
Primary key
The candidate key chosen by the designer to identify rows. It cannot be NULL and cannot repeat. Here the designer picks Roll_No.
Alternate, composite and foreign keys
Alternate keys are the candidate keys not chosen as primary key: Enrol_No and Aadhaar_No. A composite key is made of two or more attributes, such as {Roll_No, Course_ID} in an ENROLMENT table. A foreign key is an attribute in one table that refers to the primary key of another, such as Course_ID in STUDENT referring to COURSE(Course_ID). Unit 2 returns to it as the REFERENCES constraint.
Attribute types on the same page
The page also finishes the list of attribute types. A multivalued attribute such as Phone_No can hold more than one value and is drawn as a double ellipse. A derived attribute such as Age is calculated from Date_of_Birth, need not be stored, and is drawn as a dashed ellipse. A key attribute is shown with its name underlined. When a value is unknown or does not apply, such as the Middle_Name of someone who has none, the attribute holds NULL.
The order to remember: every primary key is a candidate key, and every candidate key is a super key.
Do the BCA 102T notes cover the full GGSIPU syllabus?
Yes. Every official topic in all four units has a matching section in the notes.
| Official unit | Official topics | Where in the notes | Status |
|---|---|---|---|
| Unit I | DBMS overview, architecture, client/server, data models, distributed data processing, schema and instances, data independence; ER model, attributes and keys, weak entities, enhanced E-R | 1.1 to 1.20, pages 7 to 23 | Covered |
| Unit II | SQL overview, data types; DDL, DML, DCL; logical operators; null values; integrity constraints; nested queries; GROUP BY, HAVING; joins; views, sequences, indexes, triggers, stored procedure | 2.1 to 2.22, pages 29 to 55 | Covered |
| Unit III | Relational model, constraints, Codd's Rules; relational algebra, set theoretic and join operations; ER to relational mapping; functional dependencies, Armstrong's rule, normalization up to BCNF | 3.1 to 3.19, pages 61 to 81 | Covered |
| Unit IV | Transaction, ACID properties; system failure, backup and recovery techniques; authentication, authorization; overview of Query by Language, NoSQL databases | 4.1 to 4.15, pages 87 to 101 | Covered (taught as Query by Example) |
Official BCA 102T units mapped to the notes
- Official unit
- Unit I
- Official topics
- DBMS overview, architecture, client/server, data models, distributed data processing, schema and instances, data independence; ER model, attributes and keys, weak entities, enhanced E-R
- Where in the notes
- 1.1 to 1.20, pages 7 to 23
- Status
- Covered
- Official unit
- Unit II
- Official topics
- SQL overview, data types; DDL, DML, DCL; logical operators; null values; integrity constraints; nested queries; GROUP BY, HAVING; joins; views, sequences, indexes, triggers, stored procedure
- Where in the notes
- 2.1 to 2.22, pages 29 to 55
- Status
- Covered
- Official unit
- Unit III
- Official topics
- Relational model, constraints, Codd's Rules; relational algebra, set theoretic and join operations; ER to relational mapping; functional dependencies, Armstrong's rule, normalization up to BCNF
- Where in the notes
- 3.1 to 3.19, pages 61 to 81
- Status
- Covered
- Official unit
- Unit IV
- Official topics
- Transaction, ACID properties; system failure, backup and recovery techniques; authentication, authorization; overview of Query by Language, NoSQL databases
- Where in the notes
- 4.1 to 4.15, pages 87 to 101
- Status
- Covered (taught as Query by Example)
Official sources: BCA first-year syllabus, batch 2024-25 onwards · BCA scheme of examination w.e.f. 2024-25
Unit IV prints "Query by Language", but course outcome CO2 names Query By Example, so the notes teach QBE (page 98).
Every course in GGSIPU notes is mapped to its official PDF this same way.
Who writes and checks the BCA 102T DBMS notes?
- Prateek Talwar, author. Founder, Unnati Educations; Associate Company Secretary (ACS), ICSI, since May 2019; B.Com, University of Delhi, 2012. Profile
- Ritik Rawat, subject reviewer. Senior Full Stack Developer, Unnati Educations; B.Tech. Profile
The same team prepares GGSIPU important questions from the same official unit lists.
BCA 102T and the BCA 102P DBMS lab (practical list set by your teacher), plus other GGSIPU BCA Sem 2 papers
Paired lab: BCA 102P DBMS lab notes. Its practical list is notified by the teacher in week one.
Most lab work comes from Unit 2: the 15 practice queries on EMP and DEPT tables (pages 57 to 58) cover constraints, filters, a correlated subquery, joins, a view, an index and a trigger.
Alongside these GGSIPU BCA Semester 2 DBMS notes, the semester has BCA 104T Object Oriented Programming using Java, BCA 106T Data Structures and Algorithms, BCA 108T Software Engineering, BCA 142T Soft Skills and BCA 192T Environment Studies, with the labs BCA 104P, 106P and 108P.
How to write BCA 102T answers: SQL with output, relational algebra expressions and ER diagrams
BCA 102T answers come in three shapes. A theory answer opens with the definition, adds a comparison table and ends with a small example. A query answer writes the SQL or relational algebra, then the output rows. A design answer is a diagram with a few lines of assumptions.
For ER diagrams the notes give six steps (page 21): nouns become entities, properties become attributes with the key underlined, verbs become relationships, write 1, N or M on every line, mark total participation with double lines and weak entities with double rectangles, then add 3 or 4 lines of assumptions.
For transaction states, draw the state diagram (Figure 4.1) first, then explain each state in one line. For relational algebra, write the expression with its operator symbols (σ, π, ⋈) and show the result relation as a small table, exactly as the 15 solved examples in Unit 3 do.
A worked query answer from page 48, of the kind asked in the ten-mark GROUP BY question: show courses with at least two students.
SELECT Course_ID, COUNT(*) AS Students
FROM STUDENT
WHERE Course_ID IS NOT NULL
GROUP BY Course_ID
HAVING COUNT(*) >= 2;Output: C01 with 3 and C02 with 2. Add one line: WHERE filters rows before grouping, HAVING filters groups after it.
The Common Mistakes tables flag the slips that cost marks: Marks = NULL instead of Marks IS NULL, an aggregate inside WHERE, calling TRUNCATE a DML command, swapping σ (rows) and π (columns), and testing 2NF when the key is a single attribute. For normalisation, find closures and candidate keys first, then check partial dependency for 2NF and transitive dependency for 3NF.
Practise this format on GGSIPU BCA important questions.
BCA 102T DBMS notes FAQs
What is the passing mark for BCA 102T?
BCA 102T is marked out of 100: 40 internal and 60 end-term. The BCA scheme of examination states pass marks as 40%, which is 40 out of 100. Minimum marks in the end-term exam, re-appear and other result rules are set by GGSIPU Ordinance 11, so read the current version at ipu.ac.in (Ordinance 11) before your exam.
What is the BCA 102T end-term paper pattern?
The BCA 102T end-term paper carries 60 marks. Question 1 is compulsory: 10 short questions of 2 marks, at least 2 per unit, for 20 marks. Then each of the four units has two questions of 10 marks, and you attempt one from each unit, for 40 marks. The paper setter maps every question to a course outcome.
Which unit of the BCA 102T notes has the most solved SQL?
Unit 2, which covers Structured Query Language. It holds all 32 solved SQL queries in the notes, on pages 35 to 51, all run on the same COURSE and STUDENT tables. Unit 3 adds 15 solved relational algebra examples on pages 66 to 72, each written with its operator symbols and the full output relation.
Are BCA 102T and BCA 102P the same paper?
No. BCA 102T is the theory paper with 4 credits and a written end-term exam. BCA 102P DBMS Lab is its practical paper with 1 credit and 2 practical hours a week, marked separately out of 100. Its practical list is notified by your teacher, so these theory notes support the lab but do not replace lab notes.
Does BCA 102T include Query by Example or "Query by Language"?
The BCA 102T syllabus prints "Overview of Query by Language" in Unit IV, while course outcome CO2 mentions Query By Example. The notes prepare QBE: skeleton tables, the P., I., U. and D. commands, example elements such as _x for joins and a QBE versus SQL table (pages 98 to 99). Check with your teacher if unsure.
Get the full BCA 102T Database Management System (DBMS) Notes on WhatsApp
| Unit | Pages |
|---|---|
| Cover and index | 4 |
| Unit 1 | 22 |
| Unit 2 | 32 |
| Unit 3 | 26 |
| Unit 4 | 20 |
Pages in the BCA 102T notes book by unit
- Unit
- Cover and index
- Pages
- 4
- Unit
- Unit 1
- Pages
- 22
- Unit
- Unit 2
- Pages
- 32
- Unit
- Unit 3
- Pages
- 26
- Unit
- Unit 4
- Pages
- 20
Order these notes in book form through WhatsApp. The full notes are not available as a PDF.
The printed book has 104 pages, 76 topics and 17 figures. These are DBMS notes in English. Our WhatsApp desk shares the order and delivery details.
Unnati Educations is an independent education provider based in Vikaspuri, Delhi. We are not affiliated with, authorised by, or endorsed by Guru Gobind Singh Indraprastha University (GGSIPU). 'GGSIPU' and 'IPU' are used only to describe the syllabus our notes follow. For official information, visit ipu.ac.in.
Ready for the full notes?
Discuss coverage and delivery with our team.