Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
9 views58 pages

UG Syllabus 2022-25

The document outlines the Semester-III curriculum for the Department of Artificial Intelligence & Data Science at B.M.S. College of Engineering, detailing course codes, titles, credits, and hours for various subjects including Statistics, Computer Organization, Data Structures, and more. It includes course outcomes, prescribed textbooks, assessment plans, and laboratory instructions for practical components. The total credits for the semester amount to 28, with a breakdown of courses categorized as BS, ES, PC, and NCMC.

Uploaded by

surya300526
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views58 pages

UG Syllabus 2022-25

The document outlines the Semester-III curriculum for the Department of Artificial Intelligence & Data Science at B.M.S. College of Engineering, detailing course codes, titles, credits, and hours for various subjects including Statistics, Computer Organization, Data Structures, and more. It includes course outcomes, prescribed textbooks, assessment plans, and laboratory instructions for practical components. The total credits for the semester amount to 28, with a breakdown of courses categorized as BS, ES, PC, and NCMC.

Uploaded by

surya300526
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 58

Semester-III

Total Total
Course Credits
No. Code Course Title Credits Hours
Type
L T P

Statistics and Discrete


1 BS 23MA3BSSDM 2 1 0 3 4
Mathematics

Computer Organization &


2 ES 23DC3ESCOA 3 0 0 3 3
Architecture

3 PC 23DC3PCDSC Data Structures 3 0 1 4 5

4 PC 23DC3PCDBM Database Management Systems 3 0 1 4 5

5 PC 23AI3PCIAI Introduction to AI 3 0 1 4 5

6 PC 23DS3PCFDS Foundations of Data Science 3 0 0 3 3

23DC3AEFWD Full Stack Web Development

7 AE 23DS3AEDAE Data Analytics with Excel 0 0 1 1 2

23DS3AELAT Technical Writing

23NCMC3NS1 NSS

23NCMC3YG1 YOGA
8 NCMC 0 0 0 0 1

Physical Edu. (Sports and


23NCMC3PE1
Athletics)

TOTAL 17 1 4 22 28

PC-15, ES-3, BS-3, AE-1

2
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem III
Course Title: Computer Organization and Architecture
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
Units, Basic Operational Concepts, Number Representation and Arithmetic
1 Operations, Memory Locations and Addresses, Memory Operations, 8
Instructions, and Instruction Sequencing, Addressing Modes, Stored program
concept.

Introduction to Assembly Language Concepts, Stacks, Subroutines, Additional


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

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


only Memories, Direct Memory Access, Memory Hierarchy,
3 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

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


Summands, Summand Addition Tree using 3-2 Reducers, Integer Division,
4 Floating- Point Numbers and Operations: Arithmetic Operations on Floating- 8
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

Parallel Computer Architecture: Processor Architecture and Technology


Trends, Flynn’s Taxonomy of Parallel Architectures, Memory Organization of
5 8
Parallel Computers: Computers with Distributed Memory Organization,
Computers with Shared Memory Organization, Thread-Level Parallelism:
Simultaneous Multithreading, Multicore Processors

3
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Prescribed Text Book


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

MOOC Course
Sl. No. Course name Course Year URL
Offered By
1. Computer NPTEL 2022 https://onlinecourses.nptel.ac.in/n
Architecture and oc22_cs88/preview
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
analyzing performance issues.

CO-PO mapping

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

4
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

5
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Semester III
Course Title: Data Structures
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.

6
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & 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
2014
Oxford
Data Structures using C Reema Thareja Second
2. University press
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
Data Structures Aaron M. Fifth Pearson 2007
1.
using C Tenenbaum, Education
Yedidyah Langsam,
Moshe J. Augenstein
Data Structures - A First Cengage 2005
2 Richard F. Gilberg
Pseudocode Learning
Behrouz A. Forouzan
Approach with C

E-Book
Sl. Book Authors Edition Publisher Year URL
No. Title
1. Data E. McGraw 2013 https://dokumen.pub/data-
Structures Balagurusw Hill structures-using-c-
using C amy 9781259029547-
1259029549.html
2. Data Robert L. Second Prentice 1997 https://cdn.preterhuman.net/tex
structures Kruse, Hal ts/math/Data_Structure_And_
and Clovis L. Algorithms/Data%20Structure
program Tondo, s%20and%20Program%20Des
design in C Bruce P. ign%20in%20C++%20-
Leung %20Robert%20L.%20Kruse.p
df

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

7
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

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.

8
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE
Lab Unit# Program Details
Program
Write a program to implement Singly Linked List with following operations
a) Create a linked list.
1 2
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
a) Create a linked list.
2 2
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
a) Sort the linked list.
3 2
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 character
6 3
operands and the binary operators + (plus), - (minus), * (multiply) and /
(divide)
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) Delete c) Display
8 3
The program should print appropriate messages for queue empty and queue
overflow conditions
9 3 Write a program to implement Stack & Queues using Linked 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.

9
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Write a program
a) To construct a binary search tree
11 4
b) To implement iterative inorder 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

10
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem III
Course Title: Database Management Systems
Course Code: 23DC3PCDBM Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit Hour
Topics
No. s
1 Introduction to Database Systems: Introduction, An Example, 8
Characteristics of 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 8
Database 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.

11
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & 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.
No Book Title Authors Edition Publisher Year
.
1. Fundamentals of Database Elmasri and Navathe 7th Pearson 2016
Systems Edition
2. Database System Concepts Silberschatz, H Korth 7th McGrawHil 2019
and S Sudarshan Edition l
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
1. Database Management Ramakrishnan and 3rd Edition McGrawHil 2014
Systems Gehrke l
2. Database Systems: Design, Peter Rob and 8th Edition CENGAGE 2009
Implementation, and Carlos Learning
Management Coronel

E-Book
Sl.
Publishe Ye
N Book Title Authors Edition URL
o. r ar
1. An Introduction to Hugh 3rd Ventus 201 https://www.e-
Relational Darwen Edition Publishing 2 booksdirectory.com/d
Database ApS etails.php?ebook=309
Theory 3
2. Database System Hector Second Pearson 200 https://people.inf.elte.
The Complete GarciaMolina,Jeffr Edition Educatio 9 hu/miiqaai/elektroMo
Book eyD. Ullman, n dulatorDva.pdf
Jennifer Widom

12
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

MOOC Course
Sl. Course
Course name Year URL
No. offered by
1. Database Management SWAYAM 2023 https://onlinecourses.swayam2.ac.in/ce
Systems c23_cs10/preview

2. Database Management Coursera 2023 https://www.coursera.org/learn/databas


Essentials e-management

Course Outcomes

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

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


1
CO Analyze the given database concepts to its correctness.
2
CO Design and demonstrate conceptual models, query and optimization.
3
CO Ability to conduct experiments to demonstrate the various SQL query processing
4

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.

13
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE
Lab Program Program Details
1 Sailor Database
2 Supplier Database
3 Salesman Database
4 Movie Database
5 Employee Database

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.

14
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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)

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.

15
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

PROGRAM 5: EMPLOYEE DATABASE

Create the following Tables:

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

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
EMPLO LAST_N FIRST_NA MIDDLE JOB_I MANAG SAL COM DEPARTM
HIREDATE
YEE_ID AME ME _NAME D ER_ID ARY M ENT_ID
7839 MEGAN JOHN S 672 NULL 12-DEC-14 5500 NULL 30
7369 SMITH JOHN Q 667 7521 17-DEC-18 800 NULL 20
7499 ALLEN KEVIN J 670 7507 20-FEB-17 1600 300 30
7505 DOYLE JEAN K 671 7839 04-APR-15 2850 NULL 30
7506 DENNIS LYNN S 671 7839 15-MAY-15 2750 NULL 30
7507 BAKER LESLIE D 671 7839 10-JUN-15 2200 NULL 40
7521 WARK CYNTHIA D 670 7505 22-FEB-15 1250 500 30

16
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & 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.

SEE Exam Question paper format

17
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

18
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Semester III
Course Title: Introduction to Artificial Intelligence
Course Code: 23AI3PCIAI Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit
No. Topics Hours
1 8
Introduction to AI: Foundations of Artificial Intelligence, History of
Artificial Intelligence, The State of the Art. Intelligent Agents – Agents
and Environments, Concept of rationality, The nature of environments,
The structure of agents
Problem solving based on searching: Problems solving Agents,
Example problems, Searching for solutions, Uniformed Search
strategies – Uniform cost search, Breadth First Search, Depth First
Search, Depth Limited Search, Iterative Deepening Depth First

2 8
Heuristic Search Strategies: Best-first Search, A* algorithm,
Heuristic Functions
Local Search & Optimization: Hill Climbing, Genetic Algorithms
3 8
Constraint Satisfaction Problem – Defining constraint satisfaction
problems, Constraint propagation, Back tracking search for CSPs, Local
search for CSPs
Game theory – Optimal decisions in games, Alpha-Beta Search,
Stochastic games, Partially observable games.
4 8
Logical Agents - Knowledge–based agents, The Wumpus world,
Logic, Propositional logic, Reasoning patterns in Propositional Logic.
First Order Logic - Representation Revisited, Syntax and Semantics
of First Order logic, Using First Order logic.
Inference in First Order Logic - Propositional Versus First Order
Inference, Unification, Forward Chaining, Backward Chaining,
Resolution.
5 8
Quantifying Uncertainty - Acting under Uncertainty, Basic
Probability Notation, Inference using Full Joint Distributions,
Independence, Baye’s Rule and its use, Wumpus World Revisited.

19
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Prescribed Text Book


Sl. Book Title Authors Edition Publisher Year
No.
Artificial Intelligence Stuart J. Russell 3rd Edition Pearson 2015
1. and Peter Norvig
Reference Text Book
Sl. Book Title Authors Edition Publisher Year
No.
Artificial Intelligence Elaine Rich, Kevin 3rd Edition Tata Mc 2013
1. Knight GrawHill
Artificial Intelligence George F Lugar 5th Edition Pearson 2011
2 Structure and
strategies for
complex problem
solving

E-Book
Sl. Book Authors Edition Publisher Year URL
No. Title
1. Artificial Stuart J. 3rd Pearson 2015 https://people.engr.tamu.edu
Intelligenc Russell Edition /guni/csce421/files/AI_Russ
e and Peter ell_Norvig.pdf
Norvig

2. 10 Free Must-read Books on


AI - KDnuggets

MOOC Courses
Sl. Course name Course Offered Year URL
No. By
Knowledge- Udacity https://www.udacity.com/course/knowled
Based AI: ge-based-ai-cognitive-systems--ud409
Cognitive
1
Systems

Artificial NPTEL https://nptel.ac.in/courses/106105077


2 Intelligence

20
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Course Outcomes

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

Apply basic principles of AI in solutions that require problem solving, inference,


CO1
knowledge representation and learning.
CO2 Analyze search and inference algorithms in problem solving.
Demonstrate knowledge of reasoning, uncertainty and knowledge representation for
CO3
solving real-world problems.
CO4 Conduct experiments to solve problems using AI techniques.

CO-PO mapping

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

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.

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.

21
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Lab Unit# Program Details


Program
1 1 Write a program to implement Vacuum Cleaner agent for two rooms
2 1 Implement Iterative deepening search algorithm.
3 1 Solve 8 puzzle problem using BFS algorithm
4 2 Implement A* search algorithm.
5 2 Implement Tic –Tac –Toe Game using Alpha-beta pruning
Write a program to create a knowledge base using prepositional logic and
6 3
show that the given query entails the knowledge base or not
Write a program to create a knowledge base using prepositional logic and
7 3
prove the given query using resolution
Convert given first order logic statement into Conjunctive Normal Form
8 3
(CNF).
9 3 Implement unification in first order logic
Create a knowledgebase consisting of first order logic statements and prove
10 4
the given query using forward reasoning.

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

Case Studies on AI

1. Develop an Intelligent agent to administer delivery of medicines to appropriate patients


2. Implement AI agent to develop pac game
3. Use genetic algorithms to optimize cash flow for a business

22
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem III
Course Title: Foundations of Data Science
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 8
qualitative 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, 8
Type 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, 8
Time-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
Matching; Fellegi-Sunter Model

Dimensionality Reduction: Eigenvalues and Eigenvectors of Symmetric


4 Matrices:Definitions, Computing Eigenvalues and Eigenvectors, Finding 8
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

23
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Data Analytics on Text: Major Text Mining Areas – Information Retrieval –


Data Mining – Natural Language Processing NLP) – Text analytics tasks:
5 8
Cleaning and Parsing, Searching, Retrieval, Text Mining, Part-of-Speech
Tagging, Stemming, 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,
Principles of Data Second
1. Sunil Kakade & Packt 2018
Science Edition
Macro Tibaldeschi
Sanjeev Wagh,
Fundamentals of Data Manisha Bhende,
2. 1st Edition CRC Press 2022
Science Anuradha
Thakare,
Introducing Data
Davy Cielen, Arno
Science: Big Data,
3. D.B. Meysman, Manning 2016
Machine Learning, and
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,
Dreamtech
2. Mining Massive Datasets Anand Rajaraman, 2nd 2016
Press
Jeffrey D Ullman

E-Book
Sl. Editio
No Book Title Authors Publisher Year URL
n
DirkP.Kroese,
ZdravkoI.Botev Universit
Data Science https://people.smp.uq.edu.
, y of
1. & Machine - 2023 au/DirkKroese/DSML/DS
ThomasTaimre, Queensla
Learning ML.pdf
RadislavVaism nd
an
ALEX J. https://32net.id/bukaheula/
Becoming a GUTMAN share/QP2cf2JLdeOPn00y
2. - Wiley 2021
Data Head JORDAN 3Nyu8aXHp1Slq1bc6P4Y
GOLDMEIER cuI4.pdf

24
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

Course Outcomes

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

CO1 Ability to obtain fundamental knowledge on data science


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

CO-PO-PSO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO PO PO9 PO10 PO11 PO1
7 8 2
CO1 3
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
Alternate Assessment Tool - -
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
Unit-3 Internal Choice Two Questions to be asked for 20 Marks
Unit-4 Mandatory One Question to be asked for 20 Marks
Unit-5 Mandatory One Question to be asked for 20 Marks

25
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem : 3rd

Course Title: Full Stack Web development

Course Code: 22CS3AEFWD

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

A 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.

A 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.

C CO-PO-PSO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2

CO1 3 3 3 3

CO2 3 3 3 3 3 3

CO3 3 3 3 3

CO4 3 3 3

D Assessment Plan (for 50 marks of CIE)

Tool Remarks Marks


Internals --- ---
QUIZ --- ---
Lab Component --- 50
Alternate Assessment Tool ---- --
Total 50

26
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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 with a relevant issue
(10) social/environmental and offers standard or solution.
issue with insightful, practical solutions.
innovative solutions. solutions.
Technical (10 Marks) (7 Marks) (5 Marks) (0-4 Marks)
Implementation Exemplary Reliable and Basic Inadequate or
(10) implementation of proficient implementation incomplete
full-stack technical 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 design Poor or non-
Interface design, prioritizing design focused encompassing functional user
(10) intuitiveness and on usability and essential interface,
user-friendliness, functionality. functions and lacking in user-
with a professional user needs. centricity.
standard of
execution.
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 constructive participation and
collaboration, and collaboration and occasional collaboration in
effective teamwork within the contributions. the group.
throughout the group.
project lifecycle.
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 details.
including implementation. project details.
methodology,
design, and future
scope.

27
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

E Tutorial Plan (if applicable)


-----
F Laboratory Plan (if applicable)
Project Topics for Website Development:

Sl. Week Activity Content deliverables Technologies/Skills to be Covered


No by the assigned
teacher
1 1st Formation of groups. Note: Introduction to Full  Overview of full stack
Student groups of size 2 or 3 Stack Technologies & development tools and
or 4 Issue Identification frameworks.
 Overview of web development
(HTML, CSS, JavaScript),
 Introduction to full stack
frameworks (MEAN, MERN),
Identifying social/environmental
issues for web solutions.
2 2nd Project topic selection by Conceptualizing a  Identifying problem and
each Group. Presentation: Web Application understanding social and
Student and Project topic environmental issues.
introduction by each group  Brainstorming and planning a web
application focused on a chosen
social/environmental issue.
 Tools for wireframing and
prototyping (Figma, Sketch),

3 3rd Design Layout of the Web Basic Front-end and  Define layouts based on project
Pages Back-end 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-end Data Management and  Techniques for managing and
and 6th implementation Integration integrating data in web
applications.
 Database technologies (MongoDB,
SQL), Integrating databases with
back-end (Mongoose for
MongoDB), Basic CRUD
operations.
5 7th Design and Development of Advanced Front-end  Delving into advanced front-end
8th and connecting among different & Back-end technologies (React, Angular) and
9th web pages Technologies back-end technologies (databases,
Project Development server management).
and Mid-term Review  Front-end: React.js/Angular for
dynamic UI development.

28
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

 Back-end: Advanced 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 group Integrating Feedback  Applying feedback from the mid-
& Refining term review and refining the
Applications application for better performance
and impact.
 Implementing feedback,
Optimization for performance,
Security best practices (HTTPS,
data validation), User testing and
UX improvements.
8 11th Complete Project Work Final Project Students present their completed
Demonstration by each Presentations and projects and submit their final work for
group Submissions assessment.
12th Project Report Preparation

Text Book :

Supplementary texts and resources

1. Modern Full-Stack Development: Using Type Script, React, Node.js , Frank Zammetti ,2020 (1st Edition) ,Apress
2. Beginning MERN Stack , Build and Deploy a Full Stack MongoDB, Express, React, Node.js App, Greg Lim ,2021

Tutorial Link:

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/

G SEE Exam (50 Marks)


Evaluation of Projects carried out by students from External examiner along with internal faculty.

29
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Total Total
Course Credits
No. Code Course Title Credits Hours
Type
L T P

1 BS 23MA4BSLAO Linear Algebra and Optimization 2 1 0 3 4

2 ES 23DC4ESTOC Theory of Computation 3 0 0 3 3

3 PC 23DC4PCOPS Operating Systems 3 0 0 3 3

4 PC 23DS4PCCON Computer Networks 3 0 0 3 3

5 PC 23DS4PCMLG Machine Learning 3 0 1 4 5

6 PC 23DC4PCDAA Design and Analysis of Algorithms 3 0 1 4 5

23DS4AEDVZ Data Visualization using Tools

7 AE 23DS4AEJUL JULIA for Data Science 0 0 1 1 2

23DS4AEGIT Version Controller with GIT

8 UHV 22MA4HSUHV Universal Human Values 0 1 0 1 2

23NCMC4NS2 NSS

9 NCMC 23NCMC4YG2 YOGA 0 0 0 0 1

23NCMC4PE2 Physical Edu. (Sports and Athletics)

TOTAL 22 28

PC-14, ES-3, BS-3, UHV-1, AE-1

2
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Course Title Linear Algebra and Optimization Course Code 23MA4BSLAO


Credits 03 L–T–P 2-1-0
Contact hours 39

Course Objectives:
The objectives of the course are to facilitate the learners to
• Appreciate the importance of linear algebra in computer and allied engineering science.
• Gain the knowledge of linear algebra tools and concepts to implement them in their core domain.
• Improve their mathematical thinking and acquire skills required for sustained lifelong learning.

Teaching-Learning Process (General Instructions)


These are sample Strategies; that teachers can use to accelerate the attainment of the various course
outcomes.
• Lecture method(L) does not mean only traditional lecture method, but different type of teaching
methods may be adopted to develop the outcomes.
• Encourage collaborative (Group Learning) Learning in the class.
• Ask HOT (Higher order Thinking) questions in the class, which promotes critical thinking.
• Adopt Problem-Based Learning (PBL), which fosters students’ Analytical skills, and develops
thinking skills such as the ability to evaluate, generalize, and analyze information rather than simply
recall it.
• Discuss how every concept can be applied to the real world and when that's possible, it helps to
improve the students' understanding.

UNIT-1
CONTINUOUS OPTIMIZATION – 1 [8 hours]
Function of several variables, partial differentiation, local and global optima, convex sets and functions
separating hyperplanes, application of Hessian matrix in optimization, gradients of vector-valued
functions, gradients of matrices, useful identities for computing gradients.

Teaching-Learning Process: Chalk and Board, Problem-based learning

UNIT-2
CONTINUOUS OPTIMIZATION-2 [7 hours]
Optimization using gradient descent/ascent and NR method.
Sequential search 3-point search and Fibonacci search.
Constrained Optimization, Method of Lagrange multipliers, KKT optimality conditions.

Teaching-Learning Process: Chalk and Board, Problem-based learning

UNIT-3
INNER PRODUCT SPACES [8 hours]
Inner products, inner product spaces, length and orthogonality, orthogonal sets and Bases, projections,
Gram-Schmidt orthogonalization process, QR-factorization, least squares problem and least square
error. Curve fitting – Principle of least squares, fitting a straight line and fitting a parabola.

Teaching-Learning Process: Chalk and Board, Problem-based learning

3
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

UNIT-4
EIGENVALUES AND EIGENVECTORS [8 hours]
Introduction, Polynomials of Matrices, Cayley-Hamilton Theorem, eigen spaces of a linear
transformation, Characteristic and Minimal Polynomials of Block Matrices, Jordan Canonical form.

Teaching-Learning Process: Chalk and Board, Problem-based learning

UNIT-5
MATRIX DECOMPOSITION AND THEIR APPLICATIONS [8 hours]
Diagonalization, Orthogonal diagonalization of real symmetric matrices, quadratic forms and its
classifications, rank and signature of real quadratic forms, Singular value decomposition. Dimensional
reduction – PCA.

Teaching-Learning Process: Chalk and Board, Problem based learning

*******
Course outcomes (Course Skills Set)
After successfully completing the course, the student will be able to understand the topics:
Course Code CO COURSE OUTCOME (CO) PO Strength
Apply the concepts of linear algebra in
CO 1 Computer and Allied Engineering 1 3
Sciences.
23MA4BSLIA
Demonstrate the applications of computer
CO 2 science and Allied Engineering Science 1 & 5 3
using modern ICT tools.

Assessment Details (both CIE and SEE)


Type of 50 %
Component Max. Marks Total Total
assessment Weightage
Quiz 10 5
CIE – AAT 10 5
100 50
Theory Test 1 40 20
Test 2 40 20
SEE End Exam 100 50
CIE methods/question paper is designed to attain the different levels of Bloom’s taxonomy as
per the outcome defined for the course.

SEMESTER END EXAMINATION:


• Each unit consists of one full question.
• Five full questions to be answered.
• To set one question each from Units 1, 2 and 5 and two questions each from Units 3 and 4.

SUGGESTED LEARNING RESOURCES:


Text Books:

4
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

1. Linear Algebra and its applications, David C. Lay, Steven R. Lay, Judi J Mc. Donald, 6th Edition,
2021, Pearson Education.
2. Linear Algebra and its Applications, Gilbert Strang, 4th edition, 2005, Brooks Cole.
3. Linear Algebra: An Introduction, Richard Bronson & Gabriel B. Costa, 2nd edition, Academic
press.
Reference Books:
1. Schaum’s outline series -Theory and problems of linear algebra, Seymour Lipschutz, Marc
Lipson, 6th edition, 2017, McGraw-Hill Education.
2. Linear Algebra and Optimization for Machine Learning, Charu C. Aggarwal, Springer, 2020
3. Linear Algebra, Stephen H. Friedberg, Arnold J. Insel and Lawrence E. Spence, Pearson, 2019,
Fifth Edition.
4. Mathematics for Machine learning, Marc Peter Deisennroth, A. Aldo Faisal, Cheng Soon Ong,
2020, Cambridge University Press.
5. Linear Algebra, Kenneth Hoffman, Ray Kunze, 2nd edition, Pearson.

E-books and online course materials:


1. https://ocw.mit.edu/courses/mathematics/18-06sc-linear-algebra-fall-2011/index.htm
2. https://www.math.ucdavis.edu/~linear/linear.pdf
Online Courses and Video Lectures:
1. https://www.coursera.org/learn/linear-algebra-machine-learning
2. https://nptel.ac.in/syllabus/111106051/

5
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem IV
Course Title: Theory of Computation
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, Deterministic Finite Automata (DFA), Nondeterministic Finite
1 Automata (NFA), Finite Automata with Epsilon Transition, An 8
Application Text Search. NP Problems solvable in Polynomial Time,
Satisfiability Problem

Regular Expressions and Languages: Regular Expressions, Finite


Automata and Regular Expressions, Applications of Regular
2 Expressions, Proving Languages Not to Be Regular, Closure Properties 8
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 Grammars and Languages, Eliminating Useless Symbols,
Computing the Generating and Reachable Symbols, Eliminating Epsilon
3 Productions, Eliminating Unit Productions, Chomsky Normal Form, 8
Greibach Normal form

Pushdown Automata: Definition of the Pushdown Automaton, The


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

Introduction to Turing Machine: Problems That Computers Cannot


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

Prescribed Text Book


Sl. No. Book Title Authors Edition Publisher Year
1. Introduction to Automata John E. Hop croft, 3rdEditio Pearson 2007
Theory, Languages and Rajeev Motwani, n
Computation Jeffrey
D. Ullman: education

6
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Reference Text Book


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

E-Book
Sl.
Book Title Authors Edition Publisher Year URL
No.
1. Introduction to Anil - Carleton 2019 https://cglab.ca/~michiel/
Theory of Mahesh University TheoryOfComputation/Th
Computation wari, eoryOfComputation.pdf
Michiel
Smid

MOOC Course

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

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.

7
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

CO-PO mapping

PO PO PO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
10 11 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

8
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

Unit Topics Hou


No. rs
1 Introduction to Operating Systems: What operating systems do, 8
Operating 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 8
Processes, Inter-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 8
algorithms, 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 8


memory 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, 8
Types of Virtual Machines and their implementations, Virtualization
and Operating System Components, Protection Rings
Case Study: VMWare

Prescribed Text Book


Sl. Book Title Authors Edition Publisher Year
No.
1. Operating System Abraham 9th John Wiley & 2018
Concepts Silberschatz, Edition Sons
Peter Baer

9
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

E-Book
Sl. Book Authors Editio Publishe Year URL
No Title n r
.
1. Operatin Dr. John T.Bell - Universit 2006 & https://www.cs.uic.edu/~jb
g y of 2013 ell/CourseNotes/Operating
Systems Illinois Systems/index.html
Course Chicago
Notes
2. Operatin Abraham 9th John 2018 https://drive.uqu.edu.sa/_/
g Silberschatz, Editio Wiley & mskhayat/files/MySubjects
System Peter Baer n Sons /2017SS%20Operating%20
Concept Galvin , Greg Systems/Abraham%20Silb
s Gagne erschatz-
Operating%20System%20
Concepts%20(9th,2012_12
).pdf

MOOC Course
Sl. No. Course Course Year URL
name Offered
By
1. Operating SWAYA 2023 https://onlinecourses.nptel.ac.in/noc20_cs04/pre
Systems M view

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


n to introduction-operating-systems
Operating
Systems

10
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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 PO1 PO1 PO1
0 1 2
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

11
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Semester IV
Course Title: Computer Networks
Course Code: 23DS4PCCON Total Contact Hours: 40 hours
L-T-P: 3-0-0 Total Credits: 3

Unit Topics Hour


No. s
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
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
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

Prescribed Text Book


Sl. Book Title Authors Edition Publisher Year
No
1. Data Communications Behrouz A Forouzan 5th McGraw 2013
and Networking Edition Hill
2. Computer Networks Andrew S. Tanenbaum, David 5th Pearson 2011
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 – Larry L. Peterson and Bruce 4th Elsevier 2007
A Systems Approach S. Davie Edition

E-Book
Sl. Book Title Authors Edition Publisher Yea URL
No. r
1. An Peter L 1st - 2020 https://intronetworks.cs.luc.ed
Introduction Dordal Edition u/current/ComputerNetworks.
to Computer pdf

12
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Networks

2. A Top-Down James F 8th Pearson 2021 https://gaia.cs.umass.edu/kuro


Approach: Kurose Edition se_ross/online_lectures.htm
Computer & Keith
Networking W Ross

MOOC Course
Sl. Course name Course Year URL
No. Offered
By
1. Computer Networking Coursera 2023 https://www.coursera.org/learn/illinoi
s-tech-computer-networking
2. NOC: Computer Networks NPTEL https://nptel.ac.in/courses/106105183
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 PO1 PO1 PO1
0 1 2
CO1 3
CO2 3
CO3 3 1

Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks


Internals 3 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 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

13
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem IV
Course Title: Machine Learning
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- Aurelien Second O’Reilly 2020
Learn, Keras & TensorFlow Geron

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

14
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

MOOC Course
Sl. Course
Course name Year URL
No. Offered 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.

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

15
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Lab Unit# Program Details


Program

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

Develop a program to construct Support Vector Machine considering a Sample


2 2
Dataset

Write a program to implement k-Nearest Neighbour algorithm to classify the iris


3 2
data set. Print both correct and wrong predictions

Write a program to implement the naïve Bayesian classifier for a sample training
4 3 data 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

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

16
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE
Semester IV
Course Title: Design and Analysis of Algorithms
Course Code: 23DC4PCDAA Total Contact Hours: 40 hours
L-T-P: 3-0-1 Total Credits: 4

Unit Topics Hours


No.
1 Introduction to Algorithm, Fundamentals of Algorithmic Problem 8
Solving.
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.

Prescribed Text Book


Sl. Book Title Authors Edition Publisher Year
No.
1. Introduction to the Design and Anany Levitin Third Pearson 2014
Analysis of Algorithms Edition
2. Introduction to Algorithms Thomas H Cormen, Third The MIT 2009
Edition Press

17
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Charles E Leiserson,
Ronald L Rivest,
Clifford 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 of Padma Reddy Sri Nandi 2009
Algorithms Publications

E-Books
Sl.
Book Title Authors Edition Publisher Year URL
No.
1. Introduction to K. Raghava Rao - Smash 2013 https://www.smashw
Design & words ords.com/books/view
Analysis of /365630
Algorithms
2. Data structures Allen Weiss Fourth Pearson 2014 http://www.uoitc.edu.
and Algorithm edition education iq/images/documents/
Analysis in informatics-
C++ institute/Competitive
_exam/DataStructure
s.pdf

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

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


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

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.

18
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & 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 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.

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

19
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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.

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

20
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Sem IV
Course Title: Data Visualization using Tools
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 Jake Vander Second


1. O’Reilly 2017
Handbook Plas Edition

Seema Acharya
Pro Tableau: A Step Second
2. , Subhashini Apress 2016
by Step Guide Edition
Chellappan
Reference Text Book
Sl.
Book Title Authors Edition Publisher Year
No.
Data Analysis and
Visualization Using
Python: Analyze Sossama
1. Apress 2018
Data to Create Embarak
Visualizations for BI
Systems,
Igor
Python Data Milovanović ,
Second
2. Visualization Dimitry Foures O’Reilly 2015
Edition
Cookbook , Giuseppe
Vettigl

E-Book
Sl
. Autho Editio Ye
Book Title Publisher URL
N rs n ar
o.
Data
Kyran 20 https://github.com/jllovet/datavi
1. Visualization - O’Reilly
Dale 16 z-with-py-and-js
with Python and

21
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

JavaScript
Jumpstart
Tableau: A Step- Arsha
20 https://link.springer.com/book/1
2. by-Step Guide to d - Apress
16 0.1007/978-1-4842-1934-8
Better Data Khan
Visualization

MOOC Course
Sl. Course
Course name Year URL
No Offered By
IBM Data Science https://www.coursera.org/professional-
1. Coursera 2023
certificates/ibm-data-science
Data Visualization https://www.coursera.org/specializations/d
2. Coursera 2023
with Tableau ata-visualization

Laboratory Plan (if applicable)

Lab-cycle-1

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: –
· Line Style dotted and Line-color should be green

· Show annotation

· Add a square marker.

· 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: –
· Line Style dashed and Line-color should be green

· Show legend at the lower right location

Add ticks for both X and Y axis

· Line width should be 2


b. Read toothpaste sales data of each month and show it using a bar plot

22
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & 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
· Print the total sale inside each part
· Explode the highest sale
· 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


· Add ticks for both axis
· 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)
· Add labels and ticks
· Use annotation

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


· Print percentage inside the chart
· 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

23
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

properties

· Add “mass” as additional features

· Use different markers

· 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

· Add “mass” and “method” as additional features

· Change the default color palette

· Display the complete legend


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

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

24
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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

d. Generate scatter plot with different color palette

Lab-cycle-2

I. 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

II. 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

III. 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

IV. 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

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

25
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

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 function
VI. 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
VII. 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
CO3
and p communicate the results for documentation and interpretation.

CO-PO mapping

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
Proposed Assessment Plan (for 50 marks of CIE)

Assessment Tool No. of Assessments Marks


Internals - -
QUIZ/AAT - -
Lab Component - 50
Total 50

26
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

Course Code 22MA3HSUHV/ Course Name Universal Human


22MA4HSUHV Values

Credits 01 L-T-P 0-1-0


Total Number of hours 15

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 – 1
Module 1: Course Introduction - Need, Basic Guidelines, Content and Process for Value
Education
1. Purpose and motivation for the course, recapitulation from Universal Human Values-I
2. Self-Exploration–what is it? - Its content and process; ‘Natural Acceptance’ and Experiential
Validation- 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 fulfilment
of 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 various
levels.
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
UNIT – 2
Understanding Harmony in the Human Being - Harmony in Myself!
1. Understanding human being as a co-existence of the sentient ‘I’ and the 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 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

27
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE & DATA SCIENCE

UNIT – 3
Understanding Harmony in the Family and Society- Harmony in Human- Human
Relationship
1. Understanding values in human-human relationship; meaning of Justice (nine universal
values in relationships) and program for its fulfilment to ensure mutual happiness; Trust and
Respect 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; the
other 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

UNIT – 4
Understanding Harmony in the Nature and Existence - Whole existence as Coexistence
1. Understanding the harmony in the Nature
2. Holistic perception of harmony at all levels of existence.

UNIT – 5
Implications of the above Holistic Understanding of Harmony on Professional Ethics
1. Natural acceptance of human values
2. Definitiveness of Ethical Human Conduct

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

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

28
B.M.S. COLLEGE OF ENGINEERING, BENGALURU-19
Autonomous Institute, Affiliated to VTU
DEPARTMENT OF ARTIFICIAL INTELLIGENCE
& DATA SCIENCE

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)

You might also like