DEPARTMENT - COMPUTER SCIENCE AND ENGINEERING

COURSE PACK

for

DATABASE MANAGEMENT SYSTEMS - CS 331P

CS 331P - DATABASE MANAGEMENT SYSTEMS

Total Teaching Hours For Semester :

75 No of

Lecture Hours/Week :5

Ma x Marks :
100
:4

Course Description and Course Objectives :

To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram. To make a study of
SQL and relational database design. To understand the internal storage structures using different file and indexing techniques which
will help in physical DB design. To know the fundamental concepts of transaction processing- concurrency control techniques and
recovery procedure. To have an introductory knowledge about the emerging trends in the area of distributed DBOO DB- Data mining
and Data Warehousing and XML. To implement the design of the tables in DBMS. To write queries to get optimized outputs. To
store, retrieve and view the contents. To generate report based on customized need

Course Outcomes

1.C01 - Apply the Conepts of Entity-Relationship (E-R) model for the given application.

2.CO2 - Apply Normalization principles to create and maniplulate relational databases

3.CO3 - Apply the concepts of Non-Relational Models

4.CO4 - Examine different file organization concepts for data storage in Relational databases

5.CO5 - Apply the transaction management principles on relational databases

Unit-

1
Hours :9
y
S llabus Unit Mapping

[Link] Needs:Local,

[Link] Focused:Employability,

[Link] of Cross Cutting Issues:None,

INTRODUCTION AND CONCEPTUAL MODELING

Introduction to File and Database systems- Database system structure – Data Models – Introduction to Network and
Hierarchical Models – ER model – Relational Model – Relational Algebra.

Unit-

2
Hours :9
y
S llabus Unit Mapping
[Link] Needs:Local,

[Link] Focused:Employability,

[Link] of Cross Cutting Issues:None,

RELATIONAL MODEL

SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational Database design – Functional
dependencies and Normalization for Relational Databases (up to BCNF).

Unit-

3
Hours :9
y
S llabus Unit Mapping

[Link] Needs:Local,

[Link] Focused:Employability,

[Link] of Cross Cutting Issues:None,

NON RELATIONAL MODEL

Introduction to NOSQL Systems ,The CAP Theorem, Document-Based NOSQL Systems and MongoDB, NOSQL Key-Value
Stores, Column-Based or Wide Column NOSQL Systems, NOSQL Graph Databases and Neo4j

Unit-

4
Hours :9
y
S llabus Unit Mapping

[Link] Needs:Local,

[Link] Focused:Employability,

[Link] of Cross Cutting Issues:None,

DATA STORAGE AND QUERY PROCESSING

Record storage and Primary file organization- Secondary storage Devices- Operations on FilesHeap File- Sorted Files-
Hashing Techniques – Index Structure for files –Different types of Indexes- B-Tree - B+ Tree – Query Processing.

Unit-

5
Hours :9
y
S llabus Unit Mapping

[Link] Needs:Local,

[Link] Focused:Employability,

[Link] of Cross Cutting Issues:None,

TRANSACTION MANAGEMENT

Transaction management -Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of
Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control – Types of Locks- Two
Phases locking- Deadlock- Time stamp based concurrency control – Recovery Techniques – Concepts- Immediate Update-
Deferred Update - Shadow Paging.

Essential References :
Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”, Seventh Edition, McGraw-Hill, 2021

Recommended References :
Andreas Meier · Michael Kaufmann "SQL & NoSQL Databases", Springer -2019

Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing Company, 2003

Online Resources: [Link]://[Link]/db6/slide-dir

Additional Information

List of Experiments

[Link] design using E-R model and Normalization.

2. Data Definition Language (DDL) commands in RDBMS

3. Data Manipulation Language (DML) and Data Control Language (DCL) commands in RDBMS.

4. Implementation of Joins

5. Implementation of Views

6. High-level language extension with Cursors.

7. High level language extension with Triggers

8. Procedures and Functions.

9. No Sql using monogoDB

10. Mini Project

Evaluation Pattern

CIA:70/100

ESE:30/100

CU / SOET/ CSE/ CF / CS331P/2023-2024/F01

School of Engineering & Technology
Department of Computer Science and Engineering
COURSE INFORMATION SHEET

PROGRAMME: BTech CSE, BTech IT, BTech CSE (AIML), BTech CSE(DS), BTech CSE (IoT)

COURSE NAME: COURSE CODE:

Database Management System CS331P
CONTACT HOURS:
COURSE TYPE (CORE / ELECTIVE): CORE
75

CORRESPONDING LAB COURSE (IF ANY): L T P S Total

CREDIT
No 3 - 1 - 4

COURSE INSTRUCTOR(S) NAME : CONTACT DETAILS :

Cabin #36, Room No 250, Block II,
Dr Naveen J
naveen.j@[Link]
Ph: 9994289908
Prof. Santhrupth B C
Cabin #82, Room No 343, Block
III,[Link]@[Link]
Dr Samiksha Shukla
Ph: 9591866572
Cabin #33, Room No 250, Block V,
Dr Sathish P K [Link]@[Link]
Ph: 9880462311
Prof. T. Vigneshwaran
Cabin #8, Room No 220, Block II,
Prof. Manjunatha Swamy C [Link]@[Link]
Ph: 9448720539
Cabin #133, Room No 516, Block V,
 vigneshwaran.t@[Link]
Ph: 9611412158
Cabin #132, Room No 516, Block V,
manjunathaswamy.c@[Link]
Ph: 8618452160

CLASS ROOM POLICY :

Laptops are required for all classes.
Students are expected to be seated inside the class on time.

If any student missed classes of this course, they may discuss with the course instructor during all working days after 4.00pm with prior
permission.

SYLLABUS: Detailed syllabus to be entered as per the approved BoS document

UNIT DETAILS HOURS
INTRODUCTION AND CONCEPTUAL MODELING
1 Introduction to File and Database systems- Database system structure Data Models 9
Introduction to Network and Hierarchical Models ER model Relational Model Relational
Algebra.
RELATIONAL MODEL
2 SQL Data definition- Queries in SQL- Updates- Views Integrity and Security Relational 9
Database design Functional dependencies and Normalization for Relational Databases (up to
BCNF).
DATA STORAGE AND QUERY PROCESSING
3 Introduction to NOSQL Systems, The CAP Theorem, Document-Based NOSQL Systems and 9
MongoDB, NOSQL Key-Value Stores, Column-Based or Wide Column NOSQL Systems, NOSQL
Graph Databases and Neo4j
TRANSACTION MANAGEMENT
4 Record storage and Primary file organization- Secondary storage Devices- Operations on Files- 9
Heap File- Sorted Files- Hashing Techniques Index Structure for files Different types of
Indexes- B-Tree B+ Tree Query Processing.
CURRENT TRENDS
Transaction management -Transaction Processing Introduction- Need for Concurrency
5 control- Desirable properties of Transaction- Schedule and Recoverability- Serializability and 9
Schedules Concurrency Control Types of Locks- Two Phases locking- Deadlock- Time stamp
based concurrency control Recovery Techniques Concepts- Immediate Update- Deferred
Update Shadow Paging
TOTAL HOURS: 45

LIST OF EXPERIMENTS (IF ANY)

Expected Tools (Software / Hardware) to be used : Oracle XE 10g/11 g/12 C.
Sl No EXPERIMENT NAME CO
1 Database design using E-R model and Normalization. 2
2 Data Definition Language (DDL) commands in RDBMS 2

3
Data Manipulation Language (DML) and Data Control Language (DCL) commands in
2
RDBMS.
4 Implementation of Joins 2
5 Implementation of Views 2
6 High-level language extension with Cursors. 2
7 High level language extension with Triggers 2
8 Procedures and Functions 2
9 No Sql using monogoDB 3
10 Mini Project 5
TEXT BOOKS
Abraham Silberschatz, Henry F. Korth and S. Sudarshan- Database System Concepts, Seventh Edition, McGraw-Hill,
2021
REFERENCE BOOKS
Andreas Meier Michael Kaufmann "SQL & NoSQL Databases", Springer -2019
Raghu Ramakrishnan, Database Management System, Tata McGraw-Hill Publishing Company, 2003
 OTHER RESOURCES
[Link]
COURSE PREREQUISITES
COURSE CODE COURSE NAME DESCRIPTION SEMESTER
CS134P/CSE234P Computer Programming Variables, Data types, Functions I/II

COURSE OBJECTIVES
To learn the fundamentals of data models and to conceptualize and depict a database system using ER diagram.
To make a study of SQL and relational database design. To understand the internal storage structures using
different file and indexing techniques which will help in physical DB design.
To know the fundamental concepts of transaction processing- concurrency control techniques and recovery
procedure.
To have an introductory knowledge about the emerging trends in the area of distributed DB-OO DB- Data mining
and Data Warehousing and XML.
To implement the design of the tables in DBMS. To write queries to get optimized outputs.
To store, retrieve and view the contents. To generate report based on customized need
COURSE OUTCOMES
REVISED BLOOMS TAXONOMY
Sl NO DESCRIPTION
(RBT)LEVEL

1.
Apply the Concepts of Entity-Relationship (E-R) model for the given L3
application
Apply Normalization principles to create and manipulate relational
2. L3
databases
3. Apply the concepts of Non-Relational Models L3
4.
Examine different file organization concepts for data storage in L4
Relational databases
5. Apply the transaction management principles on relational databases L3
CONTENT BEYOND THE SYLLABUS - TO MEET INDUSTRY / PROFESSIONAL REQUIREMENTS
Sl NO DESCRIPTION PROPOSED ACTIONS *
1. Django in day-to-day industry applications Guest Lecture
*Proposed Actions: Industry Visit/Guest Lectures/Technical Talks/Workshops/NPTEL etc
DELIVERY / INSTRUCTIONAL METHODOLOGIES
(Tick the Relevant Methodologies)
Chalk & Talk PPT Student seminars Guest Lecture Industry Visit
Web resources
MOOC / NPTEL Group Activity Field Study

Any other (Specify)

ASSESSMENT METHODOLOGIES DIRECT

(Tick the Relevant Methodologies)

Assignments Closed book tests Open book tests

Case study Student Presentation Mini projects / Model Building

MOOC Quiz Any other (Specify)

FEEDBACK ASSESSMENT (INDIRECT) METHODOLOGIES

(Tick the Relevant Methodologies)
Student Feedback on Course Feedback from Senior Students / Alumni
Feedback from Industry Experts Any other (specify)

COURSE PLAN (Should be equal to total no. of hours mentioned in syllabus)

No of Teaching
Week hours Unit Topic / Sub Topic Details Method Reference

Introduction to databased
Introduction to File and Database
3+1 I and traditional file storage. C&T/PPT T1
systems
Query practice

Lab session for DDL query

2 LAB 1 DDL commands
execution.
 Basic structure, advantage of
Introduction to Network and the model, Three primary
3+1 1 C&T/PPT T1
Hierarchical Models, Data Models data model types. Query
2 practice

Lab session for DML query

2 LAB 2 DML commands
execution.

ER terminologies and
ER models, Relational Algebra relationship. Procedural
3+1 I C&T/PPT T1
query language processing
examples, Query practice
3

Lab 3 Database design using E-R

2 LAB 3 Lab Session
model and Normalization.

Introduction to SQL. Five

SQL - Data definition, Queries in SQL, types of SQL queries. Query
3+1 II Updates- Views, C&T/PPT T1
practice, Queries to
implement views,
4

2 LAB 4 Lab 4 Joins Lab Session

Integrity and Security Need for a secure DB. Query

3+1 II C&T/PPT T1
practice
5

2 LAB 5 Lab 5 Implementation of Views Lab Session

Solving examples to design

Normalization for Relational
3+1 II DB to satisfy 1NF,2NF,3NF C&T/PPT T1,R1
Databases 1NF,2NF,3NF and BCNF1.
and BCNF1. Query practice.
6

2 LAB 6 Lab -6 Cursors Lab Session

Types of NOSQL systems,

Explain some the competing
Introduction to NOSQL Systems, The
3+1 III requirements in a distributed C&T/PPT T1,R1
CAP Theorem
system with replication.
7 Query practice

Lab 7- High level language extension

2 LAB -7 Lab Session
with Triggers

Storage or collection of
documents, rather than a
3+1 III Document-Based NOSQL Systems storage or collection of C&T/PPT T1, R2
structured data. Query
8
practice

2 LAB 8 Procedures and Functions. Lab Session

 Introduction and working of
MongoDB, Examples and
3+1 III MongoDB, NOSQL Key-Value Stores C&T/PPT R2
working of NOSQL Key-Value
9 Stores. Query practice

2 LAB 9 No Sql using monogoDB Lab Session

Record storage and Primary file Record access and storage

3+1 IV C&T/PPT T1/R2
organization techniques
10

2 LAB 10 Display data from multiple tables Lab Session

Heap File, Sorted Files, Hashing Hashing and collisions

3+1 IV C&T/PPT T1/R2
Techniques ,Examples and working
11

2 LAB 11 Using sub-query to solve problem Lab Session

Tree creation and element

deletion, Translation of high-
3+1 IV B-Tree, B+ Tree, Query Processing C&T/PPT T1/R2
level queries into low-level
12 expression

2 LAB 12 Creating other scheme objects Lab Session

Examples and terminologies,

Transaction management, Managing simultaneous
3+1 V C&T/PPT T1/R2
Transaction Processing access examples, ACID
properties
13

Managing objects with data

2 LAB 13 Lab Session
dictionary views.

Rollback, Recoverable
Schedule and Recoverability,
3+1 V Schedules, Ensures conflict C&T/PPT T1/R2
Concurrency Control Types of Locks,
serializable schedules
14

2 LAB 14 Mini Project-Phase1 Lab Session

Deadlocks,Recovery Techniques, Freedom from deadlock as

3+1 V Immediate Update- Deferred Update - no transaction ever waits, C&T/PPT T1
Shadow Paging. NO-UNDO/REDO technique.
15

2 LAB 15 Mini Project-Phase2 Lab Session

 TUTORIAL DETAILS
Sl No Topics Reference
1 ER Model T1
2 Problems on Functional Dependency and Normalization R1
3 B Tree Insertion and Deletion Problems T1,R1
4 Serializing the Schedules T1
5 Tutorial session on XML Web Resources

CIA ASSESSMENT DETAILS - THEORY

Sl No CIA Component Unit(s) Covered CO RBT Level
CIA 1: ER Model Design using
1 Unit 1 1 L3
Digital Library resources.
2 CIA 1: Quiz Unit 2 2 L2
3 CIA 2: MSE Unit 1, 2 and 3 1,2,3 L2,L3
CIA 3: Practical Component and
4 Unit 4 and 5 4,5 L3, L4
Mini Project

LAB ASSESSMENT DETAILS

Sl No Lab Component CO RBT Level
1 Observation 2,3,4,5 L3
2 Record 2,3,4,5 L3
3 ESE Practical Exam 2,3,4,5 L3

COURSE OUTCOMES VS CIA COMPONENTS MARKS DISTRIBUTION

RBT LEVEL VS CIA COMPONENTS RATIO
CIA & RBT
Remember Understand Apply Analyze Evaluate Create Total
Levels
ER Diagram
% % 100% % % % 100%
Design

Quiz % 100% % % % % 100%

CIA 2 % 40% 60% % % % 100%

Project
Requirement % % % 100% % % 100%
Examination
Debugging and
% % 100% % % % 100%
Execution

ESE % 30% 50% 20% % % 100%

Practical % % 100% % % % 100%

19) COMPONENTS EVALUATION RUBRICS

CIA I Component 1

MCQ

Description

Multiple Choice Question (MCQ) is a form of assessment in which the candidates are asked to select the best possible answer out of the
choices from a list of several possible answers, of which only one is correct. The consolidated marks will be converted to 10 marks.
Instructions :
Time Limit: 30 Mins
Marks: 30 Marks ( Reduced to 10 Marks)
Tentative Date: Last Week of July
Venue: Respective classrooms(LMS/Gform).

Assignment Learning Objectives:

1. To test the students' understanding ability.

2. To assess the knowledge.

Assessment Strategies aligned to LO:

Clear explanation of issue, Appropriate Analysis, Proper organization and logical flow
Technology Tools used along with their Purpose:

Manual

Evaluation Rubrics

Criteria (Sample )
Area of Evaluation Mark
Correct Answer 1
Wrong Answer 0

Post Assessment:

Identification of students scoring less than 10 Marks

Make-Up Policy: Re-test scheduled within a weeks time.

CIA I Component 2
ER MODEL DESIGN

Description

To understand ER Model and to design ER for any enterprise

To convert the ER model into Relational Model
To utilize the library resources
Marks: 10 Marks
Tentative Date: 24thJuly 2023
Venue: Respective classroms
Pre - Assessment Criteria:
Proper Design considering all the aspects and symbols of ER and a good presentation: - (HIGH)
Average Design (MEDIUM)
Poor Design and presentation (LOW)
Learning Objective
To enable students in understanding well the data modeling concepts and to relate in a practical scenario
To test the presentation skills in communication, writing, drawing

Assignment Learning Objectives:

To enable students in understanding well the data modeling concepts and to relate in a practical scenario
To test the presentation skills in communication, writing, drawing

Assessment Strategies aligned to LO:

Appropriate Analysis, Proper organization and logical flow

Technology Tools used along with their Purpose: LMS

Evaluation Rubrics:

PARAMETERS / SCORE (100-80) % (79-50) % (49-30) % (29-0) %

A Complete response
Good response with Explanation not well Poor Explanation/
Problem statement with detailed
clear information defined Problem identification
explanation
Clear diagram with Clear diagram with
Use of Visuals In-appropriate diagram No diagram
details incomplete details
Shows complete
Shows substantial Weak implementation of
Knowledge process of ER
process of ER Diagram ER Diagram to Schema Lack of understanding
Demonstration Diagram to Schema
to Schema mapping mapping
mapping
Proper citations
Usage of Library Citations are partially Citations are not much Citations are not
mentioned in the
resources relevant relevant available.
poster

CIA 2
MSE- Mid Semester Examinations
CIA 3
CIA Details:
RDBMS Mini Project
Marks: 20
Duration: 30 Minutes(Demonstration)
Date: 03-10-2023
Venue: Offline

Assignment Learning Objectives:

To enable students in understanding development of backend for identified problems.
To test the presentation skills in communication and Software development

Assessment Strategies aligned to LO:

Appropriate Analysis, Proper organization

Technology Tools used along with their Purpose: PPT and Databases

Evaluation Rubrics
CRITERIA

Area of Evaluation (100-80) % (79-60) % (59-40) % (39-15) % (14-0) %

Detailed and
Average Moderate
Identification n of extensive Good explanation of Minimal explanation
explanation of the explanation of the
Problem Domain and explanation of the the purpose and of the purpose and
purpose and need purpose and need of
Detailed Analysis purpose and need of need of the project need of the project
of the project; the project
the project
Explanation
Minimal
of the
Collects a Moderate explanation of the
Study of the Detailed and specifications
great deal of study of the specifications
Existing extensive and the
information existing and the
Systems and explanation of the limitations of the
and good systems; limitations of
Feasibility of specifications and existing systems not
study of the collects the existing
Project the limitations of the very
existing some basic systems;
Proposal existing systems satisfactory;
systems; information incomplete
limited
information
information
Incomplete Only Some
All objectives of the Objectives of the
Good justification to justification to the objectives of the
proposed work are proposed work are
Objectives the objectives; objectives proposed work are
well defined; Steps either not identified
and Methodology to be proposed; Steps well defined; Steps
to be followed to or not well defined;
Methodology followed is specified are mentioned but to be followed to
solve the defined Incomplete and
Used but detailing is not unclear; without solve the defined
problem are clearly improper
done justification to problem are not
specified specification
objectives specified properly
Completely Good amount of Fair amount of Average amount of
Implementation and implemented and work done with work done with work done with Not completed
Presentation well presented good presented good presented good presented

LAB COMPONENT EVALUATION RUBRICS

OBSERVATION EVALUATION

DETAILS : Observation

DESCRIPTION : Student has to write the algorithm OR to draw ER diagram to solve the given problem.

ASSIGNMENT TYPE: Individual

ASSIGNMENT DETAILS:
Question set will be uploaded in LMS.
Each student has to understand the given problem and has to Design/develop the ER diagram /write Queries in the observation notebook.
After implementation and executing the queries for the problems given,, the result has to be recorded in the observation.
Students have to complete their observations and get it evaluated by their respective faculty members during the same lab. In case a student is
absent due to a genuine reason, he/she will complete the experiment, and show it to the respective teachers before the next lab.

SUBMISSION FORMAT: Observation Note book

MARKS : 20

TENTATIVE DATE : All Lab Hrs.

Venue : Computer Lab

EVALUATION RUBRICS:

Average
Excellent Good
Needs Improvement
Skills (40-69%)
(<40%)
(90-100%) (70-89%)
 Efficient design and
Efficient design but lacking Lacking in both Design and No efficient design and
Algorithm implemented based on
in implementation Implementation poor implementation
scenario

No logical results
Appropriate Results with Appropriate Results without
Output Mistakes in the output
formatting. formatting

RECORD EVALUATION

DETAILS : Record

DESCRIPTION : Student has to record everything in the record note book

ASSIGNMENT TYPE: Individual

ASSIGNMENT DETAILS:
Each student has to record the aim, algorithm, program what they executed in the lab with output and result.
Record will be corrected in the Lab itself.
Viva questions will be asked and marks will be awarded for that.
Lab record needs to be completed when the student comes for the next lab. In case it is not completed, it will be evaluated for 80% of the marks.

SUBMISSION FORMAT: Record

MARKS : 10

TENTATIVE DATE : All Lab Hours

Venue: Computer Lab.

MSE EVALUATION

DETAILS : MSE

DESCRIPTION : Mid Term Lab Examination

ASSIGNMENT TYPE : Individual

ASSIGNMENT DETAILS:
Question to create table and manipulate the values will be given to students. Students are expected to write the query and execute it.
According to the implementation, Marks will be awarded.

SUBMISSION FORMAT : MSE Answer Script and Lab execution

MARKS : 50

TENTATIVE DATE : MSE Examination Time Table

Venue : Lab

EVALUATION RUBRICS:

Excellent Good Average

Needs Improvement
CRITERIA (<40%)
(90-100%) (70-89%) (40-69%)

100% Understanding the Understanding the Understanding the

Write up (20) problem, Efficient design, problem, good design, problem, Average Design, incomplete
Appropriate Logic Appropriate Logic 30 % of Logic Error.

Full Execution with

Execution (20) Full execution Partial execution No execution
formatted results

At Least 70% questions At Least 50% questions Less than 50% questions
Viva (10) All questions answered
answered answered answered

ESE EVALUATION
DETAILS : ESE

DESCRIPTION : End sem Lab Examination

ASSIGNMENT TYPE : Individual

ASSIGNMENT DETAILS:
Questions will be given to students. Students have to design the solution and implement it in Oracle DB.
According to the implementation, Marks will be awarded.

SUBMISSION FORMAT : ESE Answer Script and Lab execution

MARKS : 50

TENTATIVE DATE : ESE Examination Time Table

Venue : Lab

EVALUATION RUBRICS:

Excellent Good Average

Needs Improvement
CRITERIA (<40%)
(90-100%) (70-89%) (40-69%)

100% Understanding the Understanding the Understanding the

Write up (20) problem, Efficient design, problem, good design, problem, Average Design, incomplete
Appropriate Logic Appropriate Logic 30% of Logic Error.

Full Execution with

Execution (20) Full execution Partial execution No execution
formatted results

At least 70% questions At least 50% questions Less than 50% questions
Viva (10) All questions answered
answered answered answered

EVALUATION RUBRICS:

Average
Excellent Good
Skills (40-69%) Needs Improvement (<40%)
(90-100%) (70-89%)

Correctness of algorithm, 10 -20% mistake in the 21-40% mistake in the Above 40% mistake in the
Appropriate format
code and output format format format.

CO-PO MAPPING

PO PO PSO
CO 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO1 2 1 - - 2 - - - - - - - - 3 -
CO2 3 2 1 1 1 - - - - - - - - 2 -
CO3 3 3 2 2 1 - - - - - - - - 1 -
CO4 3 2 1 1 1 - - - - - - - - 2 -
CO5 2 1 - - 2 - - - - - - - - - -
Average 2.6 1.8 1.3 1 1.4 - - - - - - - - 2 -
Mention 3 for HIGH, 2 for MODERATE, 1 for LOW and - for Nil
COURSE OUTCOME ATTAINMENT TARGET
CO Proficiency Level Attainment Level Remarks
 CO1 75% 60%
CO2 75% 60%
CO3 75% 60%
CO4 75% 60%
CO5 75% 60%

Dr Naveen J
Prof. Santhrupth B C
Dr Samisha Shukla
Dr Sathish
Prof. T. Vigneshwaran
Prof. Manjunath Swamy CProf. Chaitra P C
Prepared byReviewed by Approved by (Faculty in-charge) HoD
Page | PAGE15