LESSON PLAN

NAME OF SUBJECT INCHARGE:

NAME OF SUBJECT: DATABASE MANAGEMENT SYSTEMS (CS1403)
DEPARTMENT: COMPUTER SCIENCE AND ENGINEERING
SEMESTER (SECTION):
TOTAL NO. OF UNITS: 02
TOTAL NO. OF TOPICS: 08
HOURS ALLOTED PER WEEK: 03
MINIMUM HOURS ALLOTED FOR SEMESTER: 40
CREDITS: 03
SCHEDULE OF CLASSES

Sl . No. Day Period/Time

1.
2.
3.
4.

TOTAL WORKING DAYS:

TOTAL WORKING HOURS:

Subject In-charge Subject Coordinator HOD

Department of Computer Science and Engineering Page 1

 INTERNAL EXAMINATION DETAILS

Sl. No. Examination Date Remarks

1. Quiz 1
2. Sessional 1
3. Quiz 2
4. Sessional 2
5. Resessional (if any)

MID-TERM RESULT ANALYSIS

Examination Total Number of Students Total no. Remarks

Sl. Marks Marks Marks Marks Marks Marks of
No obtained obtained obtained obtained obtained obtained absentees
(5) (4 to 4.9) (3 to 3.9) (2 to 2.9) (1 to 1.9) (0 to 0.9)
1. Quiz 1
2. Quiz 2

Total Number of Students Total no. Remarks

Sl. Examination Marks >45 38<Marks <45 30<Marks <37 18<Marks <30 Marks<18 of
No (90 % and above) (75%-89%) (60%-74%) (35%-59%) (Below 35%) absentees
1. Sessional 1
2. Sessional 2

Highest Marks obtained in SESSIONAL I in this Section

Highest Marks obtained in SESSIONAL I in overall Section:

Highest Marks obtained in SESSIONAL II in this Section

Highest Marks obtained in SESSIONAL II in overall Section:

Subject In-charge Subject Coordinator HOD/CSE

Department of Computer Science and Engineering Page 2

 CLASS CONDUCT DETAILS:
Sl. No. Description Remarks
1 Total Hours allotted for the semester
2 Total Hours Conducted
4 Total Number of students
5 Total number of eligible students
First Sessional :
Pass% Second Sessional:
6
End Semester:
7 Average marks
8 Observation

Subject-Incharge HOD/CSE

Department of Computer Science and Engineering Page 3

 PROGRAM OUTCOMES
PO 1 Engineering knowledge: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
PO 2 Problem analysis: Identify, formulate, review research literature, and analyze complex engineering problems
reaching substantiated conclusions using first principles of mathematics, natural sciences, and engineering sciences.
PO 3 Design/development of solutions: Design solutions for complex engineering problems and design system
components or processes that meet the specified needs with appropriate consideration for the public health and safety,
and the cultural, societal, and environmental considerations.
PO 4 Conduct investigations of complex problems: Use research-based knowledge and research methods including
design of experiments, analysis and interpretation of data, and synthesis of the information to provide valid
conclusions.
PO 5 Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools
including prediction and modeling to complex engineering activities with an understanding of the limitations.
PO 6 The engineer and society: Apply reasoning informed by the contextual knowledge to assess societal, health, safety,
legal and cultural issues and the consequent responsibilities relevant to the professional engineering practice.
PO 7 Environment and sustainability: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable development.
PO 8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering
practice.
PO 9 Individual and team work: Function effectively as an individual, and as a member or leader in diverse teams, and in
multidisciplinary settings.
PO 10 Communication: Communicate effectively on complex engineering activities with the engineering community and
with society at large, such as, being able to comprehend and write effective reports and design documentation, make
effective presentations, and give and receive clear instructions.
PO 11 Project management and finance: Demonstrate knowledge and understanding of the engineering and management
principles and apply these to one’s own work, as a member and leader in a team, to manage projects and in
multidisciplinary environments.
PO 12 Life-long learning: Recognize the need for, and have the preparation and ability to engage in independent and life-
long learning in the broadest context of technological change.

Subject In-Charge HOD/CSE

Department of Computer Science and Engineering Page 4

 PROGRAM SPECIFIC OUTCOMES (PSO)

PSO1 Students to have knowledge and expertise in at least one procedural and one object oriented programming language
and should be able to analyze and compare algorithms.
PSO2 Students must have the ability to visualize and solve problems using appropriate structures and constraints adhering
to existing Software Engineering standards.
PSO3 Students must be able to design and implement database solutions using current technologies.
PSO4 Students should be able to understand, troubleshoot and design computer networks, including distributed networks
and wireless networks.
PSO5 Students should be aware of the design principles of Operating Systems specializing on at least one popular
Operating System and System Programs. Students should have working knowledge on Advanced Computing
techniques for Machine Learning and Computer Intelligence.
PSO6 Students will be able to keep pace with the technological advancement through exposure to recent and emerging
trends of Computer Science ranging from Big Data, Cloud Computing, Data Analytics, Social networking, Mobile
Robotics, Artificial Intelligence, Internet of Things(IoT), Augmented Reality etc.

COURSE OUTCOME OF CS1302 (DATABASE MANAGEMENT SYSTEMS)

On successful completion of this course, students will be able to
CO1 Describe fundamental elements of a relational database management system
CO2 Design entity-relationship diagrams to represent simple database application scenarios
CO3 Explain the basic concepts of relational data model, Entity-relationship model, Relational database design,
relational algebra and database language SQL\
CO4 Map entity-relationship diagrams into relational schema, populate a relational database and formulate SQL queries on
the data

Subject In-Charge HOD/CSE

Department of Computer Science and Engineering Page 5

 SIKKIM MANIPAL INSTITUTE OF TECHNOLOGY
EVEN SEMESTER, 2019
LESSON PLAN

Subject Code : CS 1403

Subject Name : DATABASE MANAGEMENT SYSTEMS
Teacher in-charge : T.K KOIRALA/B.ROY/ S. BHATTACHARYA

1. Objective:
To provide an introduction of DBMS and their use, be familiar with the basic DBMS architecture, components, and interfaces, have experience
using at least one modern Database Management System.
2. Scope:
This course assumes familiarity with basic program structure. The course includes all types of database models and its implementations.

3. Text Books:
a) Elmasri and Navathe: “Fundamentals of Database Systems” Addison Wesley, 5th Edition [T1].
b) Silberschatz, Korth, Sudarshan, “Database System Concepts” McGraw-Hill, 4th Edition [T2]
4. Reference Books:
a) Thomas Connolly, Carolyn Begg, “Database Systems – A Practical Approach to Design, Implementation and Management”,
Pearson Education.
b) Jefrey D. Ullman, Jenifer Widom, “A First Course in Database Systems”, Pearson Education.
c) Bipin C Desai, “An Introduction to Database Systems”, Galgotia.
d) Atul Kahate, “Introduction to Database Management Systems”, Pearson.
e) Ian Robinson, Jim Webber, Emil Eifrem,”Graph Databases”,O'Reilly Media.
f) Gaurav Vaish, ”Getting started with NoSQL”, Packt.

5. Examination rules:
1) Questions to be set having equal weightage/marks covering the entire syllabus: EIGHT (4 questions each from UNIT I and UNIT II)
2) Questions to be answered: FIVE (5) selecting atleast TWO from each unit.

Department of Computer Science and Engineering Page 6

 6. LECTURE MODULES:
SL. No. Module Learning Objectives Program Program
Outcomes(PO) Specific
Outcomes(PSO
)/ Course
Outcomes(CO)
DBMS: Characteristics, Advantages, Architecture. Database
concept and architecture, Data models, Instances and schema,
PO-2, 3 PSO-3
INTRODUCTION Database languages, Database manager, Database
1 CO- 1
administrator, Database users, Concept of centralized database
management and distributed database system.
Entity sets, attributes types and keys, Entity Relationship
(ER) diagram, Type role and structural constraints,
Enhanced entity-relationship (EER), Object modelling, PSO-3
PO-2, 3
2 DATA MODELLING Specialization and generalization, Modelling of union types, CO- 1
Data models: Definition, Purpose and Types, Hierarchical
models, Network model, Relational model, Relational-
algebra operations.
Database design process, Relational database design,
Relation schema, Functional dependencies, minimal covers,
PO-1, 2 PSO-3
DATABASE DESIGN Normal forms, Multivalued dependencies, Converting EER
3 CO- 1, 2
diagrams to relations, Effect of de-normalization on database
performance.
File organizations, primary, secondary index structures,
DATA STORAGE AND PO-2, 3 PSO-1, 3
various index structures - hash-based, dynamic hashing
4 INDEXES CO- 1, 3
techniques, multi-level indexes, B+ trees.
Query-by-example (QBE), Introduction to SQL, Use of some
special data types, Overview of SQL 92, Basic queries in SQL,
CO- 1, 3
DATABASE QUERY Advanced queries in SQL, Functions in SQL, Basic data PO-1, 2
5 PSO-1, 3
LANGUAGES retrieval, Aggregation, Categorization, Updates in SQL,
Embedded SQL and 4GLs, Procedural extension to SQL:
PL/SQL.

Department of Computer Science and Engineering Page 7

SL. No. Module Learning Objectives Program Program
Outcomes(PO) Specific
Outcomes(PSO
)/ Course
Outcomes(CO)
Desirable properties of transactions, Implementation of
atomicity and durability, Reconsistent model, Read only and
TRANSACTION PO-1, 2 PSO- 3
6 write only model, Concurrent executions, Schedules and
PROCESSING CO- 1, 3, 4
recoverability, Serializability of schedules, Concurrency
control, Precedence graph.
Overview of concurrency control, Locking techniques,
7 Lock based protocols, Time stamp based protocols, Commit
CONCURRENCY
protocols, Granularity of data items, Time stamp ordering multi
CONTROL AND BACKUP PO- 2, 3 PSO-3
version concurrency control, Deadlock handling, Recovery
& RECOVERY CO- 4
mechanisms, Database recovery techniques based on
MECHANISMS
immediate and deferred update, Concepts of database security
mechanisms, Case study of Distributed Database Systems.
Overview of graph database, Structure and advantages of graph
PSO-3
8 GRAPH DATABASE database, high level view of graph space, Property graph model. PO-1, 2
CO- 4
An overview of NoSQL, Characteristics of NoSQL,
Advantages and challenges of NoSQL, NoSQL storage PO-3 PSO-3
9 NOSQL types, Case study of MongoDB. CO- 4

Subject In-Charge HOD/CSE

Department of Computer Science and Engineering Page 8

 SYLLABUS PLANNING AND COURSE COVERAGE REPORT

Date of Commencement of Semester:

Last date for completing the syllabus:
Total No. of Remedial classes held:
Any extra classes required to complete the syllabus (Yes/ No):

Module/ Lecture Topics/Experiments/Program Alloted Date / Covered Reason CO Learning Signature Signature Signature
Chapter No. Planned hrs. Week (Yes/No) if not Number Resources of of of
No. No. covered Covered used Teacher CR DAC /
HOD
1 Introduction
Characteristics of database
Approach
Advantage of using DBMS ,Actor
on the scene: Database Designer,
2
Database administrator
1
Data models, Instances and
3 schema, Three Schema
Architecture
Data Independence
4
Database languages
Entity sets, attributes types and
5
keys
2 Entity Relationship (ER)
6
diagram

Relationship Degree, Role names,

7
Recursive Relationships

Department of Computer Science and Engineering Page 9

Module/ Lecture Topics/Experiments/Program Alloted Date / Covered Reason CO Learning Signature Signature Signature
Chapter No. Planned hrs. Week (Yes/No) if not Number Resources of of of
No. No. covered Covered used Teacher CR DAC /
HOD
8 Constraints on relationship types:
Cardinality Ratio, Participation
constraints.
Weak Entity
9 Domains, Attributes ,Tuples and
Relations
a) Relational Constraints: Domain
Constraints, Key Constraints,
Entity Integrity and Referential
Integrity and Foreign Keys
3 10 Update operation and Dealing with
constraints violations: Insert,
delete, update operations
11 Relational Algebra operations:
Select, Project, Rename.
12 Set theoretic operations: Union,
Intersection, Set Difference
13
Aggregate functions and Grouping
The join operation
14 Examples of Queries in Relational
Algebra.
15 Functional Dependencies
Inference rules for functional
Dependencies
16 Introduction to Normalization
First Normal form
17 Second Normal form
Third Normal form
Boyce-Codd Normal form

Department of Computer Science and Engineering Page 10

Module/ Lecture Topics/Experiments/Program Alloted Date / Covered Reason CO Learning Signature Signature Signature
Chapter No. Planned hrs. Week (Yes/No) if not Number Resources of of of
No. No. covered Covered used Teacher CR DAC /
HOD
Examples on decomposition of
3 18 relations on various Normal forms.

Decomposition
Two desirable properties of
19 decomposition: Dependency
preservation property, Lossless
join property
Problems on testing of lossless
20
join.
Closure set of attribute
21 Equivalence of two set of FD
Minimal Cover
22 Problems on Equivalence and
minimal cover.
File organizations, primary,
4 23 secondary index structures
Dynamic hashing techniques,
24 multi-level indexes, B+ trees
Introduction to SQL
Use of some special data types
25
Basic queries in SQL: DDL and
5 DML commands
Advanced queries in SQL: Select-
From-Where, Substring
26
Comparison, Arithmetic operators
and ordering,
27 Aggregate function ,grouping and
nested queries

Department of Computer Science and Engineering Page 11

Module/ Lecture Topics/Experiments/Program Alloted Date / Covered Reason CO Learning Signature Signature Signature
Chapter No. Planned hrs. Week (Yes/No) if not Number Resources of of of
No. No. covered Covered used Teacher CR DAC /
HOD
6 28 Desirable properties of
transactions, States of transaction.

29 Lost update problem,

Dirty read problem,
Incorrect summery problem

30 Serial Schedule, Serializability of

schedules, Conflict Serializability,
View Serializability
31 Recoverability, Cascadeless
schedule cascading rollback
Concurrency control, Precedence
graph.
32 Overview of concurrency
control, Locking techniques:
7 Binary locks and Shared locks
33 2 Phase Locking protocols
Deadlock handling, Deadlock
prevention: wait-die, wait-wound
34 Recovery mechanisms, Database
recovery techniques based on
immediate and deferred update,
Concepts of database security
mechanisms
35 Graph database, Structure and
8 advantages of graph database.
36 High level view of graph space.
Property graph model.

Department of Computer Science and Engineering Page 12

Module/ Lecture Topics/Experiments/Program Alloted Date / Covered Reason CO Learning Signature Signature Signature
Chapter No. Planned hrs. Week (Yes/No) if not Number Resources of of of
No. No. covered Covered used Teacher CR DAC /
HOD
9 Overview of NoSQL,
37 Characteristics of NoSQL

Advantages and challenges of

38 NoSQL, NoSQL storage types,
Case study of MongoDB
39 Revision Class

40 Revision Class

Department of Computer Science and Engineering Page 13

 REMEDIAL CLASSES

DATE NO OF STUDENTS TOPICS COVERED REMARKS

ATTENDED

Detailed discussions (if any):

Department of Computer Science and Engineering Page 14

 STUDENT ATTENDANCE REGISTER

Roll Name
. no
1

10

11

12

13

Department of Computer Science and Engineering Page 15

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

Department of Computer Science and Engineering Page 16

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

Department of Computer Science and Engineering Page 17

46

46

48

49

50

51

52

53

54

55

56

57

58

59

60

61

Department of Computer Science and Engineering Page 18

62

62

64

65

66

67

68

69

70

71

72

Department of Computer Science and Engineering Page 19