0% found this document useful (0 votes)
4 views3 pages

Database Course Objectives and Topics

The document outlines a course on Databases, detailing unit objectives, topics, and estimated difficulty and marks. It covers fundamental concepts such as database design, the E-R model, normalization, and transaction management. Additionally, it includes a set of questions with answers to assess understanding of the material.

Uploaded by

24u11a05b9
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
4 views3 pages

Database Course Objectives and Topics

The document outlines a course on Databases, detailing unit objectives, topics, and estimated difficulty and marks. It covers fundamental concepts such as database design, the E-R model, normalization, and transaction management. Additionally, it includes a set of questions with answers to assess understanding of the material.

Uploaded by

24u11a05b9
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Task 1:

Unit Name,Topic,Difficulty (Estimated),Suggested Marks (Estimated) COURSE


OBJECTIVES,To familiarize students with the knowledge of Databases, their design,
implementation, and applications.,Low,1-2 UNIT-WISE COURSE OBJECTIVES,COB1: To
introduce the concepts of database.,Low,1-2 UNIT-WISE COURSE OBJECTIVES,COB2: To
discuss Entity-Relation approach of data modeling.,Medium,1-2 UNIT-WISE COURSE
OBJECTIVES,COB3: To familiarize students with data normalization.,Medium,1-2 UNIT-WISE
COURSE OBJECTIVES,COB4: To discuss Transaction Management concepts.,High,1-2 UNIT
I: Introduction to Databases (15 Hrs.),Database System Applications, Purpose of Database
Systems, View of Data-Data Abstraction, Instances and Schemas, Data Models-Relational, E-R,
Object-Based, Application Architectures.,Low,10 UNIT I: Introduction to Databases (15
Hrs.),Database Users and Administrators, Database System Structure, Introduction to Relational
Model, Structure of Relational Databases, Database Schema, Keys, Relational Query
Languages-Relational Operations.,Medium,15 UNIT II: Database Design and the E-R Model (15
Hrs.),Overview of the Design Process, Design Issues, Design Alternatives, The Entity-
Relationship Model-Basic Structure, Mapping Cardinality, Keys, Entity-Relationship Diagram-
Basic Structure.,Medium,10 UNIT II: Database Design and the E-R Model (15 Hrs.),Entity Sets
with simple attributes, Representation of Strong Entity Sets with complex attributes, Reduction to
Relational Schemas.,Medium,15 UNIT III: Extended E-R Model and Normalization (15
Hrs.),Extended E-R Features-Specialization, Generalization, Attribute Inheritance, Constraint,
Design Alternatives, Aggregation.,High,10 UNIT III: Extended E-R Model and Normalization (15
Hrs.),Functional Dependencies, BCNF, Third Normal Form, Third Normal Form, Database
Design Process.,High,15 UNIT IV: Security, Transaction Management and Recovery (15
Hrs.),Database Security-Access control, Discretionary Access (DAC), Mandatory Access
Control (MAC), RAIDs.,Medium,10 UNIT IV: Security, Transaction Management and Recovery
(15 Hrs.),Need for Concurrency Control, Serializability, Recovery System-Storage Structure,
Recovery and Atomicity.,High,15 Prescribed Books,Abraham Silberschatz: Database System
Concepts; Thomas M Connolly: Database Systems.,Low,5
Task 2:

Topic,Unit,Dependency (Prerequisites),Estimated Importance Introduction to Databases


(Purpose, Views, Models),Unit I,None (Foundation),High Relational Model Structure and
Operations,Unit I,Introduction to Databases,High Database Design and the E-R Model (Basic
Structure, Mapping),Unit II,Unit I Concepts,High Entity Sets and Reduction to Relational
Schemas,Unit II,E-R Model Basic Structure,High Extended E-R Features (Specialization,
Aggregation),Unit III,Unit II Concepts (E-R Model),Medium Functional Dependencies &
Normalization (BCNF, 3NF),Unit III,Relational Model (Unit I),Very High Database Security
(Access control, RAIDs),Unit IV,Basic Database Concepts,Medium Concurrency Control and
Serializability,Unit IV,Relational Operations (Unit I),High Recovery System (Storage,
Atomicity),Unit IV,Transaction Concepts (Implied),High
Task 3:

Question No.,Marks,Difficulty,Unit/Topic,Question,Answer/Rationale 1,1,Low,Unit I: In


troduction,"What is the primary goal of Data Abstraction in a Database Management System
(DBMS)?","The primary goal of data abstraction is to hide complexity from the users and present
only the necessary data views. It allows users to interact with the system at a conceptual or
external level without knowing the internal implementation details." 2,1,Low,Unit III:
Normalization,"State the main objective of Boyce-Codd Normal Form (BCNF).","The main
objective of BCNF is to address anomalies that can arise when a relation has overlapping
candidate keys, ensuring that every determinant is a candidate key. It is a stricter form of 3NF."
3,5,Medium,Unit II: E-R Model,"Explain the key difference between a Strong Entity Set and a
Weak Entity Set, providing a suitable example for each in a university environment.","A Strong
Entity Set has a primary key of its own (e.g., STUDENT with ID). A Weak Entity Set depends on
the existence of a strong entity set and derives its primary key partly or entirely from the primary
key of the strong entity (e.g., DEPENDENT of an EMPLOYEE)." 4,5,Medium,Unit IV:
Transactions,"Briefly describe the ACID properties of a database transaction, and why they are
essential for maintaining database integrity.","ACID stands for Atomicity, Consistency, Isolation,
and Durability. These properties ensure that database transactions are processed reliably.
Atomicity guarantees all or nothing; Consistency ensures a valid state; Isolation guarantees
concurrent transactions execute independently; and Durability guarantees committed changes
are permanent." 5,10,High,Unit III: Normalization,"Functional Dependencies (FDs): Explain the
concept of Functional Dependencies. Given a relation R(A, B, C, D) and the set of FDs F = {A !’
B, B !’ C, C !’ D}, find the candidate key(s) for R.","A Functional Dependency X !’ Y means the
value of X determines the value of Y. To find candidate keys, start with the attributes not on the
right side of any FD (A). Closure of {A} is {A}+ = {A, B, C, D}. Since the closure contains all
attributes, A is the only candidate key." 6,10,High,Unit II: E-R Model,"Illustrate the process of
converting a given Entity-Relationship (E-R) Diagram into a set of Relational Schemas (tables).
Include the rules for converting strong entities, weak entities, and 1:N relationship types.","The
conversion process involves mapping each component of the E-R model to a relational table
structure. Strong entities become tables with their primary keys. Weak entities are mapped to a
table whose primary key is a combination of its partial key and the primary key of its identifying
strong entity (foreign key). 1:N relationships are handled by placing the primary key of the '1' side
as a foreign key into the table for the 'N' side."

You might also like