Scribd
Upload
112 views4 pages

CSE 2204 Database Systems Lesson Plan 2016

This document provides a course plan for the subject "Database Systems" taught in the 4th semester of the B.Tech Computer Science & Engineering program at Manipal Institute of Technology. It outlines the assessment plan, topics to be covered in each lecture, course outcomes, and references. The assessment plan consists of 2 in-semester written tests worth 30% and 5 surprise quizzes worth 20%, along with a 3-hour end semester exam worth 50%. The course aims to teach students to design databases, write SQL queries, normalize relational schemas, and explain database indexing and file organization.

Uploaded by

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

CSE 2204 Database Systems Lesson Plan 2016

This document provides a course plan for the subject "Database Systems" taught in the 4th semester of the B.Tech Computer Science & Engineering program at Manipal Institute of Technology. It outlines the assessment plan, topics to be covered in each lecture, course outcomes, and references. The assessment plan consists of 2 in-semester written tests worth 30% and 5 surprise quizzes worth 20%, along with a 3-hour end semester exam worth 50%. The course aims to teach students to design databases, write SQL queries, normalize relational schemas, and explain database indexing and file organization.

Uploaded by

srss
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 4

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
1 L1 – L6
2 L7 – L12
3 L13 – L18
4 L19 – L24
5 L25 – L30
Test portion
Test no. Topics
1 L1 – L14
2 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. Topic to be covered


Database-System Applications, Purpose of Database Systems, View
1
of Data, Database Languages, Relational Databases,
Structure of Relational Databases, Database Schemas, Keys,
2
SQL Data Definition, SQL Data Types and Schemas, Integrity
Constraints
Basic Structure of SQL Queries
3
Additional Basic Operations
4
Set Operations, Null Values, Aggregate Functions
5
Nested Sub queries
6
Modification of the Database
7
Joined Expressions
8
Views, Transactions
9
Database Design, Overview of the Design Process, The Entity-
10
Relationship Model, Constraints

Removing Redundant Attributes in Entity Sets, Entity-Relationship


11
Diagrams,

Reduction to Relational Schemas


12
Entity-Relationship Design Issues, Extended E-R Features
13

(Page 2 of 4)
MIT/GEN/F-05/R0
Data Storage and Querying, Transaction Management,
14
Database Architecture, Database Users and Administrators
15
Relational Query Languages, Relational Algebra: Fundamental
16
Operations
Relational Algebra: Additional Operations
17
Relational Algebra: Extended Operations
18
Features of Good Relational Designs, Atomic Domains and First
19
Normal Form

Decomposition using Functional Dependency: Keys and Functional


20
Dependencies, Boyce-Codd Normal Form

Decomposition using Functional Dependency: BCNF and


21
Dependency Preservation, Third Normal Form

Functional Dependency Theory: Closure of a set of Functional


22
Dependencies; Closure of Attributes; Canonical Cover
Functional Dependency Theory: Lossless Decomposition;
23
Dependency Preservation
Algorithms for Decomposition: BCNF and 3NF Decomposition
24
Decomposition using Multivalued Dependences
25
File Organization , Organization of Records in Files
26
Basic Concepts, Ordered Indices
27

B+ -Tree Index Files


28
B-Tree Extensions, Multiple-Key Access
29
Static Hashing
30
Dynamic Hashing, Comparison of Ordered Indexing and Hashing
31
Transaction Management, Transaction Concept, A simple
32
Transaction model, Transaction Atomicity and Durability
Transaction Isolation, Serializability
33

(Page 3 of 4)
MIT/GEN/F-05/R0
Transaction Isolation and Atomicity, Transaction Isolation Levels
34
Recovery and Atomicity
35
Recovery algorithm.
36

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

You might also like