Vidyarthi AIStudent Career Compass

PCC-CS601MAKAUT · Sem 6

Database Management Systems

MAKAUT B.Tech CSE AICTE model curriculum (applicable from 2020-21 session) · 100 marks: 70 end-sem + 30 internal (mid-sem 15, assignment/quiz 10, attendance 5). End-sem paper: 3 hours, Group A: 10 very short/MCQ x 1 = 10 (answer 10 of 12), Group B: any 3 short answers x 5 = 15, Group C: any 3 long answers x 15 = 45 (each usually split into 2-3 parts). Lab PCC-CS691 (2 credits) is marked separately out of 100 (40 internal + 60 external).

Official syllabus

Revised 0 of 109 high-repeat questions

One-Night Pass Pack

Entities: PATIENT (Pid, name, age), DOCTOR (Did, name, speciality), WARD (Wno, type), TEST (Tid, name), BILL as weak entity (bill_no, amount) owned by PATIENT. Relationships: TREATS (Doctor M : N Patient), ADMITTED_IN (Patient N : 1 Ward), UNDERGOES (Patient M : N Test, attribute date), HAS_BILL (identifying, 1 : N). Weak entity: has no key of its own; it is identified by owner key + partial key (discriminator), drawn as a double rectangle with an identifying double diamond and total participation. Strong entity has its own primary key, e.g. PATIENT; weak entity example: BILL or DEPENDENT.
Full-marks tip: Spend most of the 15 marks on a neat, labelled diagram with cardinality and keys underlined; add 3-4 lines converting it into tables. Asked in 2015-16 (hospital ER) and weak vs strong entity in 2015-16 and 2023.

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

Unit-wise syllabus

U1Database System Architecture and Data Models

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

Data abstraction, data independence, DDL and DMLThree-schema architecture, DBA role, data dictionary and metadataData models: ER, network, relational and object-orientedER model: entity sets, attributes, weak entities, cardinality, ER to table conversionIntegrity constraints and data manipulation operations

U2Relational Query Languages, Relational Database Design and Query Processing

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

Relational algebra, tuple and domain relational calculusSQL3 and DDL/DML in MySQL, Oracle, DB2, SQL Server; joins, subqueries, aggregatesFunctional dependencies, Armstrong's axioms, attribute closure, minimal cover, candidate keysNormal forms 1NF, 2NF, 3NF, BCNF (and 4NF, join dependency); dependency preservation, lossless designQuery processing and optimization: evaluation of relational algebra expressions, join strategies, query optimization algorithms

U3Storage Strategies

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

File organization, blocking factorIndices: primary, secondary, clustering, dense and sparseB-trees and B+ trees: insertion and deletionStatic and dynamic hashing

U4Transaction Processing

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

ACID properties, transaction statesSerializability of scheduling, conflict and view serializabilityLocking and timestamp based schedulers, two-phase lockingMulti-version and optimistic concurrency control schemes, deadlock handlingDatabase recovery: log-based recovery, checkpoints, shadow paging

U5Database Security

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

Authentication, authorization and access controlDAC, MAC and RBAC modelsIntrusion detection, SQL injection

U6Advanced Topics

Weightage: Not officially published (Group B and C questions are not tied to modules; syllabus gives contact hours only)

Object-oriented and object-relational databasesLogical databases, web databasesDistributed databasesData warehousing and data mining

Curated video lectures

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

DBMS complete playlist: ER model, keys, normalization, SQL, transactions, concurrency, indexing

Gate Smashers · Playlist · 140 videos · Hindi

DBMS in Hindi complete playlist (all units)

KnowledgeGATE by Sanchit Sir · Playlist · 114 videos · Hindi

Complete DBMS in one shot for semester exams (last-day revision)

KnowledgeGATE by Sanchit Sir · ~5 hours · Hindi

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

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

DBMS lectures: data models, ER diagrams, keys and relational concepts

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

Exam Guide Radar

Standard textbook

Silberschatz, Korth and Sudarshan, Database System Concepts, 6th Edition (McGraw-Hill); first text in the MAKAUT PCC-CS601 syllabus (Elmasri and Navathe, and R. P. Mahapatra, Khanna, are also listed)

Exam guide students buy

Not verified: Matrix series or Ray & Martin DBMS guides for MAKAUT could not be confirmed online; MAKAUT students commonly use 'Organizer' style previous-year solved question books for the subject

Names students give for MAKAUT exam prep. We could not confirm a current edition for every paper, so match the paper code (e.g. PCC-CS601) on the cover before buying.

Local market tip

Guide availability for PCC-CS601 could not be verified online, so check College Street (Kolkata) shops for a solved-paper book that lists the code PCC-CS601 and includes 2023-24 papers, and avoid editions made for the old CS-601 syllabus.

Lab Viva Survival

PCC-CS691: Creating tables with data types, constraints and indexes; INSERT, UPDATE, DELETE, ALTER, TRUNCATE, DROP

Q. Difference between primary key and unique key?: → Primary key cannot be NULL and there is only one per table; a unique key allows a NULL (in most DBMSs) and a table can have many.
Q. What is a foreign key?: → A column that refers to the primary key of another table to enforce referential integrity.
Q. DDL vs DML vs DCL?: → DDL defines structure (CREATE, ALTER, DROP); DML changes data (INSERT, UPDATE, DELETE); DCL controls access (GRANT, REVOKE).
Q. Why create an index?: → To speed up search on a column; it costs extra space and slows inserts and updates.

PCC-CS691: Retrieving data with SELECT, WHERE, IN, BETWEEN, LIKE, ORDER BY, GROUP BY, HAVING, aggregates, joins and subqueries

Q. Inner join vs outer join?: → Inner join returns only matching rows; left/right/full outer join also returns unmatched rows from one or both tables with NULLs.
Q. What does LIKE 'A%' and '_b%' match?: → 'A%' matches values starting with A; '_b%' matches values whose second character is b.
Q. What is a correlated subquery?: → A subquery that uses a column of the outer query, so it runs once for each outer row.

PCC-CS691: Views, column aliases, creating users, GRANT and REVOKE

Q. What is a view?: → A virtual table defined by a stored query; it gives security and simplicity and stores no data itself (unless materialized).
Q. Can we update a view?: → Only simple views on one table without aggregates, GROUP BY or DISTINCT are usually updatable.
Q. What do GRANT and REVOKE do?: → GRANT gives privileges like SELECT or INSERT to a user or role; REVOKE takes them back.