231CS41 DATABASE MANAGEMENT SYSTEMS L T P C
(Common to CSE,AIDS and IT) 3 0 0 3
Programme: [Link]. Information Technology Sem: 4 Category: PC
Prerequisite: Nil
Aim: To provide a strong foundation in database technology and current trends in this field.
Course Outcomes: The Students will be able to.
CO1: Identify the basic concepts of database systems.
CO2: Outline the basics of SQL and methods to enhance queries.
CO3: Apply the normalization rules for optimizing the database.
CO4: Illustrate the transactions using T-SQL.
CO5: Summarize the fundamental concepts of transaction, concurrency and recovery processing.
CO6: Describe the various advanced Database technologies and database security.
INTRODUCTION 9
Purpose of Database System - Views of data - Data Models - Architecture -Entity - Relationship
(E-R) model - Extended E-R Features - Design of E-R database schema - Structure of Relational
data model - Fundamentals of relational algebra operations
STRUCTURED QUERY LANGUAGE 9
SQL: Basic structure - Query Processing Overview -Set operations - Aggregate functions - Null
Values – Nested sub queries -Data Base Languages- Keys - Embedded SQL -Dynamic SQL.
Domain Constraints - Assertions - Triggers - Views.
DATABASE DESIGN 9
Functional Dependencies –Non-loss Decomposition- Normalization-First, Second, Third
Normal Forms, - Boyce/Code Normal Form - Multi-valued Dependencies and Fourth Normal
Form - Join Dependencies and Fifth Normal Form.
TRANSACTIONS PROCESSING AND CONCURRENCY CONTROL 9
Transaction Concepts – ACID Properties – Schedules – Serializability – Concurrency control –
Two Phase Locking- Timestamp – Multiversion – Validation and Snapshot isolation– Multiple
Granularity locking – Deadlock Handling – Recovery Concepts – Recovery based on deferred and
immediate update – Shadow paging – ARIES Algorithm.
ADVANCED DATABASE SECURITY AND No-SQL 9
Distributed Databases: Architecture, Data Storage, Transaction
Processing,Query processing and optimization – No-SQL MongoDB- Basic Structure –
Commands – Data Base Connectivity- Database Security: Security issues –Access control based on
privileges – Role Based access control – SQL Injection – Statistical Database security – Flow
control – Encryption and Public Key infrastructures.
Total Periods: 45
Text Books:
1. Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, 7th/e,
Tata McGraw Hill, 2021.
2. Ramez Elmasri, Shamkant B. Navathe, “Fundamentals of Database Systems”, 7th/e, Pearson,
2017.
3. Itzik Ben-Gan,“Microsoft SQL Server 2012 T-SQL Fundamentals”, Microsoft Press 2nd/e,
2012.
References:
1. [Link], [Link], [Link], “An Introduction to Database Systems”, Pearson
Education, 8/e, 2006.
2. Raghu Ramakrishnan, “Database Management Systems”, McGrawHill, 4/e, 2010.
3. [Link], “Database Management Systems”, Tata McGraw Hill, 2011.
Program Specific
Program Outcomes (POs)
Course Outcomes (PSOs)
Outcome PO PO
PO1 PO2 PO3 PO5 PO6 PO7 PO9 PO10 PO11 PSO1 PSO2 PSO3
s 4 8
K3 K2 K3 K3 K5 K2 K3
CO1 K2 2 3 2 2 1 3 2
CO2 K2 2 3 2 2 1 3 2
CO3 K3 3 3 3 3 1 3 3
CO4 K2 2 3 2 2 1 3 2
CO5 K2 2 3 2 2 1 3 2
CO6 K2 2 3 2 2 1 3 2
1: Slight (Low) 2: Moderate (Medium) 3: Substantial
(High)
DATABASE MANAGEMENT SYSTEMS L T P C
231CS47 LABORATORY 0 0 2 1.5
(Common to CSE,AIDS and IT)
Programme: [Link] Technology Sem: 4 Category PC
:
Prerequisites: Nil
Aim: To study and implement DDL, DML commands & basics of PL/SQL functions, cursors,
triggers etc.
Course Outcomes: The Students will be able to
CO1: Categorize the structured query language (SQL) for database definition and database
manipulation.
CO2: Recommend with Join and Nested Queries to perform Various Database operations.
CO3: Analyze the PL/SQL blocks using Cursors and Triggers.
CO4: Evaluate the normalization forms using SQL queries.
CO5: Design the Transactions processing using T-SQL.
CO6: Analyze the various advanced technology of Databases and No-SQL.
LIST OF EXPERIMENTS:
MICROSOFT SQL SERVER
1. Practice of Database Languages using SQL Query
2. Create a database table, add constraints (primary key, unique, check, Not
null), insert rows, update and delete rows using SQL DDL and DML commands
3. Set operators and Join queries and nested queries
4. PL/SQL–(Cursors, Stored procedures, stored function, Triggers)
5. Front end Connectivity
6. Normalization (1NF, 2NF and 3NF)
7. Auto Rollback - IF ELSE statement-SQL Transaction in TRY CATCH using T-SQL.
MONGODB
1. No-SQL commands
2. Recursion
3. Java Database Connectivity
Mini project :
a) Inventory Control System.
b) Hospital Management System.
c) Railway Reservation System.
d) Personal Information System.
e) Web Based User Identification System.
f) Timetable Management System.
g) Hotel Management System
h) Education Management System
i) Airline Reservation System
j) Online Voting System
k) Goods and Service Tax(GST) Management System
l) Aadhaar Management System
Total Periods: 45
LIST OF EQUIPMENT FOR A BATCH OF 30 STUDENTS:
Standalone
desktops 30
Nos. (or)
Server supporting 30 terminals or more.
Program
Specific
Program Outcomes (POs)
Course Outcomes(PSOs
Outcome )
s PO PO PO PO PO PO PO PO PO PO1 PO1 PSO PS PS
1 2 3 4 5 6 7 8 9 0 1 1 O2 O3
K3 K6 K6 K3 K6 K6 K3
CO1 K4 3 1 1 3 1 1
CO2 K5 3 2 2 3 1 2
CO3 K4 3 1 1 3 2
CO4 K5 3 2 2 3 2
CO5 K6 3 3 3 3 1 2
CO6 K4 3 1 1 3 2 2
1: Slight (Low) 2: Moderate (Medium) 3: Substantial (High)
231ITH05 INTELLIGENCE TECHNOLOGIES L T P C
3 0 0 3
Programme [Link]. Information Technology Sem Category: PE
: :
Prerequisite Nil
:
Aim: To provide a comprehensive understanding of Artificial Intelligence (AI) and its subfields,
including Machine Learning, Deep Learning, Natural Language Processing, and Robotics,
while exploring real-world applications and ethical considerations.
Course Outcomes: The Students will be able to.
CO1: Explain the fundamental concepts of Artificial Intelligence
CO2: Apply basic problem-solving techniques and knowledge representation schemes
CO3: Demonstrate an understanding of machine learning techniques
CO4: Build and analyze neural network-based models
CO5: Apply NLP and robotics techniques
CO6: Analyze the societal impact of AI and its applications
INTRODUCTION TO INTELLIGENCE TECHNOLOGIES 9
Introduction to Artificial Intelligence – History and Evolution-Types of AI – Narrow,
General, and Super AI-Applications of AI in various domains-Introduction to Intelligent
Agents and their architecture-Problem-solving methods: Search strategies – BFS, DFS, A*-
Knowledge Representation: Semantic networks, Frames, Ontologies
MACHINE LEARNING TECHNIQUES 9
Types of Machine Learning – Supervised, Unsupervised, Reinforcement-Feature Selection
and Preprocessing-Regression, Decision Trees, KNN-Naïve Bayes, SVM, Neural Networks-
Model Evaluation Techniques: Cross-validation, Confusion Matrix
DEEP LEARNING AND NEURAL NETWORKS 9
Basics of Neural Networks-Multilayer Perceptron and Backpropagation-Introduction to Deep
Learning-Convolutional Neural Networks (CNNs)-Recurrent Neural Networks (RNNs) and
LSTMs-Applications: Image classification, Speech recognition
NATURAL LANGUAGE PROCESSING AND ROBOTICS 9
NLP Basics – Tokenization, POS tagging, Lemmatization-Text Classification, Sentiment
Analysis-Machine Translation and Chatbots-Introduction to Robotics and Perception-
Planning and Navigation in Robotics-Human–Robot Interaction
EMERGING TRENDS AND APPLICATIONS 9
Intelligent Systems in Healthcare, Education, Smart Cities-Expert Systems and Decision
Support Systems-Ethics and Bias in AI-Explainable AI (XAI) and Responsible AI-AI in
Cybersecurity-Case Studies: Autonomous Vehicles, Recommender Systems, Virtual
Assistants
Total Periods: 45
Text Books:
[Link] Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, Pearson
[Link] Goodfellow, Yoshua Bengio, Aaron Courville, “Deep Learning”, MIT Press
[Link] Alpaydin, “Introduction to Machine Learning”, MIT Press
References:
[Link] Mitchell, “Machine Learning”, McGraw-Hill
[Link] and Martin, “Speech and Language Processing”, Pearson
3.S. Rajasekaran, G. A. Vijayalakshmi Pai, “Neural Networks, Fuzzy Logic and Genetic
Algorithms”, PHI
Course Program Outcomes (POs) Program
Outcome Specific
s Outcomes
(PSOs)
PO PO2 PO3 PO4 PO5 PO PO PO PO9 PO10 PO11 PSO1 PSO2 PSO3
1 6 7 8
CO1 3 2 – – 2 – – – – – 2 2 3 1
CO2 3 3 2 2 3 – – – – – 2 3 3 2
CO3 3 3 2 2 3 – – – – – 2 2 3 3
CO4 3 2 3 2 3 – – – – – 3 2 3 3
CO5 3 2 2 2 3 2 – – – – 3 3 3 2
CO6 2 2 – – 2 3 3 – – 2 3 2 2 3