| Course Name | Database Management Systems |
| Course Code | 26CSA113 |
| Program | 5 Year Integrated B.C.A – M.C.A |
| Semester | 2 |
| Credits | 3 |
| Campus | Mysuru |
Introduction – Need of Databases – Data Independence – The Three Levels of Architecture – The External Level – Conceptual
Level- Internal Level – Client/Server Architecture- System Structure, Instance and schema, Advantages and Disadvantages of File Systems, Types of users in DBMS, Data Models and Overall System Architecture.
Key Constraints – CODD’s Rules, Design Issues -ER – Model –Attribute types- Weak Entity Sets – Extended ER Features – ER to Relational Mapping, Structure of Relational Databases, Concept of Normalization and Types of Anomalies.
Functional Dependency: Armstrong’s axioms- closure of a relation and closure of attribute– Lossy/ Lossless decomposition- 1NF, 2NF, 3NF, Boyce – Codd Normal Form. The Relational Algebra – Query Processing and Optimization: Evaluation of Relational algebra Expressions Query Equivalence.
Transaction Processing: ACID properties, states of a transaction-Introduction to concurrency control-Deadlock- Recovery. Built in SQL functions- Set operations, Sub Queries-Joins-DCL – TCL- Views – Locks – Sequences – Index – PL/SQL Basics – Exceptions – Cursors – Stored Functions – Triggers
Course Objective(s)
The objective of the course is to present an introduction to database management systems, with an emphasis on how to organize, maintain and retrieve – efficiently, and effectively – information from a DBMS.
Course Outcomes
|
COs |
Description |
|
CO1 |
Students will have a full comprehension of database concepts and their applications, including their functionalities. |
|
CO2 |
Students will be able to master basics of SQL and apply it to construct queries for any given database such as create tables, applying constraints, insert/update/delete data, and building indexes on data RDBMS thereby building a successful application. |
|
CO3 |
Students will be able to design entity relationship diagram, convert the entity relationship diagrams into RDBMS and formulate SQL queries on the data. |
|
CO4 |
Implement the concept of normalization on the data and its usage in database design to complete an application with transaction properties such as concurrency control and recovery. |
CO-PO Mapping
|
PO |
PO1 |
PO2 |
PO3 |
PO4 |
PO5 |
PO6 |
PO7 |
PO8 |
|
CO |
||||||||
|
CO1 |
3 |
– |
1 |
– |
– |
– |
– |
– |
|
CO2 |
2 |
3 |
2 |
1 |
– |
– |
– |
– |
|
CO3 |
2 |
2 |
3 |
1 |
– |
– |
– |
– |
|
CO4 |
3 |
2 |
2 |
1 |
– |
– |
– |
– |
Textbooks
References
|
Assessment |
Weightage (%) |
|
Midterm |
25 |
|
Continuous Assessment |
25 |
|
End Semester Exam |
50 |
|
Total Marks |
100 |
DISCLAIMER: The appearance of external links on this web site does not constitute endorsement by the School of Biotechnology/Amrita Vishwa Vidyapeetham or the information, products or services contained therein. For other than authorized activities, the Amrita Vishwa Vidyapeetham does not exercise any editorial control over the information you may find at these locations. These links are provided consistent with the stated purpose of this web site.
