K L UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING COURSE HANDOUT DOCUMENT Dated: 28-11-2011 : B.

Tech(Computer Science and Engineering) : II/IV : CS C207 : Data Base Management System
: 3-0-2 :Theory and Lab :60 : M.V.B.T.Santhi : M.V.B.T. Santhi,T.Vijaya Saradhi,T.Hema Latha,V.Sandeep

Program Name Year & Semester

Course No.

Course Title
Course Structure Course Detail Lecture Hours Course Coordinator Team of Instructors

I. PROGRAM DESCRIPTION:
The undergraduate computer science program offers students a comprehensive foundation that will permit them to adapt to new technologies and new ideas. The program spans a wide range, from its theoretical and algorithmic foundations to cutting-edge developments in communications systems, databases, robotics, intelligent systems, software engineering, and other exciting areas. The program provides students with a comprehensive background to take on varied categories of work. They are offered the necessary theories, principles and practices to design and implement software that permits them to take on challenging programming jobs. They have the opportunity to become well-equipped to devise new ways to use computers.

II. PROGRAM OBJECTIVES:

1. Prepare students to work more collaboratively and communicate more effectively in their professional work environment 2. Provide students with a broad and deep knowledge of applied and theoretical areas of computer science 3. Provide students with opportunities to apply their knowledge and skills to the solution of real-life problems 4. Increase awareness of ethical issues and the global impacts of computing technologies on society. 5. Able to design and implement software systems which are state of the art solutions to a variety of computing problems.

III. PROGRAM OUTCOMES:

a. The student will demonstrate an ability to work in teams to accomplish common Goal. b. The student will demonstrate an ability to analyze, design, verify, validate, implement, apply, and maintain software systems c. The ability to appropriately apply discrete mathematics, probability and statistics, and relevant topics in computer science and supporting disciplines to complex software systems d. The ability to work in one or more significant application domains e. The ability to manage the development of software systems f. The student will demonstrate basic theoretical concepts. g. The student will demonstrate an ability to use tools, which are frequently used in the Industry. h. The student will demonstrate an ability to apply mathematics in various computing and data processing applications. i. The student will develop applications from inception to implementation. j. The student will develop confidence in self-learning and life long learning. The student will demonstrate an ability to achieve campus placement. k. The student will demonstrate an ability to move to graduate programs either in India or abroad. The student will demonstrate Knowledge of professional and ethical responsibilities. To check the Teachers intent (at the beginning of the Programme) and the students performance at the end of the Programme, Programme Objectives are mapped with Programme Outcomes as given under: Mapping of the Program Objectives with Program Outcomes. Program Outcomes a 1 2 Program Objectives 3 4 5 b c d e f g h i J k

IV. COURSE DESCRIPTION:

This course will give the basic knowledge of Database systems along with architecture of relational database systems, design of DBMS, and exposure to SQL statements and the Normalization concept. The student is exposed to writing SQL statements for queries using various databases and concepts of transaction processing, query Optimization.

V. COURSE OBJECTIVES:
The Database Course gives in depth knowledge of database fundamentals including database architecture, database types, relational database concepts, non procedural programming languages like SQL and other concepts related to applications of relational databases. The first section briefs about data base concepts, architecture of DBMS Modeling Databases, The second unit describes the extended ER Modeling, Record Structure and File Organization and other technology for storage purpose. Upon completion of this course, students will be able to: Design a conceptual database using ER model Construct a relational database using SQL modify the data in the databases Apply the normalization techniques to get quality databases write queries in relational algebra and relational calculus Apply concurrency control techniques for multi user transaction processing

VI. COURSE OUTCOMES:

At the end of the course the student will be able to : 1. Develop programs using PL/SQL. 2. Construct a relational database using SQL 3. Apply the normalization techniques to get quality databases 4. Apply concurrency control techniques for multi user transaction processing
Mapping of Course Objectives with Programme Outcomes

Program Outcomes a 1 2 Course Objectives 3 4 b c d e f G h i j k

Text Book: 1. Elmasri & Navathe, Fundamentals of Data base Systems, 4th edition, Pearson Education REFERENCE BOOKS 1. Database System Concepts , Avi Silberschatz ,Henry F. Korth ,S. Sudarshan, Fifth Edition, Tata McGraw-Hill 2. Database management systems by Raghu Ramakrishnan, Johannes Gehrke 3rd edition, Tata McGraw Hill VII. SYLLABUS: Unit I Database fundamentals, DBMS characteristics & Advantages, Database environment, Data base users, Database architecture, data independence, Languages, tools and interfaces in DBMS. DBMS Types. Unit- II Data modeling ER Model, Notation used in ER diagram, Constraints, types, relationships in ER Model and other considerations in designing ER diagram. Enhanced ER Data Model, EER Diagram, Specialization and Generalization, Lattice, Union and Disjoint properties, Constraints and relationships, other issues in designing EER Diagram. Algorithms for ER to Relational mapping Unit III SQL: Data definition and other languages in SQL, Creating Tables, and Data types, Constraints, DML statements, Functions and writing SQL statements using nested sub queries, complex queries, joining relations. Embedded SQL - Writing Functions and procedures with PL/SQL. Relational Model, Relational Algebra, Operators in Relational Algebra. Unit IV Normalization: Guidelines for good database design, Normalization Normal Forms, First, Second, Third Normal Forms, BCNF (Boyce Codd Normal Form). Multi value and join dependencies, 4th and 5th Normal forms. Decomposition algorithms for normalization. File and storage structures: File storage, index structures, indexing and hashing (Basics) Query Processing: Issues in query processing, simple algorithms for insert, project, join and other operators. Unit V Transaction Processing: Transaction processing issues, Transaction states, problems during multiple transaction processing, ACID properties, System Log. Concurrency Control techniques: Binary Locks, Exclusive Locks, Lock based Techniques, Timestamp based techniques. Versioning in Locks, Multiversion Locking techniques.

VIII. SELF LEARNING TOPICS:

Unit I I II III IV IV IV IV V V Topic Database System Utilities Additional Implications of DBMS other issues in designing EER Diagram Complex Queries 4th and 5th Normal forms File storage Index structures Indexing and hashing (Basics) Versioning in Locks System Log Source Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe Fundamentals of Data base Systems -Navathe

IX. UNIT WISE RATIONALIZATION:

UNIT-I In this unit the student will learn the definition of DBMS, the differences between a DBMS and a normal file processing system, Three schema architecture,Data models and Types of DBMS. UNIT-II This unit introduces the concepts of a Entity relationship model,Constraints,Types, relationships in ER Model and other considerations in designing ER diagram. Enhanced ER Data Model, EER Diagram, Specialization and Generalization, Lattice, Union and Disjoint properties, Constraints and relationships, other issues in designing EER Diagram. Algorithms for ER to Relational mapping UNIT-III This unit introduces the concepts of a relational data model. The student learns about relational algebra and practices writing queries in relational algebra. The student will also learn about SQL which is useful for their practical class. UNIT-IV In this unit student learns about good database design guidelines,different normalization techniques based on functional dependencies, Query Processing and also simple algorithms for insert, project, join and other operators. UNIT-V This unit deals with the concepts of transaction, problems during multi transaction processing, different locking techniques and other concurrency control issues.

X. SESSION PLAN:
S.N o Un it Sess ion Learning objective Meth odolo gy Oral Introduction Database Characteristi cs SQL: Data definition and other languages in SQL Creating Tables, and Data types DBMS Advantages Introduction Demonstrate Comparison with files Demonstrate Data definition PPT Explanat ion Listens and observe Understand Faculty Approa ch Facilitat es Student approac h Listens& participat e Listens and observe Learning outcome

Content

Understand

PPT

Explanat ion

Understand

III

III

Enable Creation of Tables Demonstrate Comparison with files Demonstrate

PPT

Explanat ion

Listens and observe Listens and observe Listens and observe Listens and observe

Understand

PPT

Explanat ion

Understand and remember Understand and remember

Constraints 6 I 6

PPT Constraints DML statements Identify DML statements Demonstrate Functions and writing SQL statements using nested sub queries PPT

Explanat ion

III

Explanat ion

Understand

III

10

Functions and writing SQL statements using nested sub queries

PPT

Explanat ion

Listens and observe

Understand

Database environment

Demonstrate Comparison with files Identify

PPT

Explanat ion

Listens and observe Listens and observe

Understand and analyze

10

Data base users

PPT Database users

Explanat ion

Understand

joining relations 11 III 13

Demonstrate complex queries, joining relations PPT Explanat ion Listens and observe Understand and remember

12

III

14

Embedded SQL Writing Functions and procedures with PL/SQL Database architecture

Demonstrate Embedded SQL - Writing Functions and procedures with PL/SQL Identify Different Components in DBMS Demonstrate Data Independence Demonstrate Relational Model PPT Explanat ion Explanat ion Listens and observe Understand and remember

PPT

13

11

PPT

Explanat ion

Listens and observe Listens and observe Listens and observe Listens and observe Listens and observe Listens

Understand and remember Understand and remember

14

12

Data Independenc e, Languages Relational Model

PPT

Explanat ion

15

III

18

Understand

16

III

19

Relational Algebra

Demonstrate Relational Algebra Demonstrate Use of tools and Interfaces Identify

7

PPT

Explanat ion

Understand and remember Understand and analyze

17

15

Tools and Interfaces in DBMS DBMS Types

PPT

Explanat ion

18

16

PPT

Explanat

Understand

Different Types of Data Bases DBMS Types Identify Different Types of Data Bases Demonstrate Operators in Relational Algebra Demonstrate ER Model PPT PPT

ion

and observe

and analyze

19

17

PPT

Explanat ion

Listens and observe

Understand and analyze

20

III

20

Operators in Relational Algebra

Explanat ion

Listens and observe

Understand and remember

21

II

21

Data modeling ER Model, Notation used in ER diagram Data modeling ER Model, Notation used in ER diagram Constraints, Types

Explanat ion

Listens and observe

Understand and remember

22

II

22

Design a ER Diagram for an application

PPT

Explanat ion

Listens and observe

Understand and analyze

Demonstrate PPT Constraints

23

II

23

facilitate s

Listens and observe Listens and observe

Understand and analyze

24

II

24

Relationship s in ER Model Consideratio ns in Designing ER diagram. Enhanced ER Data

Demonstrate Relationships in ER Model Identify Considerations in Designing ER diagram Demonstrate PPT Explanat ion PPT Explanat ion

Understand and analyze

25

II

25

Listens and observe

Understand and analyze

26

II

26

PPT

Explanat ion

Listens and

Understand

Model EER Diagram

EER Diagram Demonstrate PPT EER Diagram Explanat ion

observe Listens and observe Listens and observe Listens and observe Listens and observe Listens and observe Understand and analyze

27

II

27

28

II

28

Specializatio n

Demonstrate Specialization Demonstrate PPT Generalization PPT

Explanat ion

Understand and analyze Understand

29

II

29

Generalizatio n

Explanat ion

Lattice 30 II 30

Demonstrate Lattice PPT

Explanat ion

Understand and analyze

31

II

31

Union and Disjoint properties

Demonstrate Union and Disjoint properties Demonstrate Constraints and relationships Demonstrate Algorithms for ER to Relational mapping Demonstrate Algorithms for ER to Relational mapping Identify Guidelines for
9

PPT

Explanat ion

Understand and analyze

32

II

32

Constraints and relationships

PPT

Explanat ion

Listens and observe

Understand and analyze

33

II

33

Algorithms for ER to Relational mapping

PPT

Explanat ion

Listens and observe

Understand and Remember

34

II

34

Algorithms for ER to Relational mapping

PPT

Explanat ion

Listens and observe

Explore the mechanism

35

IV

35

Guidelines for good

PPT

Explanat ion

Listens and

Explore the mechanism

database design Normalizatio n Normal Forms First Normal form

good database design Identify Normal Forms Explanat ion

observe

36

IV

36

PPT

Listens and observe Listens and observe Listens and observe Listens and observe Listens and observe Listens and observe Listens and observe

Understand

37

IV

37

Identify Normal Forms

PPT

Explanat ion

Understand

38

IV

38

Second Normal form

Identify Normal Forms

PPT

Explanat ion

Understand and remember Understand and remember Understand and remember

39 IV

39

Third Normal Form BCNF (Boyce Codd Normal Form) Multi value dependencies

Identify Normal Forms

PPT

Explanat ion

40

IV

40

Identify Normal Forms

PPT

Explanat ion

Demonstrate Multi value dependencies PPT Explanat ion

41

IV

41

Understand and analyze

42

IV

42

join dependencies

Demonstrate join dependencies PPT Explanat ion

Understand

IV 43 43

Decompositi on algorithms for normalizatio n Decompositi on algs for normalizatio n

Demonstrate Decompositio n algorithms for normalization DemonstrateD ecomposition algorithms for normalization PPT Explanat ion Listens and observe Understand

44

IV

44

PPT

Explanat ion

Listens and observe

Understand

10

45

IV

45

Query Processing: Issues in query processing Issues in query processing

Identify Query Processing: Issues in query processing,

PPT

Explanat ion

Listens and 12observ e

Understand and remember

46

IV

46

Identify Query Processing: Issues in query processing, Demonstrate Simple algorithms for insert and project operators. Demonstrate Simple algorithms for join and other operators. Demonstrate Transaction Processing

PPT

Explanat ion

Lis13tens and observe

Understand and remember

47

IV

47

Simple algorithms for insert and project operators.

PPT

Explanat ion

Listens and observe

Understand and remember

48

IV

48

Simple algorithms for join and other operators.

PPT

Explanat ion

Listens and observe

Understand and remember

49

49

Transaction Processing: Transaction processing issues Transaction states

PPT

Explanat ion

Listens and observe

Understand and analyze

50 V

50

Identify Transaction states Identify problems during multiple transaction processing Demonstrate

PPT

Explanat ion

Listens and observe

Understand and analyze

V 51 51

problems during multiple transaction processing

PPT

Explanat ion

Listens and observe

Remember and apply

52

52

ACID

PPT

Explanat

Listens and

Remember

11

properties V Concurrency Control techniques: Binary Locks Concurrency Control techniques: Binary Locks

ACID properties Demonstrate System Log PPT

ion

observe

and apply

53

53

Explanat ion

Listens and observe

Retain information and apply

Demonstrate Concurrency Control techniques: Binary Locks Demonstrate Exclusive Locks PPT Explanat ion Listens and observe PPT Explanat ion Listens and observe Apply and evaluate

54

54

Exclusive Locks 55 V 55

Understand remembers and comprehen ds Understand and remember

56

56

Lock based techniques

Identify Lock based Techniques Demonstrate Timestamp based techniques Demonstrate Versioning in Locks Identify Multiversion Locking techniques IdentifyMultiv ersion Locking techniques PPT Explanat ion PPT Explanat ion

Listens and observe

57 V

57

Timestamp based techniques.

Listens and observe

Explore the mechanism

58

58

Timestamp based techniques. Multiversion Locking techniques Multiversion Locking techniques

PPT

Explanat ion

Listens and observe Listens and observe Listens and observe

Explore the mechanism Understand and remember Explore the mechanism

59

59

PPT

Explanat ion

60

60

PPT

Explanat ion

12

XI . Evaluation pattern:
Internal Marks External Marks EVALUATION SCHEME: : : 40 60

Component

Duration(minutes)

%weightage

Marks

Test I

90min

75%best of one & 25% other

20

Test II

90min

20

Assignment Tests

45min

2 questions from out of 6 Average of two Average of two --

Home Assignments

--

Surprise Quizzes Internal Lab Evaluation(viva) Internal Lab Evaluation(mid test & record) Comprehensive Lab exam(external) Theory Examination Attendance for theory Attendance for Lab

20min

Continuous

15

-Continuous 20

3 Hrs 3 Hrs -----

--

60 60 5 5

----

13

Attendance Weightage 05 Marks

Attendance of 75 % and above but less than 80 % 01 Mark Attendance of 80 % and above but less than 85 % 02 Marks Attendance of 85 % and above but less than 90 % 03 Marks Attendance of 90 % and above but less than 95 % 04 Marks Attendance of 95 % and above 05 Marks X11 GRADES After successful completion of the Course work and all the internal and external examinations, a student will graded as follows Letter X A B C D F Qualitative Meaning - Excellent - Very Good - Good - Fair - Satisfactory - Fail Grade Point Attached 10 8 7 6 4 0

XIII CHAMBER CONSULTATION HOUR: Department: Computer Science & Engineering Room No: C009 Contact hours: 4:00 to 5:00 PM E-mail Id: [email protected] X1V NOTICES: ALL notices regarding this subject are displayed on the e-learning site only.

COURSE INSTRUCTORS
M.V.B.T. Santhi T.Vijaya Saradhi T. Hema Latha Course Coordinator (M.V.B.T.Santhi)

V. Sandeep

HOD-SEDIV (M.Vishnu Vardhan)

14