Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                

Course Plan - IMS

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 10

COURSE PLAN

For
Information Management System (CSET201)

Faculty Name : Dr. Prabhishek Singh, Dr. Ashish Kumar, Dr. Ankur Gupta,
Prof. Bharat Gupta, Dr. Mohd. Aquib Ansari, Dr. Kuldeep, Ms. Lahar Srivastava,
Ms. Arti Jain, Ms. Naina Yadav, Dr. Prashasti, Dr. Divya Singh, Dr. Garima
Jaiswal

Course Type : B.Tech Core

Semester and Year : III Semester and II Year

L-T-P : 3-0-2

Credits 4

School : SCSET

Course Level : UG

School of Computer Science Engineering and Technology

Bennett University
Greater Noida, Uttar Pradesh
COURSE CONTEXT
VERSION NO. OF
CURRICULUM/SYLLABUS
SCHOOL SCSET THAT THIS COURSE IS A V1
PART OF
SCSET DATE THIS COURSE
DEPARTMENT WILL BE EFFECTIVE July–Dec, 2023
FROM
VERSION NUMBER OF
DEGREE B.Tech. THIS COURSE 2

COURSE BRIEF
Information
COURSE TITLE Management Systems PRE-REQUISITES NA
COURSE CODE CSET201 TOTAL CREDITS 4
COURSE TYPE Core L-T-P FORMAT 3-0-2

COURSE SUMMARY
To enable students with practical skills of databases in the current world of computer applications. The
course covers topics like purpose of databases, entity relationship model, relational database design, query
processing and optimization, transaction management, distributed databases, Big-Data and NoSQL.

COURSE-SPECIFIC LEARNING OUTCOMES (CO)


By the end of this program, students should have the following knowledge, skills and values:
CO1: Articulate the competent understanding of database systems design and ER Modelling.
CO2: Build database systems and understand new developments and trends in databases.
CO3: Construct databases and make use of efficient SQL queries to retrieve and manipulate data as required.

How are the above COs aligned with the Program-Specific Objectives (POs) of the degree?
The course outcomes are aligned to inculcating inquisitiveness in understanding cutting edge areas of
computer science engineering and allied disciplines with their potential impacts.
CO - PO Mapping

COs POs PO1 PO2 PO3 PO4 PO5 PO6

CO1

CO2

CO3

Detailed Syllabus

Module 1 (10
hours)

Purpose of IMS, Real-life applications of Data-Intensive systems, Typical system challenges, Data
independence, Database system architecture levels, Role of several databases, ER diagram: Entity-set,
Attributes, Relationships, Cardinality ratio, EER diagram: Specialization, Generalization, Constraints of
EER, Aggregation, ER to Relational model, Relational model, Structure of relational databases, Constraints
of relational model, Relational algebra: Basic and derived operator, Tuple relational calculus.

Module 2 (10 hours)


Functional dependency – definition, trivial and non-trivial FD, Armstrong's axioms, closure of FD set,
Closure of attributes, Irreducible set of FDS, Normalization, 1NF, 2NF, 3NF, BCNF, Decomposition using
FD, Dependency preservation, Multivalued dependency, 4NF, join dependency, 5NF, Query optimization,
Measures of query cost: selection operation, sorting, join, Evaluation of expressions, Transformation of
relational expressions, Estimating statistics of expression results.

Module 3 (10 hours)


Properties of transactions, Serializability of transactions, testing for serializability, System recovery, Two-
Phase Commit protocol, Recovery and Atomicity, Log-based recovery, concurrent executions of
transactions, Locking mechanism, Solution to concurrency related problems, Deadlocks, Two-phase
locking protocol, Isolation, Intent locking, Discretionary Access Control, Mandatory Access Control,
Authentication, Authorization and access control, DAC, MAC and RBAC models.

Module 4 (12 hours)


Pipelining, Streaming algorithms framework, Turnstile model, Cash register models, Sliding window
model, Data warehouse, Operational data store, Star schema, Snowflake schema, Data cube concept,
OLAP, Cube and Roll-up, NoSQL database systems framework, Column stores, RDF stores, HBase, Big
Data, Hadoop MapReduce architecture, Distributed Database Systems framework (DDS), Need for Data
Privacy, Privacy law, Anonymity models, Privacy in Cloud and Big Data.

TEXTBOOKS/LEARNING RESOURCES:
1. Ramez Elmasri and Sham Navathe, Fundamentals of Database Systems (1 ed.), Pearson/Addisonst
Wesley, 2016. ISBN 9780133970779.
2. Abraham Silberschatz, Henry F. Korth, S. Sudarshan, “Database System Concepts”, 7th Edition, McGraw-Hill
2019, ISBN 9780078022159

TEACHING-LEARNING STRATEGIES
The course will be taught using a combination of the best practices of teaching-learning. Multiple
environments will be used to enhance the outcomes such as seminar, self-learning, MOOCs, group
discussions and ICT based tools for class participation along with the classroom sessions. The teaching
pedagogy being followed includes more exposure to hands-on experiment and practical implementations
done in the lab sessions. To match with the latest trend in academics, case study, advanced topics and
research-oriented topics are covered to lay down the foundation and develop the interest in the students
leading to further exploration of the related topics. To make the students aware of the industry trends, one
session of expert lecture will be organized to provide a platform to the students for understanding the
relevant industry needs.

EVALUATION POLICY

Components of Course Evaluation Percentage Distribution

End Semester Examination 35%

Mid Semester Examination 15%

Quiz 10%

Lab Continuous Evaluation 30%

Certification course 10%

Total 100%

Lecture Wise Plan

No. Content Planned

1 Course structure/handout Assessment mechanism (15) Purpose of


IMS (10) Real-life applications of Data-Intensive Systems (15)
Typical System Challenges (10)
2 Data independence (10)
Database system architecture- Levels (25)
Role of database users (15)

3 ER Diagram (15)

Entity-set (10)
Attributes (25)

4 Relationships (20)

Cardinality ratio (30)

5 EER Diagram (5)

Specialization (15)

Generalization (10) Constraints of EER (10) Aggregation (10)

6
ER to Relational Model
(50)

7 Relational Model (10)


Structure of relational databases (10) Constraints of Relational Model (30)

No. Content Planned

8 Relational algebra (10)


Basic Operators (40)

9 Derived Operators (45)

10 Tuple relational calculus (45)

11 Assessment 1/Buffer Lecture*

12 Closure of attributes (15) Irreducible set of FDS (10) Normalization (25)

13 1NF (15)

2NF (30)
14 3NF (25)

BCNF (20)

15 Decomposition using FD (25) Dependency preservation (25)

16 Multivalued dependency (10)

4NF (15)

Join dependency (10)

5NF (15)

17 Case study (50)

(Strategic advantage of IMS)

18 Start-ups in DBMS (50)

19 Query Optimization (10)

Measures of query cost: selection operation, sorting, join. (40)

20 Evaluation of expressions (20) Transformation of relational expressions (10) Estimating statistics of expression
results (20)

21 Assessment 2/ Buffer Lecture

22 Properties of transactions (45)

23 Serializability of transactions (30)

Testing for serializability (20)

System recovery (10)

24 Two- Phase Commit protocol (10) Recovery and Atomicity (15) Log-based recovery (15)

Concurrent executions of transactions (10) Locking mechanism (20) Solution to concurrency problems (20)

25

Deadlocks (45)

26

Two-phase locking protocol (20) Isolation (20)

27 Intent locking (10)


Discretionary Access Control (25) Mandatory Access Control (20)

28

Authentication (20)

29 Authorization and access control (25)

30 DAC, MAC and RBAC models (50)

31 Advanced Topics in DBMS

32 Expert Lecture from Industry (50)

33 Pipelining (45)

34 Streaming Algorithms framework (5) Turnstile model (15)

Cash register models (15) Sliding window model (15)

35 Data warehouse (20) operational data store (15)

star schema, Snowflake schema (15)

36 Data cube concept (10) OLAP (25)

Cube and Roll-up (10)


NoSQL database systems framework (50)
37

38 Column stores (15)

RDF stores (15)


HBase (20)

39 Big Data (25)


Hadoop MapReduce architecture (25)

Distributed Database Systems framework (DDS) (45)


40

41 Need for Data Privacy (10) Privacy law (20)

Anonymity models (10)

Privacy in Cloud and Big Data (10)


Buffer lecture
42
Lab Wise Plan

No. Content Planned

1 Installation of Application Software Basics of SQL: DDL, DML, DCL

2 SQL: Defining constraints – Primary key, foreign key, unique, not null, check,

3 Built-in functions – numeric, date, string functions, Data types, Aggregate Functions

4 Create ER diagram of organizational database and convert it into relational model

5 Group by clause and order by clause Creation and implementation of views

6 Implementation of different types of join types (natural, left, right, full outer, cross join)

7 Implementation of Subquery in SQL

8 PL SQL: - Cursors, Stored Procedures

9 PL SQL: Functions, Triggers

10 Transaction control commands – Commit, Rollback

11 NOSQL: Implementation of database, collection creation using MONGO DB

12 Working on Firebase Realtime Database: a cloud-hosted NoSQL database

13 Buffer

 Proposed Industry Talks: By any industry person tentatively in 3rd week of November.
 Startups related to the Course: TablePlus, Softbuilder, ScaiData

 Certification Mapping: Introduction to Modern Database Systems:


Saylor(https://learn.saylor.org/course/CS403),

Database Management Essentials: Coursera (https://www.coursera.org/learn/database-management),

Databases and SQL for Data Science with Python (https://www.coursera.org/learn/sql-data-science)

 Software/Tools Used: MySQL Workbench 8.0 CE, MongoDB, Mentimeter

 Hardware/Devices Used: NA

 Proposed Case Studies: Real-Life applications of the concepts like Facebook

 Advanced Research Topics: Data Lake

You might also like