SREE DATTHA INSTITUTE OF ENGINEERING AND SCIENCE

SHERIGUDA, IBRAHIMPATNAM, R.R. DIST.

Learning Objectives FOR II B.TECH II SEM CSE
Subject: Data Base Management System Faculty Name: N.PRIYANKA

LOWER ORDER HIGHER ORDER

UNIT TOPIC
students are able to students are able to
Students are able to Students are able to
 Define what is  Examine the database
Introduction to database system(L1) system(L3)
Data base
System  Discuss what is  Operate the database
database system(L2) system(L4)

Students are able to Students are able to

 List the Database  Implement the database
Languages(L1) languages(L3)
Database  Describe the  Distinguish the
Languages – Database database languages(L4)
DDL , DML Languages(L2)

1 Students are able to Students are able to

 Define the ER  Implement the ER
Diagrams(L1) Diagrams(L3)
Introduction to
 Discuss the ER  Compare the ER
data base design
Diagrams(L2) Diagrams(L4)
and ER Diagrams
 Create the ER
Diagrams(L6)

Students are able to Students are able to

 Memorize the  Relate the ER to
Relational models relational (L4)
Relational model (L1)  Interpret the given
 Describe the models.(L3)
Relational models(L2)  Evaluate the given
models.(L5)
 Students are able to Students are able to
 List the operators in  Experiment the
Relational relational algebra(L1) operators in relational
algebra and  Explain the operators algebra(L4)
calculus in relational  Select the operators in
algebra(L2) relational algebra(L5)

Students are able to Students are able to

 Explain the SQL  Execute the SQL
SQL queries and queries and
constrains(L2) constrains(L3)
 Discuss the SQL  Design the operators in
queries and constrains relational algebra(L6)
2 (L2)

Students are able to

 Implement the Triggers
based on stored
procedures(L3)
 Discriminate the
Triggers Triggers based on stored
procedures(L4)
Students are able to  Develop the Triggers
 Define the Triggers based on stored
based on stored procedures(L3)
procedures(L1)
 Identify the various
triggers.(L2)
Students are able to
 Operate the
Schema Students are able to normalization(L3)
refinement and  Define the  Distinguish the
normal forms normalization(L1) normalization(L4
 Explain the database  write the database
3 normal forms.(L2) normal forms.(L6)
Students are able to Students are able to
 Explain the  Test the
Functional normalization(L2) normalization(L4)
dependencies  Discuss the database  Evaluate the database
normal forms.(L2) normal forms.(L5)
 Students are able to
 Distinguish the phases
in transaction
Students are able to management.
Transaction
 List the phases in  Evaluate the phases in
management
transaction transaction
concepts
management(L1) management(L5)
 Classify the phases in  Design the phases in
transaction transaction
management.(L2) management(L6)
Students are able to
 Interpret Categories in
Concurrency
control.(L3)
4  Differentiate the
Concurrency Students are able to Categories in
control  Memorize the phases Concurrency
of transaction control.(L4)
management(L1)  Construct the
 Describe the Categories in
Categories in Concurrency
Concurrency control.(L6)
control.(L2)

Students are able to

 Recognize the phases Students are able to
of transaction  Solve the problems in
Recovery system management(L2) the system.(L3)
failure  Identify the errors in  Experiment the
classification the system.(L2) system.(L4)
Students are able to Students are able to
 Describe the data on  Illustrate the data on
Storage and external storage.(L2) external storage.(L3)
indexing  Locate the data on  Examine the data on
external storage.(L2) external storage.(L4)

Students are able to Students are able to

 Define the tree  Discriminate the tree
5 structure based on structure based on
Tree structured
indexing.(L1) indexing.(L4)
indexing
 Recognize the tree  construct the tree
structure based on structure based on
indexing(L2) indexing(L6)
Hash based Students are able to Students are able to
 Define the hash  Evaluate the hash based
indexing
based indexing(L1) indexing(L5)
  Recognize the hash  Construct the hash
based indexing(L2) based indexing(L6)

HIGHER LEVEL:

L6  CREATE
L5  EVALUATE
L4  ANALYZE
L3  APPLY

LOWER LEVEL:

L2  UNDERSTAND
L1  REMEMBER