Page 167 - IT_Bulletin
P. 167
DATABASE MANAGEMENT SYSTEM

Course Outcome 2 Design Data Base with the he lp of various Relational Hrs Marks
algebra Operations and Normal Forms.

Learning Outcome Define various Relational algebra Operations. 8 10
1

Contents Relational algebra and relational calculus, Relational algebra Basic operations
like select, Project, Union ,set difference, Cartesian product, rename and
Method of additional operations like Set intersection, Natural Join, Division ,Join(Left,
Assessme nt right and Full) .

Question Paper -External- End Sem Theory Exam

Learning Outcome Compare Relational algebra and relational calculus 8 10
2 Query Language.

Contents Introduction and Comparison of relational calculus i.e. Tuple oriented and
domain oriented relational calculus

Method of Question Paper-Internal Progressive Test
Assessme nt

Learning Outcome Identify Functional dependency and Referential 8 10
3 integrity.

Contents Functional dependency: Definition, inference axioms for functional
dependency, closure, cover and equivalence of FD, Referential integrity

Method of Question Paper -External- End Sem Theory Exam
Assessme nt

Learning Outcome Build Data Base with the he lp of Normal Forms. 10 10
4

Contents Data Base Design : Concept of Normalization , Decomposition i.e Lossless or
Lossy Decomposition, Normal forms, 1 NF, Data anomalies in 1 NF, Partial
Method of dependency, 2 NF, Data anomalies in 2 NF , Transitive Dependency, 3NF, Data
Assessme nt anomalies in 3 NF, Boyce-Codd Normal Form.

Question Paper -External- End Sem Theory Exam

Course Outcome 3 Develop Que ry Base d Data Base Applications. Hrs Marks

Learning Outcome Build Data Base and Tables with the he lp of DDL. 9 10
1

DATABASE MANAGEMENT SYSTEM
   162   163   164   165   166   167   168   169   170   171   172