INDIAN INSTITUTE OF INFORMATION TECHNOLOGY UNA

An Institute of National Importance under MoE

Saloh, Una (HP) -177209
www.iiitu.ac.in

ACADEMIC YEAR: 2025-26

COURSE PLAN - PART I

1. COURSE OUTLINE
NAME OF THE B.Tech. CSE Semester IV
PROGRAMME AND
SPECIALIZATION
COURSE TITLE Database Management Systems
COURSE CODE CSC401 NO. OF CREDITS 6
SESSION Even Semester (AY 2023-24)
NAME OF FACULTY Prachi Arora SCHOOL School of Computing
E-MAIL [email protected] TELEPHONE 9780742746
NO.
COURSE TYPE Program Core (PC)

2. SYLLABUS (APPROVED IN BOS)

As per the curriculum of IIIT Una
3. COURSE OBJECTIVES
1. To learn data models, conceptualize and depict a database system using ER diagram.
2. To understand the internal storage structures in a physical database design.
3. To know the fundamental concepts of transaction processing techniques.
4. COURSE OUTCOMES (CO)
1. Ability to Install, configure, and interact with a relational database management system. (K2)
2. Ability to master the basics of SQL and construct queries using SQL. (K2)
3. Ability to design and develop a large database with optimal query processing.(K3)

COURSE PLAN – PART II

5. COURSE OVERVIEW
The course comprises of five units: Introduction to Database Systems, Relational Model, Database
Design, Transactions, and Implementation Techniques. The course is focused on imparting
knowledge regarding the Concepts of database management systems, structural query language, and
enabling the students to apply it in the real time applications.
6. COURSE TEACHING AND LEARNING ACTIVITIES
S. No. Lecture Number Lecture Topic Pedagogy Approach
1. Lecture-1 Purpose of Database System, Views of data Green board and chalk
2. Lecture-2 Data models Green board and chalk
Database management system , three-schema Green board and chalk
3. Lecture-3
architecture of DBMS
 4. Lecture-4 Components of DBMS Green board and chalk
E/R Model, Conceptual data modeling: Green board and chalk
5. Lecture-5
motivation
Entities, entity types, attributes, relationships, Green board and chalk
6. Lecture-6
relationship types
7. Lecture-7 E/R diagram notation Green board and chalk
8. Lecture-8 E/R Model: Examples. Green board and chalk
9. Lecture-9 Relational Data Model - Concept of relations Green board and chalk
10. Lecture-10 Schema-instance distinction and Keys Green board and chalk
11. Lecture-11 Referential integrity and foreign keys Green board and chalk
12. Lecture-12 Relational algebra operators Green board and chalk
13. Lecture-13 SQL - Introduction, data definition in SQL Green board and chalk
Table, key and foreign key definitions, update Green board and chalk
14. Lecture-14
behaviors
15. Lecture-15 Querying in SQL, notion of aggregation Green board and chalk
Aggregation functions group by and having Green board and chalk
16. Lecture-16
clauses, embedded SQL
17. Lecture-17 Dependencies and Normal forms Green board and chalk
Dependency theory - functional dependencies Green board and chalk
18. Lecture-18
and Armstrong's axioms for FD's
19. Lecture-19 Closure of a set of FD's Green board and chalk
20. Lecture-20 Minimal covers Green board and chalk
21. Lecture-21 Definitions of 1NF, 2NF, 3NF and BCNF Green board and chalk
Decompositions and desirable properties of Green board and chalk
22. Lecture-22
Different Normal forms
23. Lecture-23 Algorithms for 3NF and BCNF normalization Green board and chalk
24. Lecture-24 4NF and 5NF Green board and chalk
Transaction processing and Error recovery: Green board and chalk
25. Lecture-25
Concept of transaction processing
26. Lecture-26 ACID properties Green board and chalk
27. Lecture-27 Type of Transactions Green board and chalk
28. Lecture-28 Concurrency control Green board and chalk
29. Lecture-29 Locking-based protocols for CC Green board and chalk
30. Lecture-30 Error recovery and logging Green board and chalk
31. Lecture-31 Undo, redo, undo-redo logging Green board and chalk
32. Lecture-32 Recovery methods Green board and chalk
33. Lecture-33 Data Storage and Indexes - file organizations Green board and chalk
34. Lecture-34 Primary index structures Green board and chalk
35. Lecture-35 Secondary index structures Green board and chalk
36. Lecture-36 Various index structures Green board and chalk
37. Lecture-37 Hash-based and dynamic hashing techniques Green board and chalk
38. Lecture-38 Multi-level indexes Green board and chalk
39. Lecture-39 B+ Trees: Introduction Green board and chalk
40. Lecture-40 B+ Trees: Operations Green board and chalk
Lecture-41 Green board and chalk
41. NoSQL: Introduction
(Beyond Syllabus)
Lecture-42 Green board and chalk
42. Distributed Databases: Introduction
(Beyond Syllabus)
Page 2 of 5
DATABASE MANAGEMENT SYSTEMS LAB
7. LAB OBJECTIVES
1. To give a good formal foundation on the relational model of data
2. To present SQL and procedural interfaces to SQL comprehensively
8. LAB OUTCOMES
1. Design and implement a database schema for a given problem-domain
2. Normalize a database
3. Populate and query a database using SQL DML/DDL commands
9. LAB LEARNING ACTIVITIES
Sr. Experiment Name Way of performing the lab
No.
1. Introduction to SQL and installation of SQL Computer-based Programming
server/MySQL/oracle.
2. Data Definition Language (DDL) commands in RDBMS. Computer-based Programming
3. Data Manipulation Language (DML) and Data Control Computer-based Programming
Language (DCL).
4. High level language extensions with cursors. Computer-based Programming
5. Data types and create a database and write the program to Computer-based Programming
carry out the following operation.
6. Create tables for departments and employees with required Computer-based Programming
constraints.
7. Working with null values, matching the pattern from the Computer-based Programming
table.
8. Aggregate functions: grouping the result of a query. Computer-based Programming
9. Set operators, Nested Queries, Joins and Sequences. Computer-based Programming
10. Views, indexes, database security and privileges: Grant and Computer-based Programming
Revoke commands, Commit and Rollback commands.
11. PL/SQL Architecture, Assignments and Expressions, Computer-based Programming
Writing PL/SQL Code, Referencing Non-SQL parameters.
12. Triggers and Cursor Management in PL/SQL. Computer-based Programming

13. Procedures and Functions. Computer-based Programming

14. Automatic Backup of Files and Recovery of Files. Computer-based Programming

15. As a designer identify the views that may have to be Computer-based Programming
supported and create views.

Page 3 of 5
10. COURSE ASSESSMENT METHODS
THEORY
Sr. No. Mode of Assessment Week/Date Duration Weightage (%)
1. Assessment-I One Week prior to CT – I 1 Hour 08
2. Cycle Test – I 1 Hour 20
3. Assessment-II One Week prior to CT – II 08
4. Cycle Test – II 1 Hour 20
5. Assignment/Project/Term One Week prior to End 04
Paper Semester Theory Exam
5. End Semester Theory Exam 3 Hours 40
Total (Theory) 100
LABORATORY
1. 60 (Combined of
Practical Lab Demos – 1 1 Hour Practical Lab Demos
and other Continuous
2. assessment components,
Practical Lab Demos – 2 1 Hour as per the institute
policy)
3. As per the 40
End Semester Lab Exam
institute policy
Total (Lab) 100
Total (60% of Theory + 40% of Lab) 100
COURSE EXIT SURVEY (Mention the ways in which the feedback about the course shall be
assessed)
As per the institute policy
COURSE POLICY (preferred mode of correspondence with students, compensation assessment
policy to be specified)
MODE OF CORRESPONDENCE (email/phone etc.)
[email protected], Room No. 019
COMPENSATION ASSESSMENT POLICY
On need basis
ATTENDANCE POLICY (A uniform attendance policy as specified below shall be followed)
As per the institute policy
ACADEMIC DISHONESTY & PLAGIARISM
As per the institute policy
ADDITIONAL INFORMATION
----------

TEXT BOOKS
1. Silberschatz, A., Korth, Henry F., and Sudharshan, S., “Database System Concepts, 5th Edition",
Tata McGraw Hill, 2016..
2. Elmasri, Ramez and Navathe, Shamkant B., “Fundamentals of Database Systems 7th Edition",
Pearson, 2015.
REFERNECE BOOKS
1. Date, C. J, Kannan, A. and Swamynathan, S., "An Introduction to Database Systems, 8th edition",
Page 4 of 5
Pearson Education, 2012.

Page 5 of 5