Vidyarthi AIStudent Career Compass

BCS403VTU · Sem 4

Database Management Systems

VTU 2022 scheme (B.E. CSE and allied, IPCC, from 2023-24) · 100 marks: 50 SEE + 50 CIE. SEE is a 3-hour theory paper of 100 marks scaled to 50: 10 questions of 20 marks (2 per module, up to 3 sub-questions each), answer 5 full questions choosing one from each module; questions may include the practical component. CIE 50 = 25 theory (two 1-hour internal tests plus other assessment, scaled to 25) + 25 practical (15 for lab records, 10 for a lab test). IPCC, L:T:P:S 3:0:2:0, 4 credits. Minimum 40% in each CIE component (20/50 total), 18/50 in SEE, 40/100 overall.

Official syllabus

Revised 0 of 107 high-repeat questions

One-Night Pass Pack

External level: user views; conceptual level: whole database structure (entities, relationships, constraints); internal level: physical storage and access paths. Mappings convert requests and results between levels (external/conceptual and conceptual/internal). Logical data independence: change the conceptual schema (add an attribute) without changing external schemas or programs. Physical data independence: change the internal schema (new index, file organisation) without changing the conceptual schema. Only the mappings need to change, which is why they are needed.
Full-marks tip: Draw the three-level diagram with end users on top and stored database at the bottom, with mapping arrows. Give one example of each independence. Common mistake: mixing up which level each independence protects.

Exam kal hai? Send this Pass Pack to your batch group.

Unit-wise syllabus

U1Introduction to Databases and Conceptual Modelling with the ER Model

Weightage: Equal share: 1 of 5 modules (~20%), 2 questions per module in SEE

Characteristics of the database approachAdvantages of using the DBMS approachHistory of database applicationsData models, schemas and instancesThree-schema architecture and data independenceDatabase languages and interfacesThe database system environment (DBMS component modules)Entity types, entity sets, attributes and keysRelationship types, roles and structural constraintsWeak entity typesER diagrams, naming conventionsSpecialization and generalization

U2Relational Model, Relational Algebra and ER-to-Relational Mapping

Weightage: Equal share: 1 of 5 modules (~20%), 2 questions per module in SEE

Relational model concepts and characteristics of relationsRelational model constraints and relational database schemasUpdate operations, transactions and dealing with constraint violationsUnary operations: SELECT, PROJECT, RENAMESet operations: UNION, INTERSECTION, MINUS, CARTESIAN PRODUCTBinary operations: JOIN (equi, natural, outer), DIVISIONAdditional operations: aggregate functions and groupingExamples of queries in relational algebraRelational database design using ER-to-relational mapping

U3Normalization and SQL Basics

Weightage: Equal share: 1 of 5 modules (~20%), 2 questions per module in SEE

Informal design guidelines for relation schemasUpdate anomaliesFunctional dependencies and inference rulesEquivalence of FD sets and minimal coverNormal forms based on primary keys: 1NF, 2NF, 3NFBoyce-Codd normal formMultivalued dependency and 4NFJoin dependencies and 5NFSQL data definition and data typesSpecifying constraints in SQLBasic retrieval queries in SQLINSERT, DELETE and UPDATE statementsAdditional features of SQL

U4Advanced SQL and Transaction Processing

Weightage: Equal share: 1 of 5 modules (~20%), 2 questions per module in SEE

More complex SQL retrieval queries (nested and correlated queries, joins, GROUP BY, HAVING)Specifying constraints as assertions and actions as triggersViews in SQLSchema change statementsIntroduction to transaction processingTransaction and system concepts, transaction states, system logDesirable properties of transactions (ACID)Characterizing schedules based on recoverabilityCharacterizing schedules based on serializabilityTransaction support in SQL

U5Concurrency Control and NoSQL Databases

Weightage: Equal share: 1 of 5 modules (~20%), 2 questions per module in SEE

Two-phase locking techniquesConcurrency control based on timestamp orderingMultiversion concurrency controlValidation (optimistic) concurrency controlGranularity of data items and multiple granularity lockingIntroduction to NoSQL systemsThe CAP theoremDocument-based NoSQL systems and MongoDBNoSQL key-value storesColumn-based or wide column NoSQL systemsNoSQL graph databases and Neo4j

Curated video lectures

Free lectures from well-known educators, matched to units. Videos load only when you tap “Watch here”, to save data.

Database Management Systems: basics, ER model, relational model and keys

Neso Academy · Playlist · 57 videos · English · Unit 1

DBMS lectures: data models, three schema architecture, ER diagrams and keys

Jenny's Lectures CS IT · Playlist · 24 videos · English · Unit 1

DBMS complete playlist: relational algebra, normalization, SQL, transactions, concurrency control

Gate Smashers · Playlist · 140 videos · Hindi

DBMS in Simple Steps (SQL, normalization, transactions)

TutorialsPoint · Playlist · 157 videos · English

Complete MongoDB Tutorial (CRUD operations for the NoSQL part)

Net Ninja · Playlist · 25 videos · English · Unit 5

Exam Guide Radar

Standard textbook

Ramez Elmasri and Shamkant B. Navathe, Fundamentals of Database Systems, 7th Edition, Pearson, 2017 (Textbook 1; Ramakrishnan and Gehrke, Database Management Systems, 3rd Edition, McGraw Hill, is Textbook 2)

Exam guide students buy

Sunstar Exam Scanner for VTU 4th semester CSE (2022 scheme) or a Technical Publications Database Management Systems book written for VTU BCS403

Pick the 2022-scheme edition: question banks are arranged module-wise with solved VTU papers.

Local market tip

Get the Elmasri and Navathe 7th edition (Indian Pearson print is cheap) and an exam guide that prints BCS403 and the 2022 scheme on the cover, not 21CS53 or 18CS53, from your college book stall before the first IA test.

Lab Viva Survival

BCS403 practical component Programs 1-3: Employee table with users, constraints, ROLLBACK, ALTER/UPDATE/DELETE, aggregate functions with GROUP BY and ORDER BY

Q. Difference between COMMIT and ROLLBACK?: → COMMIT saves the transaction's changes permanently; ROLLBACK undoes changes made since the last commit or savepoint.
Q. DDL vs DML vs DCL?: → DDL defines structure (CREATE, ALTER, DROP); DML changes data (INSERT, UPDATE, DELETE); DCL controls access (GRANT, REVOKE).
Q. What does NOT NULL do?: → It prevents a column from storing NULL; inserting a row without that value is rejected.
Q. Difference between WHERE and HAVING?: → WHERE filters rows before grouping; HAVING filters groups after GROUP BY and can use aggregates like COUNT or AVG.

BCS403 practical component Programs 4-6: row level triggers on CUSTOMERS, explicit cursor on Employee, parameterized cursor to merge N_RollCall into O_RollCall

Q. What is a row level trigger?: → A trigger with FOR EACH ROW that fires once for every affected row and can use :OLD and :NEW values.
Q. Steps to use an explicit cursor?: → DECLARE the cursor, OPEN it, FETCH rows in a loop until %NOTFOUND, then CLOSE it.
Q. What is a parameterized cursor?: → A cursor that takes arguments when opened, so the same query can be reused with different values.

BCS403 practical component Program 7: Install MongoDB and perform CRUD operations

Q. What is a document and a collection in MongoDB?: → A document is a JSON-like (BSON) record of key-value pairs; a collection is a group of documents, like a table.
Q. Name the MongoDB CRUD commands.: → insertOne/insertMany, find, updateOne/updateMany, deleteOne/deleteMany; drop() removes a whole collection.
Q. State the CAP theorem.: → A distributed system can guarantee only two of Consistency, Availability and Partition tolerance at the same time.