Database Management System
Semester III · BCA 202 · 3 credits
0 / 9
chapters done
-
The syllabus asks for
- Data, information, database and DBMS
- Why not plain files? Objectives of a DBMS
- Importance, merits and demerits
- Applications of DBMS
- People in a database system
- Seeing the ideas: pictures, figures and the eight-point lists
Key points
- A DBMS manages a database for many users with consistency, security and recovery.
- It replaces the redundancy, isolation and integrity problems of file processing.
- Costs are money, complexity and overhead; benefits grow with data size and number of users.
-
The syllabus asks for
- The design process and the view of data
- Structure of a DBMS and three-level architecture
- Database languages
- Data models
- The entity-relationship model
- Converting an E-R diagram to tables
- Seeing the ideas: views, models and diagrams
Key points
- Design goes requirements → E-R → relations → physical.
- The three-level architecture gives data independence.
- E-R models entities, attributes, relationships, cardinality and participation; extended E-R adds ISA and aggregation.
- Conversion rules turn the diagram into relational tables mechanically.
-
The syllabus asks for
- Structure and terminology
- Keys
- Integrity constraints
- Relational algebra
- Seeing the ideas: tables, keys and queries
Key points
- A relation is a set of unique tuples over atomic domains; keys identify tuples and link tables.
- Integrity rules keep data valid across tables.
- Relational algebra composes select, project, product, set operations and joins to express any query; outer joins preserve unmatched rows.
-
The syllabus asks for
- Definition and importance
- Functional dependencies
- First normal form (1NF)
- Second normal form (2NF)
- Third normal form (3NF)
- Boyce–Codd normal form (BCNF)
- Fourth normal form (4NF) — multivalued dependencies
- Summary of the normal forms
- Seeing the ideas: anomalies, dependencies and decomposition
Key points
- Anomalies come from redundancy; normalization removes it by decomposition.
- Closures of attribute sets find keys.
- 1NF (atomic) → 2NF (no partial) → 3NF (no transitive) → BCNF (all determinants keys) → 4NF (no MVD).
-
The syllabus asks for
- Introduction to SQL
- Creating a database
- Data types
- Creating tables with constraints
- Altering tables
- Dropping and truncating
- Seeing the ideas: constraints in action
- Seeing the ideas with photographs: SQL, storage and removal
Key points
- SQL is declarative; DDL defines the schema, and constraints enforce integrity inside the database.
- Rejected statements show each constraint working; defaults supply missing values.
- ALTER evolves a table without data loss; DROP and TRUNCATE differ in how much they remove.
-
The syllabus asks for
- The sample database
- SELECT, FROM and WHERE
- ORDER BY, aggregates, GROUP BY and HAVING
- Joins
- Nested queries (subqueries)
- UPDATE and DELETE
- Views
- Seeing the ideas: how a query is really read
Key points
- SELECT filters, sorts, groups and aggregates; joins combine tables; subqueries nest one query in another.
- NULL needs special handling in comparisons and NOT IN.
- UPDATE and DELETE change data and need careful WHERE clauses.
- Views give named, reusable, controlled windows onto the data.
-
The syllabus asks for
- Stored procedures
- Transaction flow in a procedure
- DML triggers
- Indexing: basic concepts
- Seeing the ideas: why indexes, procedures and triggers matter
Key points
- Stored procedures package logic server-side with parameters, defaults, outputs and transaction control; savepoints allow partial rollback.
- Triggers react to data changes for audit and validation, with caveats about multi-row events, hidden logic and cost.
- Indexes (primary, secondary, dense, sparse, B+ tree, hash, composite) trade space and write speed for read speed.
-
The syllabus asks for
- Overview of query processing
- Measuring query cost
- Selection operation
- Sorting
- Join operation
- Evaluation of expressions and optimisation
- The database administrator and security issues
- Access protection, user accounts and audits
- Discretionary and mandatory access control
- Data encryption and decryption
- Seeing the ideas: plans, costs and defences
Key points
- The optimiser picks a plan by estimated block transfers; join algorithm choice changes cost by orders of magnitude.
- Heuristics (push selections and projections down) and cost-based search find good plans.
- The DBA secures the database through accounts, roles, least privilege, audit trails and backups.
- DAC lets owners share; MAC enforces classification; encryption protects data at rest and in transit; parameterised queries stop injection.
-
The syllabus asks for
- Transaction concept and the simple transaction model
- Atomicity and durability: the log
- Concurrency problems and isolation
- Serializability
- Lock-based protocols
- Deadlock handling
- Multiple granularity locking
- Time-stamp based protocol
- Seeing the ideas: transactions, schedules and locks
Key points
- Transactions give ACID; logging provides atomicity and durability.
- Isolation levels and serializability define what concurrent execution may look like; acyclic precedence graphs prove correctness.
- Locking (2PL, strict 2PL), deadlock handling, multiple granularity and timestamps are the standard concurrency-control tools.
No chapter matches. Try another word.
The paper
TU assessment: 60% final examination set by the university, 40% internal (assignments, lab work, attendance). Confirm the split in your college's notice.
Where the hours go
Teaching hours are the board's guide to how much of the paper each part carries.
- Unit 6 · Manipulating and Querying Data8 h
- Unit 2 · Database Design, Architecture and Model6 h
- Unit 5 · Creating and Altering Database and Tables (SQL)6 h
- Unit 7 · Stored Procedures, DML Triggers and Indexing5 h
- Unit 8 · Query Processing and Security5 h
- Unit 3 · Relational Database Model4 h
- Unit 4 · Database Normalization4 h
- Unit 9 · Transaction and Concurrency Control4 h
- Unit 1 · Introduction to DBMS3 h