BMS COLLEGE OF ENGINEERING, BENGALURU-19

(Autonomous Institute, Affiliated to VTU)

BACHELOR OF ENGINEERING

DEPARTMENT
OF
COMPUTER SCIENCE AND ENGINEERING
(DATA SCIENCE)

SCHEME & SYLLABUS

III - IV SEMESTERS
(Academic Year: 2023-24)
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

INSTITUTE VISION

Promoting Prosperity of mankind by augmenting Human Resource Capital through Quality

Technical Education & Training.

INSTITUTE MISSION

Accomplish Excellence in the field of Technical Education through Education, Research and
Service needs of society.

DEPARTMENT VISION
To be recognized as Centre for Quality Education in Computer Science and
Engineering with emphasis on Data Science

DEPARTMENT MISSION
• Enable quality Computer Science education through continually evolving curriculum and
pedagogical techniques.
• Conduct research collaboratively with established research labs and industries contributing
to the futuristic field of Data Science.
• Nurture ethical and skilled professionals by promoting multi-disciplinary thinking in
solving problems of the data-driven world.

1
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

PEO1: Excel in professional career as a Data Science Professional thereby contributing to the
public/private sector or as an entrepreneur.
PEO2: Graduates to pursue higher education and research to upgrade themselves to serve the
global market.
PEO3: Contribute to humankind by solving societal problems and exhibiting professionalism,
team work & ethics.

PROGRAMME OUTCOMES (POs)

PO1: Engineering Knowledge: Apply the knowledge of mathematics, science, engineering

fundamentals, and an engineering specialization to the solution of complex engineering
problems.

PO2: Problem Analysis: Identify, formulate, review research literature, and analyze complex
engineering problems reaching substantiated conclusions using first principles of
mathematics, natural sciences, and engineering sciences.
PO3: Design/Development of Solutions: Design solutions for complex engineering problems
and design system components or processes that meet the specified needs with appropriate
consideration for the public health and safety, and the cultural, societal, and environmental
considerations.

PO4: Conduct Investigations of Complex Problems: Use research-based knowledge and

research methods including design of experiments, analysis and interpretation of data, and
synthesis of the information to provide valid conclusions.

PO5: Modern Tool Usage: Create, select, and apply appropriate techniques, resources, and
modern engineering and IT tools including prediction and modeling to complex engineering
activities with an understanding of the limitations.

PO6: The Engineer and Society: Apply reasoning informed by the contextual knowledge to
assess societal, health, safety, legal and cultural issues and the consequent responsibilities
relevant to the professional engineering practice.

2
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

PO7: Environment and Sustainability: Understand the impact of the professional engineering
solutions in societal and environmental contexts, and demonstrate the knowledge of, and
need for sustainable development.
PO8: Ethics: Apply ethical principles and commit to professional ethics and responsibilities and
norms of the engineering practice.
PO9: Individual and Team work: Function effectively as an individual, and as a member or
leader in diverse teams, and in multidisciplinary settings.

PO10: Communication: Communicate effectively on complex engineering activities with the

engineering community and with society at large, such as, being able to comprehend and
write effective reports and design documentation, make effective presentations, and give
and receive clear instructions.

PO11: Project Management and Finance: Demonstrate knowledge and understanding of the
engineering and management principles and apply these to one’s own work, as a member
and leader in a team, to manage projects and in multidisciplinary environments.
PO12: Life-Long Learning: Recognize the need for, and have the preparation and ability to
engage in independent and life-long learning in the broadest context of technological
change.

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO1: Apply computing theory, algorithms, mathematical and statistical models, optimization
principles using programming languages and tools to effectively formulate and solve data
analysis problems.
PSO2: Apply principles of databases and organize big data sets to derive meaningful insights and
make informed decisions for business processes.
PSO3: Exhibit expertise in teamwork, professional ethics, communication, and documentation
skills during the development of software products, while adhering to established software
engineering methodologies.

3
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Scheme of Instructions
Semester – III
(With effect from the Academic Year 2023-24)

Course Credits Total Marks

Type Course Code Course Title
L T P Credits CIE SEE Total
BS-1 23MA3BSSDM Statistics and Discrete Mathematics 2 1 0 3 50 50 100

ES-1 23DC3ESCOA Computer Organization & Architecture 3 0 0 3 50 50 100

PC-1 23DC3PCDSC Data Structures 3 0 1 4 50 50 100

PC-2 23DC3PCDBM Database Management Systems 3 0 1 4 50 50 100

PC-3 23DS3PCOOJ Object Oriented Programming with Java 3 0 1 4 50 50 100

PC-4 23DS3PCFDS Foundations of Data Science 3 0 0 3 50 50 100

AE-1 23DC3AEFWD Full Stack Web Development 0 0 1 1 50 50 100
NSS
NCMC YOGA Non-credit mandatory Course
PHYSICAL EDUCATION
TOTAL 17 1 4 22 350 350 700

Note: BS: Basic Science Course, ES: Engineering Science Course, PC: Professional Core Course, AE: Ability
Enhancement Course, NCMC: Non-credit mandatory course

4
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Scheme of Instructions
Semester – IV
(With effect from the Academic Year 2023-24)

Course Credits Total Marks

Type Course Code Course Title
L T P Credits CIE SEE Total
BS-2 23MA4BLAO Linear Algebra and Optimization 2 1 0 3 50 50 100

ES-2 23DC4ESTOC Theory of Computation 3 0 0 3 50 50 100

PC-5 23DC4PCOPS Operating Systems 3 0 0 3 50 50 100

PC-6 23DS4PCCON Computer Networks 3 0 0 3 50 50 100

PC-7 23DS4PCMLG Machine Learning 3 0 1 4 50 50 100

PC-8 23DC4PCDAA Design and Analysis of Algorithms 3 0 1 4 50 50 100

AE-2 23DS4AEDVZ Data Visualization using Tools 0 0 1 1 50 50 100
UHV 22MA4AEUHV Universal Human Values 0 1 0 1 50 50 100
NSS
NCMC YOGA Non-credit mandatory Course
PHYSICAL EDUCATION
TOTAL 17 2 3 22 400 400 800
Note: BS: Basic Science Course, ES: Engineering Science Course, PC: Professional Core Course, AE: Ability
Enhancement Course, NCMC: Non-credit mandatory course

5
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Computer Organization and Architecture

Sem III
Course Code: 23DC3ESCOA Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit
No. Topics Hours
Basic Structure of Computers and Instruction Set Architecture: Functional
1 Units, Basic Operational Concepts, Number Representation and Arithmetic 8
Operations, Memory Locations and Addresses, Memory Operations, Instructions,
and Instruction Sequencing, Addressing Modes, Stored program concept.

Introduction to Assembly Language Concepts, Stacks, Subroutines, Additional

2 Instructions, Basic Input/Output: Accessing I/O Devices, Interrupts, Bus 8
Structure, Bus Operation, Arbitration

Memory System: Basic Concepts, Semiconductor RAM Memories, Read-only

3 Memories, Direct Memory Access, Memory Hierarchy, 8

Cache Memories: Mapping Functions, Virtual Memory

Arithmetic: Addition and Subtraction of Signed Numbers, Design of Fast

Adders, Multiplication of Unsigned Numbers, Multiplication of Signed Numbers

4 Fast Multiplication: Bit-Pair Recoding of Multipliers, Carry-Save Addition of 8

Summands, Summand Addition Tree using 3-2 Reducers, Integer Division,
Floating- Point Numbers and Operations: Arithmetic Operations on Floating-
Point Numbers, Guard Bits and Truncation, Implementing Floating-Point
Operations

Basic Processing Unit: Some Fundamental Concepts, Instruction Execution,

Hardware Components, Instruction Fetch and Execution Steps, Hardwired
Control
5 8
Parallel Computer Architecture: Processor Architecture and Technology
Trends, Flynn’s Taxonomy of Parallel Architectures, Memory Organization of
Parallel Computers: Computers with Distributed Memory Organization,
Computers with Shared Memory Organization, Thread-
Level Parallelism: Simultaneous Multithreading, Multicore Processors

6
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher
Year
No.
Carl Hamacher,
1. Computer Organization Zvonko Vranesic, 6th McGraw-
2012
and Embedded Systems Safwat Zaky, Edition Hill
Naraig Manjikian
Parallel Programming for
Thomas Rauber, Gudula 2nd
2. Multicore and Cluster 2013
Runger Edition Springer
Systems
Reference Text Book
Sl.
No. Book Title Authors Edition Publisher Year
Computer Organization and David A. Patterson, 5th
1. Elsevier 2014
Design - The Hardware John L. Hennessy Edition
/Software Interface
Computer Organization & 11th
2. William Stallings Pearson 2018
Architecture Edition

MOOC Course
Sl. Course name Course Year URL
No. Offered
By
1. Computer NPTEL 2022 https://onlinecourses.nptel.ac.in/noc22_cs88/preview
Architecture
and
Organization

Course Outcomes

At the end of the course the student will be able to

CO1 To apply the concepts of basic functional units to demonstrate the working of
computational system.
CO2 To analyze the issues of the processor architecture to improve the efficiency in computer
design.
CO3 To design Memory modules and Arithmetic Logic unit for a given specification by
analysing performance issues.

7
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 2

Proposed Assessment Plan (for 50 marks of CIE)

Tool Remarks Marks

Internals --- 40
QUIZ --- 10
Total 50

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Mandatory One Question to be asked for 20 Marks
Unit-3 Internal Choice Two Questions to be asked for 20 Marks each
Unit-4 Internal Choice Two Questions to be asked for 20 Marks each
Unit-5 Mandatory One Question to be asked for 20 Marks

8
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Data Structures
Semester III
Course Code: 23DC3PCDSC Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit
No. Topics Hours
1 8
Introduction To Data Structure: Data Management concepts, Data
types – primitive and non-primitive, Types of Data Structures- Linear &
Non-Linear Data Structures. Structures and pointers

Dynamic memory allocation: allocating a block of memory: Malloc,

allocating multiple blocks of memory: Calloc, Releasing the used space:
Free Altering the size of memory: Realloc.

2 Linear list: Singly linked list implementation, insertion, deletion and 8

searching operations on linear list, circularly linked lists- insertion,
deletion and searching operations for circularly linked lists, doubly
linked list implementation, insertion, deletion and searching operations,
maintaining directory of names, Manipulation of polynomials (addition),
representing sparse matrices.

3 Stacks: Operations, array representations of stacks, stack applications - 8

infix to postfix conversion, postfix expression evaluation, and function
call tracing, recursion.

Queues: Introduction, Basic concept, linear queue operations, circular

queue, priority queues, double ended queues. Applications of Queues.

Stack and queue implementation using linked lists

4 8
Trees: Definitions, tree representation, properties of trees, Binary tree,
Binary tree representation, binary tree properties, binary tree traversals,
binary tree implementation, Binary Search Tree operations and its
implementation, applications of trees.

5 Balanced Trees: AVL Trees, Splay trees, Red- Black Trees – 8

Definitions, Rotation and other basic operations.

9
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year
No.
Fundamentals of Horowitz, Sahni, Universities 2008
1. Data Structures in C Second
Anderson Freed Press
Oxford 2014
Data Structures using
Reema Thareja Second University
2. C
press
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
Data Structures using Aaron M. Tenenbaum, Fifth Pearson 2007
1.
C Yedidyah Langsam, Education
Moshe J. Augenstein
Data Structures - A First Cengage 2005
2 Richard F. Gilberg
Pseudocode Approach Learning
Behrouz A. Forouzan
with C

E-Book

Sl. No. Book Title Authors Edition Publisher Year URL

1. Data Structures E. Balaguruswamy McGraw 2013 https://dokumen.pub/dat

using C Hill a-structures-using-c-
9781259029547-
1259029549.html

2. Data structures Robert L. Kruse, Second Prentice 1997 https://cdn.preterhuman.

and Clovis L. Hal net/texts/math/Data_Str
program design Tondo, Bruce P. ucture_And_Algorithms
in C Leung /Data%20Structures%2
0and%20Program%20D
esign%20in%20C++%2
0-
%20Robert%20L.%20K
ruse.pdf

10
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

MOOC Courses
Sl. Course name Course Year URL
No. Offered By
https://www.coursera.org
Data Structures Coursera 2023
1 /learn/data-structures
Data Structures and https://nptel.ac.in/
2 NPTEL 2023
Algorithms courses/106102064/

Course Outcomes

At the end of the course the student will be able to

CO1 Apply the concept of linear and nonlinear data structures for computing problems.

CO2 Analyse the appropriate data structure operations for a given problem
Design and develop solutions using the linear and nonlinear data structure for a
CO3
given specification.
CO4 Conduct experiments for demonstrating the operations of different data structures.

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 3
CO4 3 3 1

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 20
QUIZ/AAT 1 5
Lab Component CIE+ Two Lab Tests 25
Total 50

11
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Laboratory Plan
Instructions to Students to be followed in each lab:

1. Each Student should write down the program in the observation book and get it evaluated by the
respective lab faculty in-charge and then execute the program.

2. Each Student should bring the lab record with the programs and output written for the programs
completed in their respective previous week and get it evaluated by the lab faculty in-charge. In the record
book students should - Handwrite the Program - Pasting of the printout of the Output or Handwriting of
the Output (Output should be written for all the cases).

3. Students have to practice following list of programs and additional programming exercises will also be
given in lab. Students will be made to solve coding challenges on programming platforms like LeetCode
and HackerRank.
Program
Lab
Unit# Program Details

Write a program to implement Singly Linked List with following

operations
1 2 a) Create a linked list.
b) Insertion of a node at first position, at any position and at end of list.
c) Display the contents of the linked list.
Write a program to Implement Singly Linked List with following
operations
2 2 a) Create a linked list.
b) Deletion of first element, specified element and last element in the list.
c) Display the contents of the linked list.
Write a program to Implement Singly Linked List with following
operations
3 2 a) Sort the linked list.
b) Reverse the linked list.
c) Concatenation of two linked lists
Write a program to Implement doubly linked list with primitive
operations
a) Create a doubly linked list.
4 2
b) Insert a new node to the left of the node.
c) Delete the node based on a specific value
d) Display the contents of the list
Write a program to simulate the working of stack using an array with the
following: a) Push b) Pop c) Display
5 3
The program should print appropriate messages for stack overflow, stack
underflow
Write a program to convert a given valid parenthesized infix arithmetic
expression to postfix expression. The expression consists of single
6 3
character operands and the binary operators + (plus), - (minus), *
(multiply) and / (divide)

12
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Write a program to simulate the working of a queue of integers using an

array. Provide the following operations
7 3 a) Insert b) Delete c) Display
The program should print appropriate messages for queue empty and
queue overflow conditions
Write a program to simulate the working of a circular queue of integers
using an array. Provide the following operations. a) Insert b)
8 3 Delete c) Display
The program should print appropriate messages for queue empty and
queue overflow conditions
Write a program to implement Stack & Queues using Linked
9 3
Representation
Write a program
a) To construct a binary Search tree.
10 4 b) To traverse the tree using all the methods i.e., in-order, preorder and
post order
c) To display the elements in the tree.
Write a program
a. To construct a binary search tree
11 4
b. To implement iterative in order traversal
c. To delete a given element
12 5 Write a program to construct an AVL tree of integers

SEE Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Questions to be asked for 20 Marks each
Unit-3 Mandatory One Question to be asked for 20 Marks
Unit-4 Internal Choice Two Questions to be asked for 20 Marks each
Unit-5 Mandatory One Question to be asked for 20 Marks

13
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Database Management Systems

Semester III
Course Code: 23DC3PCDBM Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit
Topics Hours
No.

1 Introduction to Database Systems: Introduction, An Example, Characteristics of 8

Database approach, Advantages of using DBMS approach, when not to use a
DBMS.
Database System Concepts and Architecture: Data models, Schemas and
instances, Three schema architecture.
SQL: SQL Data Definition and Data Types specifying basic constraints in SQL,
Basic retrieval queries in SQL, Insert, Delete and Update statements in SQL,
Additional features of SQL, more complex SQL Queries, Specifying Constraints as
Assertions and Triggers, Views (Virtual Tables) in SQL, Schema Change Statement
in SQL.

2 Entity Relation Model: Using High-Level Conceptual Data Models for Database 8
Design, a sample Database Application, Entity types, Entity Sets, Attributes and
Keys, Relationship Types, Relationship Sets, Roles and Structural Constraints,
Weak Entity types, Refining the ER Design, ER Diagrams, Relationship Types of
Degree Higher than two, Relational Database Design using ER to Relational
Mapping.
Relational Databases: Relational Model Concepts, Relational Model Constraints
and Relational Database Schemas, Update Operations, Transactions and Dealing
with Constraint Violations, Functional Dependencies

3 Relation Algebra: Unary Relational Operations: SELECT and PROJECT, 8

Relational Algebra Operations from Set Theory, Binary Relational Operations:
JOIN and DIVISION, Additional Relational Operations, Examples of Queries in
Relational Algebra.
Normalization: Informal Design Guidelines for Relation Schemas, Functional
Dependencies, Normal Forms Based on Primary Keys, General Definitions of
Second and Third Normal Forms, Boyce-Codd Normal Form, Multi-valued
Dependencies and a Fourth Normal Form, Join Dependencies, Fifth Normal Form.

14
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

4 Transaction Processing Concepts: Introduction to Transaction Processing, 8

Transaction and System Concepts, Desirable Properties of Transactions,
Characterizing Schedules Based on Recoverability, Characterizing Schedules
Based on Serializability, Transaction Support in SQL, Two-Phase Locking
Techniques for Concurrency Control.

5 Storage Systems: Overview of Physical Storage Media, Storage Interfaces, 8

Magnetic Disks, Flash Memory, RAID, Disk-Block Access, Database Backup and
Recovery from Catastrophic Failures
Indexing: Basic Concepts, Ordered Indices, B+-Tree Index Files, B+-Tree
Extensions, Hash Indices, Multiple-Key Access, Creation of Indices, Write-
Optimized Index Structures, Bitmap Indices, Indexing of Spatial and Temporal
Data
Query processing & operations

Prescribed Text Book

Sl.
Book Title Authors Edition Publisher Year
No.

1. Fundamentals of Database Systems Elmasri and Navathe 7th Pearson 2016

Edition

2. Database System Concepts Silberschatz, H Korth 7th McGrawHill 2019

and S Sudarshan Edition

Reference Text Book

Sl. Book Title Authors Edition Publisher Year

No.

1. Database Management Systems Ramakrishnan and 3rd

McGrawHill 2014
Gehrke Edition

2. Database Systems: Design, Peter Rob and 8th

CENGAGE 2009
Implementation, and Management Carlos Edition Learning
Coronel

15
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

E-Book

Sl.
Book Title Authors Edition Publisher Year URL
No.

1. An Hugh Third Ventus 2012 https://www.e-

Introduction Darwen Edition Publishing booksdirectory.com/details.php
to ApS ?ebook=3093
Relational
Database
Theory

2. Database Hector Second Pearson 2009 https://people.inf.elte.hu/miiqaa

System The GarciaMolina,Jeffr Edition Education i/elektroModulatorDva.pdf
Complete eyD. Ullman,
Book Jennifer Widom

MOOC Course

Sl. Course
Course name Year URL
No. offered by

1. Database SWAYAM 2023 https://onlinecourses.swayam2.ac.in/cec23_cs10/preview

Management
Systems

2. Database Coursera 2023 https://www.coursera.org/learn/database-management

Management
Essentials

Course Outcome

At the end of the course the student will be able to

CO1 Apply the concepts of database management systems for various applications.

CO2 Analyse the given database concepts to its correctness.

CO3 Design and demonstrate conceptual models, query and optimization.

CO4 Ability to conduct experiments to demonstrate the various SQL query processing

16
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 3
CO4 3 3

Proposed Assessment Plan (for 50 marks of CIE)

Tool Remarks Marks

Internals 2 25

QUIZ 1 5

Lab Component CIE + Lab Test 25

Total 50

Laboratory Plan

1. Each Student should write down the work carried out and the outputs in the observation book and
get it evaluated by the respective lab faculty in-charge.

2. Students have to practice following SQL queries and additional exercises will also be given in the
lab.

Sl.No. Program Details

1 Sailor Database

2 Supplier Database

3 Salesman Database

4 Movie Database

5 Employee Database

17
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

PROGRAM 1: SAILOR DATABASE

Create tables for the following schema:
SAILOR (sid: integer, sname: string, rating: integer, age: real)
BOAT (bid: integer, bname:string, color:string)
RESERVES (sid: integer, bid: integer, day: date)
Queries:
1) Add the required constraints on the created tables.
2) Populate the relations with at least 5 tuples each.
3) Select names and ages of all sailors. Rename same as ‘Sailor Name’
4) Find all sailors with a rating above 7
5) Find the sid of sailors who have reserved a red boat
6) Find the colors of boats reserved by ‘Shyam’
7) Delete all boats which have never been reserved.

PROGRAM 2: SUPPLIER DATABASE

Create tables for the following schema:

SUPPLIER (sid: integer, name: string, address: string)

PART (pid: integer, name: string, color: string)
CATALOG (sid: integer, pid: integer, cost: real)

Queries:

1) Add the required constraints on the created tables.

2) Populate the relations with at least 5 tuples each.
3) Select the ID and names of all the suppliers.
4) Select the most costly part available in the catalog.
5) Find the name’s of parts for which there is some supplier.
6) Find the sids of suppliers who supply a red part and a green part.
7) Delete all parts of a given ID.

PROGRAM 3: SALESMAN DATABASE

Create tables for the following schema:

SALESMAN (Salesman_id:integer, Name:string, City:string, Commission:integer)

CUSTOMER (Customer_id:integer, Cust_Name:string, City:string)
ORDERS (Ord_No:integer, Purchase_Amt:real, Ord_Date:date, Customer_id:integer,
Salesman_id:integer)

18
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Queries:

1) Add the required constraints on the created tables.

2) Populate the relations with at least 5 tuples each.
3) Select the ID and names of all the customers.
4) Select the salesman with the highest commission.
5) List all the orders placed in descending order of their purchase amount.
6) Select customers who have salesmen in their cities.
7) Delete all orders placed before Jan 2018.

PROGRAM 4: MOVIE DATABASE

Consider the schema for M ovie Database:

ACTOR(Act_id, Act_Name, Act_Gender)

DIRECTOR(Dir_id, Dir_Name, Dir_Phone)
MOVIES(Mov_id, Mov_Title, Mov_Year, Mov_Lang, Dir_id)
MOVIE_CAST(Act_id, Mov_id, Role)
RATING(Mov_id, Rev_Stars)

Queries:

i.List the titles of all movies directed by ‘Hitchcock’.

ii.Find the movie names where one or more actors acted in two or more movies.
iii.List all actors who acted in a movie before 2000 and also in a movie after 2015 (use JOIN
iv.operation).
v.Find the title of movies and number of stars for each movie that has at least one rating and find
the highest number of stars that movie received. Sort the result by movie title.
vi.Update rating of all movies directed by ‘Steven Spielberg’ to 5.

PROGRAM 5: EMPLOYEE DATABASE

Create the following Tables:

LOCATION
Location_ID Regional_Group
122 NEW YORK
123 DALLAS
124 CHICAGO
167 BOSTON

19
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

DEPARTMENT
Department_ID Name Location_ID
10 ACCOUNTING 122
20 RESEARCH 124
30 SALES 123
40 OPERATIONS 167

JOB
Job_ID Function
667 CLERK
668 STAFF
669 ANALYST
670 SALESPERSON
671 MANAGER
672 PRESIDENT

EMPLOYEE
EMPLOY LAST_ FIRST_ MIDDLE_ JOB MANAG HIRE SAL CO DEPARTM
EE_ID NAME NAME NAME _ID ER_ID DATE ARY MM ENT_ID
7839 MEGAN JOHN S 672 NULL 12- 5500 NUL 30
DEC- L
14
7369 SMITH JOHN Q 667 7521 17- 800 NUL 20
DEC- L
18
7499 ALLEN KEVIN J 670 7507 20- 1600 300 30
FEB-17
7505 DOYLE JEAN K 671 7839 04- 2850 NUL 30
APR- L
15
7506 DENNIS LYNN S 671 7839 15- 2750 NUL 30
MAY- L
15
7507 BAKER LESLIE D 671 7839 10- 2200 NUL 40
JUN-15 L
7521 WARK CYNTHI D 670 7505 22- 1250 500 30
A FEB-15

20
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Queries based on the above tables:

Order By Clause:
1. List out the employee id, last name in ascending order based on the employee id.
2. List out the employee id, name in descending order based on salary column
Group By & Having Clause:
3. How many employees who are working in different departments wise in the organization
4. List out the department wise maximum salary, minimum salary, average salary of the
employees
5. List out the job wise maximum salary, minimum salary, average salaries of the employees.
6. List out the no.of employees joined in every month in ascending order.
7. How many employees joined in 1985?
8. How many employees joined in March 1985.
9. Which is the department id, having greater than or equal to 3 employees joined in April1985.
Sub-Queries
10. Display the employee who got the maximum salary.
11. Display the employees who are working in Sales department
12. Display the employees who are working as “Clerk”.
13. Display the employees who are working in “New York”
14. Find out the number of employees working in the “Sales” department.
15. Delete the employees who are working in the accounting department.
16. Display the second highest salary drawing employee details.
Subquery operators: (ALL, ANY, SOME, EXISTS)
17. List out the employees who earn more than every employee in department 30.
18. List out the employees who earn more than the lowest salary in department 30.
19. Find out which department does not have any employees.
Simple join
20. List our employees with their department names
21. Display employees with their designations (jobs)
22. How many employees are working in the sales department?
Non – Equi Join:
23. Display employee details with salary grades.
24. List out the no. of employees on grade wise.
Self-Join:
25. Display the employee details with their manager names.
26. Display the employee details who earn more than their manager’s salaries.
Outer Join:
27. Display employee details with all departments.
28. Display all employees in sales or operation departments.
Set Operators:
29. List out the distinct jobs in Sales and Accounting Departments.
30. List out the ALL jobs in Sales and Accounting Departments.
31. List out the common jobs in Research and Accounting Departments in ascending order.

21
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Questions to be asked for 20 Marks each

Unit-3 Internal Choice Two Questions to be asked for 20 Marks each

Unit-4 Mandatory One Question to be asked for 20 Marks

Unit-5 Mandatory One Question to be asked for 20 Marks

22
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Object Oriented Programming with Java

Semester III
Course Code: 23DS3PCOOJ Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit Topics Hours

No.
1 Introduction to Java: Java’s Lineage, The Bytecode, The Java Buzzwords. 8
An overview of Java: Object oriented programming, Structure of a Java Program,
Datatypes and Arrays.

Introducing classes: Class fundamentals, Declaring objects, Assigning object

reference variables, Introducing methods, Constructors, this keyword, Garbage
Collection, A Stack class.

Methods and classes: Overloading methods, Objects as parameters, argument

passing, Returning objects.
2 Inheritance: Basics, Using super, Multilevel hierarchy, When constructors are 8
executed, Method overriding, Dynamic method dispatch, Abstract classes, Using
final with inheritance.

Packages and Interfaces: Packages, Access Protection, Importing packages,

Interfaces, Default interface methods.
3 Exception Handling: Fundamentals, types, Uncaught exceptions, Try and catch 8
blocks, multiple catch, nested try, throw, throws, finally, Creating own exceptions.

Multithreaded programming: Java thread model, The main thread, Creating a

thread and multiple threads, Using isAlive() and join(), Thread Priorities,
Synchronization.

4 File I/O Basics, Reading console input, Writing console output, Print writer class, 8
Reading and writing files, Closing a file.

String Handling: The String Constructors, String Length, Special String

Operations, Character Extraction, String Comparison, Searching Strings,
Modifying a String, Changing the Case of Characters Within a String, Joining
Strings, StringBuffer.

23
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

5 Generics: Type Wrappers, Auto boxing, A simple generic example, Generic Class 8
with two type parameters, The General Form of a Generic Class.

Collections Framework: Overview, Collection classes - ArrayList Class,

LinkedList Class, HashSet Class, TreeSet Class, ArrayDeque Class.

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year
No.
1. Java : The Complete Reference Herbert Schildt 11 th
McGraw-Hill 2018
Edition Education
2. Programming with Java A Primer E.BalaGuru Swamy 6th
McGraw-Hill 2014
Edition Education
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
1. Introduction to Java Programming Y. Daniel Liang 11 Pearson th
2017
Edition
2. Object Oriented Programming Rajkumar Buyya, 1 Tata McGraw
st
2009
with Java: Essentials and Thamarai Selvi, Xing Edition Hill Education
Applications

E-Book
Sl. No. Book Authors Edition Publisher Year URL
Title
1. The Art Eric S. - Greg Tobin 2007 http://people.reed.edu/
and Roberts ~jerry/121/materials/ artsciencejava.pdf
science
of Java
2. Java Wikibooks 7th Edition wikibooks.o 2016 https://upload.wikimedia.org/wikipedia/co
Program Contributors rg mmons/e/e7/Java_Programming.pdf
ming

24
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

MOOC Course
Sl. Course name Course Year URL
No. Offered By
1. Object Oriented Udacity 2022 https://www.udacity.com/course/java-programming-
Programming in basics--ud282
Java

2. Java Swayam 2023 https://onlinecourses.swayam2.ac.in/aic20_sp13/previe w

NPTEL

Course Outcomes
At the end of the course the student will be able to
CO1 Apply the knowledge of Java concepts to find the solution for a given problem.
CO2 Analyse the given Java application for correctness/functionalities.
CO3 Develop Java programs / applications for a given requirement.
CO4 Conduct practical experiments for demonstrating features of Java.

CO-PO mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 3
CO4 3 1 1

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 20
QUIZ 1 5
Lab Component CIE + 2 Lab tests 25
Total 50

Laboratory Plan
Instructions to Students to be followed in each lab:

1. Each Student should write down the work carried out and the outputs in the observation book and get
it evaluated by the respective lab faculty in-charge.

25
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

2. Each Student should bring the lab record with the programs and output written for the
programs completed in their respective previous week and get it evaluated by the lab faculty
in-charge.

3. Students have to practice following list of programs and additional programming exercises will also be
given in lab. Students will be made to solve coding challenges on programming platforms like
LeetCode and HackerRank.
Program
Lab
Program Details

Create a class to represent a bank account with data members : Account no,
Account holder name, Address and Balance amount. Create member methods to
assign initial value to the account, deposit an amount, withdraw an amount after
1
checking balance and display account holders name and balance. Write a main
method for the above class that reads the initial values from the keyboard and
invokes the appropriate methods.

Create a class named RetailItem that holds data about an item in a retail store.
The class should have the following fields:

• Description - The description field references a String object that holds a brief
description of the item.
• Units - The units field is an int variable that holds the number of units
2 currently in inventory.
• Price - The price field is a double that holds the item’s retail price.

Write a constructor that accepts arguments for each field, appropriate mutator
methods that store values in these fields, and accessor methods that return the
values in these fields. Write the main method which creates three RetailItem
objects and invokes appropriate methods.

Write a program in java to define a class Shape which has data members and a
member function showArea(). Derive two classes Circle and Rectangle from
3
Shape class. Add appropriate data members and member functions to calculate
and display the area of Circle and Rectangle.

Write a program that has an Interface I which is extended by I1 and I2.

Interface I12 inherits from both I1 and I2. Each interface declares one constant
4
and one method. Class DemoI implements I12. Instantiate DemoI and invoke
each of its methods. Each method displays one of the constants.

Define Create a package named mypack, containing a class AreaTriangle in

5
which a method Area() finds area of a triangle and returns area. Import this
package in another class Triangle which is in package mypack1. The Triangle

26
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

class invokes the Area() method from mypack and displays the area of triangle.
Member variables can be considered as per the program requirement.

Create a base class called “Father” and derived class called “Son” which extends
the base class. In Father class, implement a constructor which takes the age and
6 throws the exception WrongAge( ) when the input age<0. In Son class, implement
a constructor that checks both father and son’s age and throws an exception if
son’s age is >=father’s age.

Consider a bank offering online access to its customers to perform transactions.

Suppose there are two transactions of deposit and withdrawal for a particular
7
account simultaneously which leads to race condition. Develop a solution to avoid
unpredictable situations with a program.

Implement a class that checks whether a given number is a prime using both the
8
Thread class and Runnable interface.

Write a program to copy the content of File1.txt to another file File2.txt. by

9
reading the file name as command line arguments.

Illustrate the following string operations using String object.

i) Difference of equals() method and == operator
10
ii) Check whether the string is palindrome or not
iii) To convert the string into character array

Create a Class Gen which implements a stack using generics. Ensure that
11 the stack never overflows and the main method would invoke the stack methods
in class Gen by passing integer and floating-point numbers.

Write a program to create a new array list, add some colors (string) and perform
the following operations:
i.Add elements of List to ArrayList
12 ii.Copy ArrayList to Array
iii.Reverse ArrayList content
iv.Get Sub list from an ArrayList.
v.To sort a given ArrayList

27
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Questions to be asked for 20 Marks each
Unit-3 Mandatory One Question to be asked for 20 Marks
Unit-4 Mandatory One Question to be asked for 20 Marks
Unit-5 Internal Choice Two Questions to be asked for 20 Marks each

28
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Foundations of Data Science

Semester III
Course Code: 23DS3PCFDS Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit
No. Topics Hours
Introduction to Data Science: Describing Data science, The data science Venn
diagram, Python for Data Science, Data science case studies
1 Types of Data: structured versus unstructured data, quantitative versus qualitative 8
data, the four levels of data: nominal, ordinal, interval and ratio
Total information awareness, Bonferroni’s Principle, Rhine’s paradox.
The Data Science Process: Overview, defining research goals, retrieving data,
Cleansing, integrating and transforming data, exploratory data analysis, Build the
models, Presenting findings. Data Analytics Lifecycle.

Statistics & Probability: Statistics, Obtaining data, Sampling Data, Statistical

measures, empirical rule. Points estimates, Sampling distributions, Confidence
2 intervals, Hypothesis Tests: Conducting a hypothesis test, one sample t-tests, Type 8
I and type II errors, Hypothesis testing for categorical variables

Information Gain & Entropy, Probability Theory, Probability Types, Probability

Distribution Functions, Bayes’ Theorem, Inferential Statistics
Correlation Analysis: Types of correlation, correlation coefficient.
Regression Analysis: Linear Regression: Simple Linear Regression, Multilinear
3 Regression, p-values, Logistic Regression, Multinomial logistic regression, Time- 8
Series Model, Receiver Operating Characteristic
Dealing with missing data: single and multiple data imputation, Entropy based
techniques, Monte Carlo and MCMC simulations;
Correcting inconsistent data: Deduplication, Entity resolution, Pairwise
4 Matching; Fellegi-Sunter Model 8

Dimensionality Reduction: Eigenvalues and Eigenvectors of Symmetric Matrices:

Definitions, Computing Eigenvalues and Eigenvectors, Finding Eigenpairs by
Power Iteration, Eigenvector matrix
Principal-Component Analysis: Example, Using Eigenvectors for Dimensionality
Reduction, The matrix of distances
Singular-Value Decomposition: Definition, interpretation, Dimensionality
Reduction Using SVD, Why Zeroing Low Singular Values Works, Querying Using
Concepts, Computing the SVD of a Matrix

29
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Data Analytics on Text: Major Text Mining Areas – Information Retrieval – Data
Mining – Natural Language Processing NLP) – Text analytics tasks: Cleaning and
5 Parsing, Searching, Retrieval, Text Mining, Part-of-Speech Tagging, Stemming, 8
Text Analytics Pipeline. NLP: Major components of NLP, stages of NLP, and NLP
applications.

Prescribed Text Book

Sl.
Book Title Authors Edition Publisher Year
No.
Sinan Qzdemir, Sunil
Second
1. Principles of Data Science Kakade & Macro Packt 2018
Edition
Tibaldeschi

Sanjeev Wagh, Manisha

First
2. Fundamentals of Data Science Bhende, Anuradha CRC Press 2022
Edition
Thakare,

Introducing Data Science: Big

Davy Cielen, Arno D.B.
3. Data, Machine Learning, and - Manning 2016
Meysman, Mohamed Ali
More
Reference Text Book
Sl.
Book Title Authors Edition Publisher Year
No.
Rachel Schutt, Cathy
1. Doing Data Science - O’Reilly 2014
O’Neil
Jure Leskovec, Anand
Dreamtech
2. Mining Massive Datasets Rajaraman, Jeffrey D 2nd
2016
Press
Ullman

30
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

E-Book
Sl.
Book Title Authors Edition Publisher Year URL
No.
DirkP.Kroese,
https://people.smp
ZdravkoI Botev, University
Data Science & .uq.edu.au/DirkKr
1. ThomasTaimre, - of 2023
Machine Learning oese/DSML/DSM
RadislavVaisma Queensland
L.pdf
n
https://32net.id/bu
Alex J. Gutman kaheula/share/QP
Becoming a Data
2. Jordan - Wiley 2021 2cf2JLdeOPn00y
Head
Goldmeier 3Nyu8aXHp1Slq
1bc6P4YcuI4.pdf

MOOC Course
Sl. Course Course
Year URL
No. name Offered By
IBM Data https://www.coursera.org/professional-certificates/ibm-
1. Coursera 2023
Science data-science
Foundations
2. of Data SWAYAM 2023 https://onlinecourses.swayam2.ac.in/imb23_mg64/preview
Science

Course Outcomes

At the end of the course the student will be able to

CO1 Gain fundamental knowledge on data science

CO2 Analyse and visualize data for knowledge representation.
CO3 Demonstrate proficiency in data analysis.
CO4 Conduct experiments to demonstrate the use of various data science tools

31
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2 3
CO3 3
CO4 3 3

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 40
QUIZ/AAT 2 10
Total 50

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Questions to be asked for 20 Marks each
Unit-3 Internal Choice Two Questions to be asked for 20 Marks each
Unit-4 Mandatory One Question to be asked for 20 Marks
Unit-5 Mandatory One Question to be asked for 20 Marks

32
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Full Stack Web Development

Semester III
Course Code: 23DC3AEFWD Total Contact Hours: 20 hours
L-T-P: 0-0-1 Total Credits: 1

Introduction:
1. This course focuses on developing comprehensive skills in Full Stack Web
Application Development. Students will learn to develop both front-end and back-
end components of web applications, integrate with databases and external services,
and apply best practices in web development.
2. Under this project work, student should develop Advanced Web based Application
using technologies such as PHP, Python, Node JS, React, Angular.
3. Students can form a group with minimum of two and maximum of four.
4. Teacher allotted for project work to students should teach full stack technologies like
Node JS, React,
etc., during Class/Lab hours as per the allotment. Teacher allotted for project work
should guide the students in choosing the topic and towards carrying out project
work and complete the evaluation of assigned students.

Course Outcomes
At the end of the course the student will be able to

CO1 Apply full-stack web development technologies to solve real-world problems.

CO2 Design and develop user-centric web applications focused on social and
environmental issues.
CO3 Integrate front-end and back-end components effectively with databases and
external services.
CO4 Demonstrate teamwork and problem-solving skills in project development.

33
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3 3

CO2 3 3 3 3

CO3 3 3

CO4 3 3 3

Rubrics for Project Evaluation:

Criteria Excellent Good (3 Satisfactory (2 Needs

Marks) Marks) Improvement
(0-1 Marks)
Problem (10 Marks) (7 Marks) (5 Marks) (0-2 Marks)
Identification Clearly articulates a Recognizes a Identifies a Fails to identify
& Relevance significant pertinent issue basic issue a relevant issue
(10) social/environmenta and offers with standard or solution.
l issue with practical solutions.
insightful, solutions.
innovative solutions.
Technical (10 Marks) (7 Marks) (5 Marks) (0-4 Marks)
Implementatio Exemplary Reliable and Basic Inadequate or
n implementation of proficient implementatio incomplete
(10) full-stack technical n incorporating technical
technologies, performance, essential implementation
showcasing meeting key features and .
efficiency, objectives. functionalities.
scalability, and
technical excellence.
User (10 Marks) (7 Marks) (5 Marks) (0-4 Marks)
Experience & Exceptional UI/UX Competent UI Basic UI Poor or non-
Interface design, prioritizing design focused design functional user
(10) intuitiveness and on usability and encompassing interface,
user-friendliness, functionality. essential lacking in user-
with a professional functions and centricity.
standard of user needs.
execution.

34
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Group (5 marks) (4 marks) (2 marks) (0 marks)

Participation
Exhibits active Consistent Minimal but Lack of active
(5)
engagement, participation noticeable participation
exceptional and participation and
collaboration, and constructive and occasional collaboration in
effective teamwork collaboration contributions. the group.
throughout the within the
project lifecycle. group.
Presentation (5 marks) (4 marks) (2 marks) (1 marks)
(5)
Professional, Well-structured Basic Disorganized
engaging presentation presentation presentation
presentation with with clear with some lacking in
outstanding visuals content and structure and coherence and
and comprehensive effective varying adequate
content, delivery. delivery content.
demonstrating quality.
exceptional delivery
skills.
Report & (10 marks) (7 marks) (5 marks) (2-4 marks)
Documentation
Comprehensive Well-structured Basic report Poorly
(10)
report covering all report with with limited structured and
project aspects with detailed content, incomplete
meticulous coverage of covering report, lacking
documentation, project essential essential
including implementation project details. details.
methodology, .
design, and future
scope.

Laboratory Plan (if applicable)

Sl. Week Activity Content Technologies/Skills to be
No deliverables by Covered
the assigned
teacher

1 1st Formation of groups. Introduction to • Overview of full stack

Note: Full Stack development tools and
Technologies & frameworks.
Student groups of size
2 or 3 or 4

35
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Issue • Overview of web

Identification development (HTML, CSS,
JavaScript),
• Introduction to full stack
frameworks (MEAN,
MERN), Identifying
social/environmental issues
for web solutions.
2 2nd Project topic selection Conceptualizing a • Identifying problem and
by each Group. Web Application understanding social and
Presentation: Student environmental issues.
and Project topic • Brainstorming and planning
introduction by each a web application focused on
group a chosen
social/environmental issue.
• Tools for wireframing and
prototyping (Figma, Sketch),

3 3rd Design Layout of the Basic Front-end • Define layouts based on

Web Pages and Back-end project scope and objectives.
Development • Learning the basics of front-
end (HTML, CSS,
JavaScript) and back-end
(Node.js, Python)
development.
• Front-end: HTML5, CSS3,
JavaScript basics.
• Back-end: Introduction to
Node.js, Express.js,
RESTful API development
4 4th ,5th Front end and back- Data • Techniques for managing
, and end implementation Management and and integrating data in web
6th Integration applications.
• Database technologies
(MongoDB, SQL),
Integrating databases with
back-end (Mongoose for
MongoDB), Basic CRUD
operations.
5 7th Design and • Delving into advanced front-
Development of end technologies (React,
Angular) and back-end

36
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

8th and connecting among Advanced Front- technologies (databases,

9th different web pages end & Back-end server management).
Technologies • Front-end: React.js/Angular
for dynamic UI
Project development.
Development and
• Back-end: Advanced
Mid-term Review
Node.js, Authentication
(JWT, OAuth), Server-side
rendering.
6 Development of the project with
guidance and a mid-term review
to assess progress.

7 10th Presentation by each Integrating • Applying feedback from the

group Feedback & mid-term review and
Refining refining the application for
Applications better performance and
impact.
• Implementing feedback,
Optimization for
performance, Security best
practices (HTTPS, data
validation), User testing and
UX improvements.
8 11th Complete Project Final Project Students present their completed
Work Presentations and projects and submit their final
Submissions work for assessment.
Demonstration by
each group

12th Project Report

Preparation

Prescribed Text Book

Sl.
Book Title Authors Edition Publisher Year
No.

1. Modern Full-Stack Development: Using Type Frank 1st Apress 2020

Script, React, Node.js Zammetti Edition

37
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

2. Beginning MERN Stack, Build and Deploy a Full Greg Lim 2021
Stack MongoDB, Express, React, Node.js App

Tutorial Link:

Sl. No. Links

1 https://www.springboard.com/resources/learning-paths/web-development-python-
django/

2 https://www.coursera.org/learn/introduction-to-web-development-with-html-css-
javacript
3 https://www.boardinfinity.com/micro-learning/full-stack-development-course-with-
certification

4 https://www.udemy.com/course/next-js-the-complete-developers-guide/

5 https://www.udemy.com/course/nextjs-build-full-stack-apps-with-nextjs-using-
redux/

6 https://www.udemy.com/course/beginning-javascript/

38
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Theory of Computation
Sem IV
Course Code: 23DC4ESTOC Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit
Topics Hours
No.
Introduction to Finite Automata: Central Concepts of Automata Theory,
1 Deterministic Finite Automata (DFA), Nondeterministic Finite Automata 8
(NFA), Finite Automata with Epsilon Transition, An Application Text Search.
NP Problems solvable in Polynomial Time, Satisfiability Problem

Regular Expressions and Languages: Regular Expressions, Finite Automata

2 and Regular Expressions, Applications of Regular Expressions, Proving 8
Languages Not to Be Regular, Closure Properties of Regular Languages,
Equivalence and Minimization of Automata

Context Free Grammars and Languages Parse Trees: Context Free

Grammars, Parse trees, Applications of Context Free Grammars, Ambiguity in
3 Grammars and Languages, Eliminating Useless Symbols, Computing the 8
Generating and Reachable Symbols, Eliminating Epsilon Productions,
Eliminating Unit Productions, Chomsky Normal Form, Greibach Normal form

Pushdown Automata: Definition of the Pushdown Automaton, The

4 Languages of a PDA, Equivalence of PDA’s and CFG’s, Deterministic 8
Pushdown Automata, The Pumping Lemma for Context Free Languages,
Closure Properties of Context Free Languages

Introduction to Turing Machine: Problems That Computers Cannot Solve,

The Turing Machine, Programming Techniques for Turing Machines,
5 Extensions to the Basic Turing Machine, Restricted Turing Machines, Turing 8
Machines and Computers, Definition of Post Correspondence Problem, A
Language That Is Not Recursively Enumerable, An Undecidable Problem That
is RE, Other Undecidable Problems

39
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year
No.
1. Introduction to Automata Theory, John E. Hop croft, 3 Edition Pearson 2007 rd

Languages and Computation Rajeev Motwani, Jeffrey

D. Ullman: education

Reference Text Book

Sl.
Book Title Authors Edition Publisher Year
No.
1. Introduction to Languages and John C 3 rd
Tata McGraw- Hill 2007
Automata Theory Martin Edition
2. An Introduction to formal Peter Linz 5 th
Narosa Publishing 2012
Languages and Automata Edition House

E-Book
Sl.
Book Title Authors Edition Publisher Year URL
No.
1. Introduction Anil - Carleton 2019 https://cglab.ca/~michiel
to Theory of Maheshwari, University /TheoryOfComputation/
Computatio Michiel Smid TheoryOfComputation.p
n df

MOOC Course
Course
Sl. Course name Offered
No. Year URL
By
Automata
1. edX 2022 https://www.edx.org/course/automata-theory
Theory
Introduction to
2. Automata, IITB 2022 https://onlinecourses.nptel.ac.in/noc21_cs19/preview
Languages and
Computation
Automata Stanford https://online.stanford.edu/courses/soe-ycsautomata-
3. 2022
Theory University automata-theory

40
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Course Outcomes

At the end of the course the student will be able to

Apply the knowledge of Automata Theory, Grammars & Regular Expressions for the
CO1
given requirement of the formal language.
CO2 Analyze the given Automata to identify the formal language it represents.

Design Automata and Grammar for pattern recognition and syntax checking of the given
CO3
formal language.

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO 10 PO 11 PO 12

CO1 3
CO2 2
CO3 2

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 40
QUIZ/AAT 2 10
Total 50

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Questions to be asked for 20 Marks each
Unit-3 Internal Choice Two Questions to be asked for 20 Marks each
Unit-4 Mandatory One Question to be asked for 20 Marks
Unit-5 Mandatory One Question to be asked for 20 Marks

41
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Operating Systems
Semester IV
Course Code: 23DC4PCOPS Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit Topics Hours

No.
1 Introduction to Operating Systems: What operating systems do, Operating 8
System operations, Process management, Memory management, Storage
management, Protection and security
System Structures: Operating System Services, System calls, Operating System
design and implementation, Operating System structure, System Boot.
2 Processes: Process Concept, Process Scheduling, Operations on Processes, Inter- 8
process Communication.
Threads: Overview, Multi-core Programming, Multithreading Models, Implicit
Threading, Threading Issues.
Process Synchronization-Background, The Critical section problem,
Synchronization hardware, Mutex Locks, Semaphores, Classical problems of
synchronization.

3 CPU Scheduling- Basic concepts, Scheduling criteria, Scheduling algorithms, 8

Multiple-Processor scheduling.
Deadlocks: System Model, Deadlock characterization, Methods for handling
deadlocks, Deadlock prevention, Deadlock avoidance, Deadlock detection and
recovery from deadlock.

4 Memory Management Strategies: Background, Swapping, Contiguous memory 8

allocation, Paging, Structure of page table, Segmentation.
Virtual Memory Management- Background, Demand paging, Page
replacement, Thrashing.
5 Virtual Machines: Overview, Benefits and features, Building Blocks, Types of 8
Virtual Machines and their implementations, Virtualization and Operating
System Components, Protection Rings
Case Study: VMWare

42
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year
No.
1. Operating System Abraham Silberschatz, Peter 9th Edition John Wiley & 2018
Concepts Baer Galvin , Greg Gagne Sons
2. Modern operating systems Andrew Tanenbaum 4th Edition Pearson 2009
Education
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
1. Operating System: William Stallings 8th Edition Prentice Hall 2014
Internals and Design
Principles
2. Schaum's Outline of J. Archer Harris Kindle McGraw-Hill 2001
Operating Systems Edition

E-Book
Sl. Book Title Authors Edition Publisher Year URL
No.
1. Operating Dr. John T.Bell - University of 2013 https://www.cs.uic.edu/~jb
Systems Illinois ell/CourseNotes/Operating
Course Chicago Systems/index.html
Notes
2. Operating Abraham Ninth John Wiley & 2018 https://drive.uqu.edu.sa/_/
System Silberschatz, Edition Sons mskhayat/files/MySubjects
Concepts Peter Baer /2017SS%20Operating%2
Galvin , Greg 0Systems/Abraham%20Sil
Gagne berschatz-
Operating%20System%20
Concepts%20(9th,2012_12
).pdf

43
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

MOOC Course
Sl. Course name Course Year URL
No. Offered By
1. Operating SWAYAM 2023 https://onlinecourses.nptel.ac.in/noc20_cs04/preview
Systems

2. Introduction to Coursera 2023 https://www.coursera.org/specializations/codio-

Operating introduction-operating-systems
Systems

Course Outcomes
At the end of the course the student will be able to
CO1 Apply the different concepts and functionalities of Operating System
CO2 Analyse various Operating system strategies and techniques
CO3 Demonstrate the different functionalities of Operating Systems.

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 2

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks
Internals 2 40
QUIZ/AAT 2 10
Total 50

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks
Unit-2 Internal Choice Two Questions to be asked for 20 Marks each
Unit-3 Internal Choice Two Questions to be asked for 20 Marks each
Unit-4 Mandatory One Question to be asked for 20 Marks
Unit-5 Mandatory One Question to be asked for 20 Marks

44
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Computer Networks

Semester IV

Course Code: 23DS4PCCON Total Contact Hours: 40 hours

L-T-P: 3-0-0 Total Credits: 3

Unit Topics Hours

No.
1 Introduction: Data Communications, Networks, Network Types, Network 8
Models, Protocol Layering, Reference Models: The OSI Reference Model, The
TCP/IP Reference Model, Physical Layer: Data and signals Digital
Transmission, (D-D Conversion) Bandwidth Utilization, Multiplexing,
Switching, Circuit Switched Networks, Packet Switching.

2 Data Link Layer: Link Layer Addressing, Error Detection and Correction, 8
Block Coding, Cyclic Codes, Checksum. Data Link Control: DLC Services,
Data-Link Layer Protocols, Media Access Control, Wired LANs, Ethernet
protocol.

3 Network Layer: Network Layer Services, Packet Switching, Network Layer 8

Performance, IPV4 Addresses. Network Layer Protocols: Internet Protocol,
ICMPV4, Unicast Routing, Routing algorithms, Unicast routing protocols,
Internet Structure, Routing Information Protocol (RIP), Next Generation IP:
IPV6 Addressing, IPV6 Protocol, ICMPv6 Protocol, Transition from IPV4 to
IPV6, Congestion Control Algorithms, QoS

4 Transport Layer: Transport Layer Protocols, User Datagram Protocol, 8

Transmission Control Protocol.

5 Application Layer: Introduction, Standard Client Server Protocols, DNS— 8

The Internet’s Directory Service, SMTP, SNMP, FTP

45
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year

No.

1. Data Communications and Behrouz A Forouzan 5th

McGraw Hill 2013
Networking Edition

2. Computer Networks Andrew S. Tanenbaum, 5th

Pearson 2011
David J. Wetherall Edition

Reference Text Book

Sl. Book Title Authors Edition Publisher Year

No.

1. Data and Computer William Stallings 8th

Pearson 2008
Communication Edition Education

2. Computer Networks – A Larry L. Peterson and 4th

Elsevier 2007
Systems Approach Bruce S. Davie Edition

E-books:

Sl. Book Title Authors Edition Publisher Year URL

No.

1. An Peter L Dordal 1 Edition

st
- 2020 https://intronetworks
Introduction to .cs.luc.edu/current/C
Computer omputerNetworks.p
Networks df

2. A Top-Down James F Kurose & 8 Edition

th
Pearson 2021 https://gaia.cs.umass
Approach: Keith W Ross .edu/kurose_ross/onl
Computer ine_lectures.htm
Networking

46
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

MOOC Course

Sl. Course name Course Year URL

No. Offered
By

1. Computer Coursera 2023 https://www.coursera.org/learn/illinois-tech-

Networking computer-networking

2. NOC: Computer NPTEL https://nptel.ac.in/courses/106105183

Networks and
Internet Protocol
Course Outcomes

At the end of the course, the student will be able to

CO1 Apply the fundamental concepts of communication in networking.

CO2 Analyze the various protocols, and techniques in TCP/IP network architecture

Develop applications that demonstrate the functionalities of physical, Data Link,

CO3
Network, Transport or Application layer

CO-PO mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 3

CO2 3

CO3 3 1

Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 40

QUIZ/AAT 2 10

Total 50

47
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks

Unit-2 Internal Choice Two Question to be asked for 20 Marks each

Unit-3 Internal Choice Two Question to be asked for 20 Marks each

Unit-4 Mandatory One Question to be asked for 20 Marks

Unit-5 Mandatory One Question to be asked for 20 Marks

48
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Machine Learning
Sem IV
Course Code: 23DS4PCMLG Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit
Topics Hours
No.
1 Machine Learning Landscape: Introduction, Types of Machine Learning, 8
Challenges of Machine Learning, Testing and Validating.
Supervised Learning
Decision Tree Learning: Decision tree representation, Appropriate problems for
decision tree learning, Basic decision tree learning algorithm, Issues in Decision tree
learning, CART Training algorithm
2 8
Support Vector Machines: Linear SVM, Non Linear SVM, SVM Regression,
Under the Hood.
Instance Based Learning: Introduction, k-Nearest Neighbor learning
3 Probabilistic Learning 8
Bayesian Learning: Bayes Theorem and Concept Learning, Maximum Likelihood,
Minimum Description Length Principle, Bayes Optimal Classifier, Gibbs Algorithm,
Naïve Bayes Classifier, Bayesian Belief Network, EM Algorithm.
4 8
Ensemble Learning and Random Forests: Voting Classifiers, Bagging and Pasting,
Random Patches and Random Subspaces, Random Forests, Boosting, Stacking
5 Unsupervised Learning Techniques 8
Clustering – Kmeans, DBSCAN, Other Clustering Algorithms, Gaussian Mixtures –
Anomaly Detection, Selecting Clustering, Bayesian Gaussian Mixture Models, Other
algorithms for anomaly and novelty detection
Reinforcement Learning: Markov Decision Process, Introduction, Learning Task,
Q Learning

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year
No.
1. Machine Learning Tom M. First McGraw Hill 2013
Mitchell Education
2 Hands-On Machine Learning with Scikit-Learn, Aurelien Second O’Reilly 2020
Keras & TensorFlow Geron

49
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Reference Text Book

Sl. No. Book Title Authors Edition Publisher Year
1. Introduction to Andreas C Muller & First Shroff 2019
Machine Learning Sarah Guido Publishers
with Python
2. Thoughtful Machine Mathew Kirk First Shroff 2019
learning Publishers

E-Book
Sl. No. Book Title Authors Edition Publisher Year URL
1. The Elements of Trevor Hastie, Second - 2009 https://web.stanford.edu/~
Statistical Learning Robert hastie/Papers/ESLII.pdf
Tibshirani,
Jerome H.
Friedman
2. Machine Learning Peter First Manning 2017 http://www2.ift.ulaval.ca/
in Action Harrington ~chaib/IFT-4102-
7025/public_html/Fichiers
/Machine_Learning_in_A
ction.pdf

MOOC Course
Sl. Course Offered
Course name Year URL
No. By
1. Machine Learning Coursera -- https://www.coursera.org/learn/machine-
learning
2. Introduction to Machine NPTEL 2016 https://swayam.gov.in/nd_noc20_cs29/preview
learning

Course Outcomes

At the end of the course the student will be able to

CO1 Apply different learning algorithms for various complex problems
CO2 Analyze the learning techniques for given dataset
CO3 Design a model using machine learning to solve a problem.
Ability to conduct practical experiments to solve problems using appropriate machine learning
CO4
techniques.

50
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 2
CO3 3
CO4 3

Proposed Assessment Plan (for 50 marks of CIE)

Tool Remarks Marks

Internals 2 25
QUIZ 1 5
Lab Component CIE + 2 Lab Tests 25
Total 50
Laboratory plan

Sl. No Unit# Program Details

Write a program to demonstrate the working of the decision tree based ID3 algorithm.
1 1 Use an appropriate data set for building the decision tree and apply this knowledge to
classify a new sample.

2 2 Develop a program to construct Support Vector Machine considering a Sample Dataset

Write a program to implement k-Nearest Neighbour algorithm to classify the iris data
3 2
set. Print both correct and wrong predictions

Write a program to implement the naïve Bayesian classifier for a sample training data
4 3 set stored as a .CSV file. Compute the accuracy of the classifier, considering few test
data sets

Write a program to construct a Bayesian network considering training data. Use this
5 3
model to make predictions.

Apply EM algorithm to cluster a set of data stored in a .CSV file. Compare the results
6 3
of k-Means algorithm and EM algorithm.

7 4 Implement Boosting ensemble method on a given dataset.

Write a program to construct random forest for a sample training data. Display model
8 4
accuracy using various metrics

9 5 Implement tic tac toe using reinforcement learning

51
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Consider a sample application. Deploy machine learning model as a web service and
10 5
make them available for the users to predict a given instance.

SEE Exam Question paper format

Unit-1 Mandatory One Question to be asked for 20Marks

Unit-2 Mandatory One Question to be asked for 20Marks
Unit-3 Internal Choice Two Questions to be asked for 20Marks each
Unit-4 Internal Choice Two Questions to be asked for 20Marks each
Unit-5 Mandatory One Question to be asked for 20Marks

52
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Design and Analysis of Algorithms

Semester IV
Course Code: 23DC4PCDAA Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit Topics
No. Hours
1 Introduction to Algorithm, Fundamentals of Algorithmic Problem Solving. 8
Analysis of Algorithm Efficiency: The Analysis Framework, Asymptotic
Notations and Basic Efficiency Classes, Mathematical Analysis of Non
Recursive Algorithm, Mathematical Analysis of Recursive Algorithms.

2 Brute-Force: String Matching, Exhaustive Search: TSP, Knapsack 8

Problem, Assignment Problem, Depth-First Search and Breadth-FirstSearch.
Decrease-and-Conquer: Topological Sorting, Algorithms for Generating
Combinatorial Objects: Generating Permutations, Decrease by-a-Constant-
Factor Algorithms: Binary Search, Russian Peasant Multiplication, Variable
Size-Decrease Algorithms: Computing Median and the Selection Problem

3 Divide-and-Conquer: Merge sort, Quicksort, Multiplication of Large 8

Integers and Strassen’s Matrix Multiplication.
Transform-and-Conquer: Presorting, Heaps and Heap sort, Horner’s Rule.
Space and Time Tradeoffs: Horspool Algorithm, Boyer-Moore Algorithm.
4 Dynamic Programming: Coin Problem, The Knapsack Problem, 8
Warshall’s and Floyd’s Algorithms.
Greedy Technique: Prim’s Algorithm, Kruskal’s Algorithm-Without
disjoint subsets and Union Find algorithms, Dijkstra’s Algorithm, Huffman
Trees.
5 Backtracking: n-Queens Problem, Subset-Sum Problem. 8
Branch-and-Bound: Knapsack Problem, Traveling Salesman Problem.
NP-Completeness: Polynomial time, Polynomial-time verification, NP-
completeness and reducibility. NP-Complete Problems: The Clique problem,
The Vertex Cover problem, Approximation Algorithms: The Vertex-Cover
problem.

53
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Prescribed Text Book

Sl. Book Title Authors Edition Publisher Year

No.

1. Introduction to the Design Anany Levitin Third Pearson 2014

and Analysis of Edition
Algorithms

2. Introduction to Algorithms Charles E Leiserson, Third The MIT 2009

Ronald L Rivest, Clifford Edition Press
Stein

Reference Text Book

Sl. Book Title Authors Edition Publisher Year

No.

1. Fundamentals of Ellis Horowitz,Satraj 2ndEdition University 2009

Computer Sahni and Rajasekhara m Press Pvt. Ltd,
Algorithms

2. Analysis and design Padma Reddy Sri Nandi 2009

of Algorithms Publications

E-Books

Sl.
Book Title Authors Edition Publisher Year URL
No.

1. Introduction to K. - Smash words 2013 https://www.smas

Design & Analysis Raghava hwords.com/book
of Algorithms Rao s/view/365630

2. Data structures and Allen Fourth Pearson 2014 http://www.uoitc.

Algorithm Analysis Weiss edition education edu.iq/images/doc
in C++ uments/informati
cs-
institute/Competit
ive_exam/DataStr
uctures.pdf

54
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

MOOC Courses
Sl. Course Course Year URL
No. name Offered
By

Algorithms Coursera 2023 https://www.coursera.org/course/algs4partI

1
Design and
2 Analysis of NPTEL 2023 https://onlinecourses.nptel.ac.in/noc19_cs47/preview
Algorithms

Course Outcomes

At the end of the course the student will be able to

CO1 Apply algorithmic design paradigms to basic computing problems.

CO2 Analyze the time complexity of different algorithms.
CO3 Design efficient algorithms using appropriate algorithm design techniques.
CO4 Conduct experiments to implement algorithms and provide valid conclusions.

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 3
CO2 3
CO3 3
CO4 3 1

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Internals 2 20
QUIZ/AAT 1 5
Lab Component CIE+ Two Lab Tests 25
Total 50

Laboratory Plan

Instructions to Students to be followed in each lab:

1. Each Student should write down the program in the observation book and get it evaluated by
the respective lab faculty in-charge and then execute the program.

55
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

2. Each Student should bring the lab record with the programs and output written for the
programs completed in their respective previous week and get it evaluated by the lab faculty in-
charge. In the record book students should - Handwrite the Program - Pasting of the printout of
the Output or Handwriting of the Output (Output should be written for all the cases).

3. Students have to practice following list of programs and additional programming exercises
will also be given in lab. Students will be made to solve coding challenges on platforms like
LeetCode and HackerRank.

Lab Unit# Program Details

Program
Write program to do the following:
1 2 a. Print all the nodes reachable from a given starting node in a digraph
using BFS method.
b. Check whether a given graph is connected or not using DFS method.

2 2 Write program to obtain the Topological ordering of vertices in a given

digraph.
3 2 Implement Johnson Trotter algorithm to generate permutations

Sort a given set of N integer elements using Merge Sort technique and
4 3 compute its time taken. Run the program for different values of N and
analyze its time complexity.

5 3 Sort a given set of N integer elements using Quick Sort technique and
compute its time complexity.

6 3 Sort a given set of N integer elements using Heap Sort technique and
analyze its time complexity.
7 4 Implement 0/1 Knapsack problem using dynamic programming.

8 4 Implement All Pair Shortest paths problem using Floyd’s algorithm.

9 4 Find Minimum Cost Spanning Tree of a given undirected graph using

Prim/Kruskal’s algorithm.

10 4 From a given vertex in a weighted connected graph, find shortest paths

to other vertices using Dijkstra’s algorithm.
11 5 Implement “N-Queens Problem” using Backtracking.

56
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

SEE Question paper format

Unit-1 Mandatory One Question to be asked for 20 Marks
Unit-2 Mandatory One Question to be asked for 20 Marks
Unit-3 Internal Choice Two Questions to be asked for 20 Marks each
Unit-4 Internal Choice Two Questions to be asked for 20 Marks each
Unit-5 Mandatory One Question to be asked for 20 Marks

57
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Data Visualization using Tools

Semester IV
Course Code: 23DS4AEDVZ Total Contact Hours: 20 hours
L-T-P: 0-0-1 Total Credits: 1

About the course: The course is designed to enhance programming and computation skills of
students by exploring various features and extensive libraries of python programming language
that are necessary for data science applications.

The students should work with a given dataset and create effective visualizations. The course will
be executed in two cycles.

During Cycle 1, the students would be able to implement the key visualization techniques using
Python tools like Matplotlib, Seaborn etc.

In Cycle 2, students will be exposed to industry-standard software tools like Tableau, Google Data
Studio etc. to create compelling and interactive visualization of various types of data.

Prescribed Text Book

Sl.
Book Title Authors Edition Publisher Year
No.

Python Data Science

1. Jake Vander Plas 2nd Edition O’Reilly 2017
Handbook

Seema Acharya ,
Pro Tableau: A Step by Step
2. Subhashini 2nd Edition Apress 2016
Guide
Chellappan

Reference Text Book

Sl.
Book Title Authors Edition Publisher Year
No.

Data Analysis and Visualization Using

1. Python: Analyze Data to Create Sossama Embarak - Apress 2018
Visualizations for BI Systems

Igor Milovanović ,
Second
2. Python Data Visualization Cookbook Dimitry Foures , O’Reilly 2015
Edition
Giuseppe Vettigl

58
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

E-Book

Sl.
Book Title Authors Edition Publisher Year URL
No.

Data
Visualization Kyran https://github.com/jllovet/dataviz-with-py-
1. - O’Reilly 2016
with Python Dale and-js
and JavaScript

Jumpstart
Tableau: A
Step-by-Step Arshad https://link.springer.com/book/10.1007/978-
2. - Apress 2016
Guide to Khan 1-4842-1934-8
Better Data
Visualization

MOOC Course

Sl. Course
Course name Year URL
No. Offered By

https://www.coursera.org/professional-
1. IBM Data Science Coursera 2023
certificates/ibm-data-science

Data Visualization https://www.coursera.org/specializations/data-

2. Coursera 2023
with Tableau visualization

59
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Laboratory Plan

Lab-cycle-1

Sl. Experiment
No.

1 Using the sales_data.csv, create the visualization report for the following using
Matplotlib:
a. Get total profit of all months and show line plot with the following Style
properties.

Generated line plot must include following Style properties:

1. Line Style dotted and Line-colour should be green

2. Show annotation
3. Add a square marker.
4. Add ticks for both X and Y axis
b. Read Bathing soap facewash of all months and display it using the Subplot

2 Using the sales_data.csv, create the visualization report for the following using
Matplotlib:
a. Get total profit of all months and show line plot with the following Style properties

Generated line plot must include following Style properties: –

1. Line Style dashed and Line-colour should be green

2. Show legend at the lower right location.
3. Add ticks for both X and Y axis
4. Line width should be 2
b. Read toothpaste sales data of each month and show it using a bar plot

60
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

3 Using the sales_data.csv, create the visualization report for the following using
Matplotlib:
a. Calculate total sale data for last year for each product and show it using a Pie
chart
1. Print the total sale inside each part
2. Explode the highest sale
3. Set the start angle=60
b. Read face cream and facewash product sales data and show it using the
horizontal bar chart

4 Write a Python programming for the following:

a. to display a horizontal bar chart of the sale of book. Use different color for each
bar.

Sample data:
Programming languages: Fict, Tech, Moti, Business, Nutri, Dev
Sale: 5.2,19.6, 8.7, 8, 7.7, 3.7

1. Add ticks for both axes

2. Show legend at the upper right corner
b. Write a Python program to create a stacked bar plot.

Note: Use bottom to stack the women bars on top of the men bars.
Sample Data:
Means (men) = (22, 30, 35, 35, 26)
Means (women) = (25, 32, 30, 35, 29)

1. Add labels and ticks

2. Use annotation

61
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

5 Write a Python programming for the following:

a. To create a pie chart with a title of the pass percentage of subjects.

Sample data:
Subjects: DSC, OOP, OPS, COA, MAT, Java
Pass percentage (%): 40, 25.6, 8.8, 30, 7.7, 60.7

1. Print percentage inside the chart

2. Use explode property
b. Using the sales_data.csv, read the total profit of each month and show it using
the histogram to see the most common profit ranges

6 Using the dataset planets.csv, create the visualization report for the following using
Seaborn:
a. Get the distance covered year-wise and show scatter plot with the following
properties

1. Add “mass” as additional features

2. Use different markers

3. Control the range of marker areas with sizes

b. Read the orbital_period of each year and show it using the histogram.

7 Using the dataset planets.csv, create the visualization report for the following using
Seaborn:
a. Get the distance covered year-wise and show scatter plot with the following
properties

1. Add “mass” and “method” as additional features

2. Change the default colour palette

3. Display the complete legend

b. Read the distance for each method and show it using the bar chart.

62
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

8 Using the dataset titanic.csv, create the visualization report for the following using
Seaborn:

a. Demonstrate the use of “displot”

b. Plot the distribution using Kernel density estimation.

c. Use lineplot for any two suitable features

d. Generate scatter plot with different color palette

9 Using the dataset titanic.csv, create the visualization report for the following using
Seaborn:

a. Demonstrate the subplots (2x1) on scatter plots

b. Demonstrate the use of violin plot

c. Get different line plots for survival of passengers’ class wise.

d. Create visualization for strip plot without jitter

10 Using the dataset titanic.csv, create the visualization report for the following using
Seaborn:

a. Create a visualization using categorical plot and re-order the axis contents

b. Demonstrate the use of violin plot

c. Demonstrate the subplots (1x3) on line plots

d. Generate scatter plot with different color palette

63
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Lab-cycle-2

Sl. Experiment
No.

1 Create the visualization using Tableau for the “Corriander_seed_2021.csv” dataset.

a. Demonstrate the use of filters (General, wildcard, condition and
limits)
b. Demonstrate the group creation, removing and renaming a group.
c. Demonstrate the creation of constant set
d. Create the visualization by using quick table calculation
e. Customize the data using any three number functions

2 Create the visualization using Tableau for the “Corriander_seed_2021.csv” dataset.

a. Demonstrate the use of cascading filter, calculation filter and data
source filter.
b. Demonstrate creating Hierarchies
c. Demonstrate the creation of computed sets
d. Create a visualization using a calculated field
e. Customize the data using any three string functions

3 Create the visualization using Tableau for the “Corriander_seed_2021.csv” dataset.

a. Demonstrate the use of cascading filter, calculation filter and data
source filter.
b. Demonstrate the group creation, removing and renaming a group.
c. Create a visualization using a calculated field
d. Customize the data using any three number functions
e. Demonstrate the creation of constant set

4 Create the visualization using Tableau for the “supermarket_sales.csv” dataset.

a. Demonstrate the use of filters (General, wildcard, condition and
limits)
b. Demonstrate the group creation, removing and renaming a group.
c. Demonstrate the creation of constant set
d. Create a visualization using a calculated field
e. Customize the data using any three string functions

64
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

5 Create the visualization using Tableau for the “supermarket_sales.csv” dataset.

a. Demonstrate the use of cascading filter, calculation filter and data
source filter.
b. Demonstrate creating Hierarchies
c. Demonstrate the creation of computed sets
d. Create the visualization by using quick table calculation
e. Customize the data using any three number functions

6 Create the visualization using Tableau for the “supermarket_sales.csv” dataset.

a. Demonstrate the use of filters (General, wildcard, condition and
limits)
b. Demonstrate creating Hierarchies
c. Create the visualization by using quick table calculation
d. Demonstrate the creation of constant set
e. Customize the data using any three string functions

7 Create the visualization using Tableau for the “supermarket_sales.csv” dataset.

a. Demonstrate the use of cascading filter, calculation filter and data
source filter.
b. Demonstrate the group creation, removing and renaming a group.
c. Demonstrate the creation of constant set
d. Create a visualization using a calculated field
e. Customize the data using any three number functions

Course Outcomes

At the end of the course the student will be able to

CO1 Design and create effective data visualizations using Python.

Apply data transformations such as Joins, filtering, sorting, aggregation etc., for
CO2
visualization using industry-standard software tools.

Identify opportunities for application of data visualization in various domains and

CO3
communicate the results for documentation and interpretation.

65
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

CO-PO mapping
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12

CO1 2 2

CO2 3

CO3 2 3 3

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks

Lab Component CIE and 2 Lab tests 50

Total 50

66
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

Universal Human Values

Semester IV
Course Code: 22MA4HSUHV Total Contact Hours: 15 hours
L-T-P: 0-1-0 Total Credits: 01

Course Objectives:

To develop a holistic perspective based on self-exploration about themselves (human being),

family, society and nature/existence. Understanding (or developing clarity) of the harmony in the
human being, family, society and nature/existence.

Unit
No. Topics Hours
Course Introduction - Need, Basic Guidelines, Content and Process for
ValueEducation
1 1. Purpose and motivation for the course, recapitulation from Universal Human 8
Values-I
2. Self-Exploration–what is it? - Its content and process; ‘Natural Acceptance’
and ExperientialValidation- as the process for self-exploration
3. Continuous Happiness and Prosperity- A look at basic Human Aspirations
4. Right understanding, Relationship and Physical Facility- the basic
requirements for fulfilmentof aspirations of every human being with their
correct priority
5. Understanding Happiness and Prosperity correctly- A critical appraisal of the
current scenario
6. Method to fulfil the above human aspirations: understanding and living in
harmony at variouslevels.

Include practice sessions to discuss natural acceptance in human being as the innate
acceptance for living with responsibility (living in relationship, harmony and co-
existence) rather than as arbitrariness in choice based on liking-disliking

Understanding Harmony in the Human Being - Harmony in Myself!

2 1. Understanding human being as a co-existence of the sentient ‘I’ and the 8
material ‘Body’
2. Understanding the needs of Self (‘I’) and ‘Body’ - happiness and physical
facility
3. Understanding the Body as an instrument of ‘I’ (I being the doer, seer and
enjoyer)
4. Understanding the characteristics and activities of ‘I’ and harmony in ‘I’
5. Understanding the harmony of I with the Body: Sanyam and Health; correct
67
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

appraisal of Physical needs, meaning of Prosperity in detail

6. Programs to ensure Sanyam and Health.

Include practice sessions to discuss the role others have played in making material
goods available to me. Identifying from one’s own life. Differentiate between
prosperity and accumulation. Discuss program for ensuring health vs dealing with
disease

Understanding Harmony in the Family and Society- Harmony in

Human- HumanRelationship
3 1. Understanding values in human-human relationship; meaning of Justice 8
(nine universal values in relationships) and program for its fulfilment to
ensure mutual happiness; Trust andRespect as the foundational values of
relationship
2. Understanding the meaning of Trust; Difference between intention and
competence
3. Understanding the meaning of Respect, Difference between respect and
differentiation; theother salient values in relationship
4. Understanding the harmony in the society (society being an extension of
family): Resolution,Prosperity, fearlessness (trust) and co-existence as
comprehensive Human Goals
5. Visualizing a universal harmonious order in society- Undivided Society,
Universal Order-from family to world family.

Include practice sessions to reflect on relationships in family, hostel and institute as

extended family, real life examples, teacher-student relationship, goal of education
etc. Gratitude as a universal value in relationships. Discuss with scenarios. Elicit
examples from students’ lives

Understanding Harmony in the Nature and Existence - Whole existence as

Coexistence
1. Understanding the harmony in the Nature
4 8
2. Holistic perception of harmony at all levels of existence.

Implications of the above Holistic Understanding of Harmony on

Professional Ethics
1. Natural acceptance of human values
5 2. Definitiveness of Ethical Human Conduct 8

Include practice Exercises and Case Studies will be taken up in Practice (tutorial)
Sessions eg. Todiscuss the conduct as an engineer or scientist etc.

68
 B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
(Autonomous Institute, Affiliated to VTU)
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING (DATA SCIENCE)

At the end of the course, the student will have the ability to

Conduct self-exploration and distinguish between values and skills,

CO1 happiness and accumulation of physical facilities, the self and the body,
Intension and Competence of an individual

Analyze the value of harmonious relationship based on trust and respect in

CO2
personal and professional life
Examine the role of a human being in ensuring harmony in society and
CO3
nature

CO4 Apply the understanding of ethics in life and profession

TEXT BOOKS:

1. Human Values and Professional Ethics by R R Gaur, R Sangal, G P Bagaria, Excel

Books,New Delhi, 2010

REFERENCE MATERIAL:

1. Jeevan Vidya: Ek Parichaya, A Nagaraj, Jeevan Vidya Prakashan, Amarkantak, 1999.

2. Human Values, A.N. Tripathi, New Age Intl. Publishers, New Delhi, 2004.
3. The Story of Stuff (Book).
4. The Story of My Experiments with Truth - by Mohandas Karamchand Gandhi
5. Small is Beautiful - E. F Schumacher.
6. Slow is Beautiful - Cecile Andrews
7. Economy of Permanence - J C Kumarappa
8. Bharat Mein Angreji Raj – PanditSunderlal
9. Rediscovering India - by Dharampal
10. Hind Swaraj or Indian Home Rule - by Mohandas K. Gandhi
11. India Wins Freedom - Maulana Abdul Kalam Azad
12. Vivekananda - Romain Rolland (English)

69