MANIPAL INSTITUTE OF TECHNOLOGY

(A constituent college of Manipal University, Manipal)

Manipal Karnataka 576 104

COURSE PLAN
Department

: Computer Science & Engg

Subject

: CSE 2204: Database Systems

Semester & branch

: IV Sem. B.Tech.(CS&E)

Name of the faculty

: Dr. Dinesh Acharya U, Mr. Ahmed

Shafeeq, Ms. Archana, Mr. Ganesh Babu

No of contact hours/week

: 03

ASSESSMENT PLAN:
1. In Semester Assessments - 50 %
Written tests : Two tests of 15 marks each(Max Marks: 30)
Surprise quizzes : Five quizzes of 4 marks each(Max Marks: 20)
2. End Semester Examination - 50%
Written examination of 3 hours duration (Max. Marks: 50 )
Assignment portion
Assignment no.

Topics

L1 L6

L7 L12

L13 L18

L19 L24

L25 L30
Test portion

Test no.

Topics

L1 L14

L15 L28
Course Outcomes

(Page 1 of 4)
MIT/GEN/F-05/R0

At the end of the program the student should possess the

Ability to design databases using E-R and Relational

models
Ability to construct simple and moderately advanced
database queries using Structured Query Language (SQL)
Ability to analyze and apply the normalization technique
to decompose given relational schema into effective
schemas
Ability to explain the method of indexing , hashing and
organization of files..

Lecture no.
1
2
3
4
5
6
7
8
9

Topic to be covered
Database-System Applications, Purpose of Database Systems, View
of Data, Database Languages, Relational Databases,
Structure of Relational Databases, Database Schemas, Keys,
SQL Data Definition, SQL Data Types and Schemas, Integrity
Constraints
Basic Structure of SQL Queries
Additional Basic Operations
Set Operations, Null Values, Aggregate Functions
Nested Sub queries
Modification of the Database
Joined Expressions
Views, Transactions

10

Database Design, Overview of the Design Process, The EntityRelationship Model, Constraints

11

Removing Redundant Attributes in Entity Sets, Entity-Relationship

Diagrams,

12
13

Reduction to Relational Schemas

Entity-Relationship Design Issues, Extended E-R Features

(Page 2 of 4)
MIT/GEN/F-05/R0

14
15
16
17
18

Data Storage and Querying, Transaction Management,

Database Architecture, Database Users and Administrators
Relational Query Languages, Relational Algebra: Fundamental
Operations
Relational Algebra: Additional Operations
Relational Algebra: Extended Operations

19

Features of Good Relational Designs, Atomic Domains and First

Normal Form

20

Decomposition using Functional Dependency: Keys and Functional

Dependencies, Boyce-Codd Normal Form

21

Decomposition using Functional Dependency:

Dependency Preservation, Third Normal Form

22
23
24
25
26
27
28
29
30
31
32
33

BCNF

and

Functional Dependency Theory: Closure of a set of Functional

Dependencies; Closure of Attributes; Canonical Cover
Functional
Dependency
Theory:
Lossless
Decomposition;
Dependency Preservation
Algorithms for Decomposition: BCNF and 3NF Decomposition
Decomposition using Multivalued Dependences
File Organization , Organization of Records in Files
Basic Concepts, Ordered Indices
B+ -Tree Index Files
B-Tree Extensions, Multiple-Key Access
Static Hashing
Dynamic Hashing, Comparison of Ordered Indexing and Hashing
Transaction Management, Transaction Concept, A
Transaction model, Transaction Atomicity and Durability
Transaction Isolation, Serializability

simple

(Page 3 of 4)
MIT/GEN/F-05/R0

34
35
36

Transaction Isolation and Atomicity, Transaction Isolation Levels

Recovery and Atomicity
Recovery algorithm.

Reference:
1. Silberschatz, Korth, Sudarshan, Database System Concepts, 6th Edition,
McGrawHill, New York, 2011.
2. Ramez Elmasri and Shamkant Navathe, Durvasula V L N Somayajulu, Shyam K
Gupta, Database Systems, Pearson Education, 2006.
3. Ivan Bayross, SQL, PL/SQL, 4th Edition, BPB Publications, USA, 2009.

Submitted by: Dr. Dinesh Acharya U

(Signature of the faculty)
Date: 9-01-2016
Approved by:
(Signature of HOD)
Date:

(Page 4 of 4)
MIT/GEN/F-05/R0