The National Institute of Engineering, Mysuru 2024-25

THE NATIONAL INSTITUTE OF ENGINEERING

MYSORE – 8
(Autonomous Institution under VTU)

B.E in CSE (AI & ML)

Scheme of Teaching and Blown-up Syllabus
V Semester (2022 admitted)

Department of Computer Science and Engineering

 The National Institute of Engineering, Mysuru
Department of Computer Science and Engineering
Vision
The department will offer, through best-in-class faculty and infrastructure, globally acceptable
education in Computer Science and produce highly competent and value-based computer
engineers.

Mission
1. To evolve into an outstanding department contributing significantly to teaching, research
and consultancy in computer science in an integrated manner.
2. To develop state-of-the-art infrastructure and advanced computing facility in tune with
requirement of industry and national projects.
3. To promote innovation and entrepreneurship to enhance competence of graduates of
computer science.

Program Outcomes (POs)

PO1: Apply the knowledge of mathematics, science, engineering fundamentals, and an
engineering specialization to the solution of complex engineering problems.
PO2: 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 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: 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: 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: 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
PO7: Understand the impact of the professional engineering solutions in societal and
environmental contexts, and demonstrate the knowledge of, and need for sustainable
development.
PO8: Apply ethical principles and commit to professional ethics and responsibilities and norms
of the engineering practice.
PO9: Function effectively as an individual, and as a member or leader in diverse teams, and
in multidisciplinary settings.
PO10: 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: 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: 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.

Program Specific Outcomes (PSOs)

PSO1: The ability to understand, analyze and develop software in the emerging areas for
efficient use of computer –based systems of varying complexity.
PSO2: The ability to think logically and apply standard practices and strategies in software
project development using open-ended programming environments to deliver a quality
product.

Program Educational Objectives (PEOs)

PEO1: Acquire the necessary mathematical and scientific knowledge as well as basic
managerial and financial procedures to analyze and solve real world problems within their work
domain.
PEO2: Acquire the state-of-art knowledge in major areas of computing science like
programming, networking, information security and algorithm development as well as
technology solutions like cloud, database systems and mobile applications to enable them to
succeed in pursuit of higher studies/ Industry/R&D activity.
PEO3: Have the ability and the mindset to continuously update and innovate.
PEO4: Have the necessary communication skills to be able to effectively communicate with
technical experts and also non- technical end users.
 The National Institute of Engineering
Scheme of Teaching & Examination (2022 Scheme)
Department: Computer Science and Engineering (BE in CS&E (AI and ML))
B.E. 2022 and 2023 Admitted Batch
V Semester
Teaching
Examination
Hrs/Week
Type of Course

Duration in Hours
Question

Credits
Total Marks
Teaching Paper

SEE Marks
CIE Marks
Course
Sl.No Course Title Department setting
Code
(TD) Board L T P S
(PSB)

Software Engineering & Project

1 HSMS BCS501
Management
CS CS 3 0 0 3 50 50 100 3
2 IPCC BCS502 Computer Networks CS CS 3 0 2 3 50 50 100 4
3 PCC BCS503 Automata Theory and Computation CS CS 3 2 0 3 50 50 100 4
4 PCCL BCIL504 Machine Learning Algorithms Lab CS CS 0 0 2 3 50 50 100 1
5 PCC BCI505 Machine Learning CS CS 3 0 0 3 50 50 100 3
Professional Elective Course (Industry
6 PEC BXX516X
suggested course) - Group I
CS CS 3 0 0 3 50 50 100 3
7 PROJ BCI586 Minor Project CS CS 0 0 2 - 50 - 50 1
8 AEC BRMK557 Research Methodology and IPR CS CS 2 0 0 2 50 50 100 2
9 MC BESK508 Environmental Studies Civil Engg Civil 1 0 0 - 50 - 50 1
BNSK559 National Service Scheme (NSS) NSS Coordinator
Physical Education (PE) (Sports &
10 MC BPEK559
Athletics)
PED 0 0 2 _ 100 _ 100 0
BYOK559 Yoga Yoga Teacher
Total 550 350 900 22
 Professional Elective Course - Group I
BCI516B Information Retrieval BCI516E Pervasive Computing
BCI516C Nonlinear Control Techniques
BCI516D Image and Video Processing
 Course Code: BCS501 Course:Software Engineering & Project Management
Credits: 3 L:T:P - 3:0:0
SEE: 50% CIE: 50%
SEE Hours: 3 Max. Marks: 100
Prerequisites if any NIL

Learning objectives 1. Learn the fundamentals of software engineering process and process models
2. Learn to use appropriate analysis and modeling techniques for building a
software systems for real world problems
3. Learn to validate the software systems using testing strategies
4. Use suitable software project estimation model for developing software

Course Outcomes:
On successful completion of the course, the student will be able to:

COs Course Outcomes Bloom’s level

Describe the fundamentals of Software Engineering Process and Process
CO1 Understand
Models.
CO2 Discuss requirement engineering tasks. Understand
CO3 Prepare quality software system using design principles. Apply
CO4 Use software testing techniques to perform system validations. Apply
Apply an effective software project estimation model for developing software
CO5 Apply
product.

Mapping with POs and PSOs

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

CO1 3 1 2 1 1 - - - 2 2 - 2 1 -
CO2 3 2 1 1 2 - - - 1 1 2 2 2 -
CO3 1 1 3 1 2 - - - 2 2 - 2 3 -
CO4 3 1 1 2 1 - - - 1 1 - 2 1 2
CO5 3 3 3 2 1 2 - 2 2 2 2 2 2 3
Mapping Strength: Strong-3 Medium-2 Low -1
 Course Structure

No. of No. of No. of

Lecture Tutorial Practical
No. Module
Hours Hours Hours

Module -1

1.1 Introduction to Software engineering 2 - -

The Software Process: Software Engineering, A Layered

1.2 Technology, A Process Frame Work, Capability Maturity 3 - -
Model Integration
Process Models: Incremental Process Models, Evolutionary
1.3 3 - -
Process Models
Module – 2

2.1 Agile View of Process: Agility, Agile Process, Agile Process Model 3 -
-

Requirement Engineering: Requirement Engineering Tasks,

Initiating Requirement Engineering Process, Developing USE- 4
2.2 - -
CASE

Module – 3

Building The Analysis Model: Requirement Analysis, Analysis

3.1
Modeling Approach, Data Modeling concept, Scenario Based 4
- -
Modeling, Flow Based Modeling, and Behavioral Modeling
Design Engineering: Design Process and Design Quality, Design
3.2 4 -
Concepts -
Creating an Architectural Design: Software Architecture, Data
3.3 3
Design, Architectural Styles and Patterns - -
Module-4

Testing Strategies: A Strategic Approach to Software Testing, Test

-
4.1 Strategies for Conventional Software, validation testing 3 -

Testing Tactics: Software Testing Fundamentals, Black Box &

4.2 4 - -
White Box Testing, Basis Path Testing, Black Box Testing

Module – 5
Project Management: Project Management Spectrum, People,
5.1 3 - -
Product, Process, Project
Software Project Estimation: Decomposition Techniques, Empirical
5.2 3 - -
Estimation Models
5.3 Report writing 1 -

Total No. of Lecture Hours 40 - -

Total No. of Tutorial Hours 0 -

Total No. of Practical Hours -

Text Books:
1. Software Engineering: A Practitioners Approach – Roger S. Pressman, 7th
Edition, McGraw-Hill 2010

Reference Books:
1. Software Engineering: Ian Somerville, 10th Edition, Pearson Education, 2016.
2. Software Engineering Theory and Practice: Shari Lawrence Pfleeger, Joanne M.
Atlee, 3rd Edition, Pearson Education, 2006.
3. Software Engineering Principles and Practice: Waman S Jawadekar, Tata
McGraw Hill, 2004

Online Resources:
1. https://www.digimat.in/nptel/courses/video/106101061/L01.html
2. https://www.digimat.in/nptel/courses/video/106105182/L01.html
3. https://www.coursera.org/learn/software-processes-and-agile-practices
 The National Institute of Engineering, Mysuru A.Y: 2024-25
(2022 SCHEME)

Course Code: BCS502 Course Name: Computer Networks

Credits: 4 L: T:P - 3:0:2
SEE: 50% Marks CIE: 50% Marks
SEE Hours: 3 Max. Marks: 100

Prerequisites if any Basic concepts of communication, Digital electronics and computers.

Learning objectives 1. To Understand the fundamentals of Networks and study Networking Models
and services at Network layer.
2. To Analyze the IPv4, IPv6 addressing mechanism and subnetting concepts.
3. Discuss the Services and functioning of protocols of Network, Transport
and Application layers.
4. To Demonstrate working of networking concepts and functioning of
protocols using Cisco packet tracer.

Course Outcomes:

On the successful completion of the course, the student will be able to

COs Course Outcomes

Understand and nalyzethe different networking models, network layer services,
CO1
Performance,IPV4 and IPV6 addressing mechanism.
CO2 Describe the working of Unicast and Multicast routing protocols.
Discuss the Transport Layer services and functioning of connectionless and
CO3
connection-oriented protocols.
CO4 Describe the functioning of popular application layer protocols.
Demonstrate the various networking concepts and working of protocols using Cisco
CO5
packet tracer.

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 1 2 1 1 1 1 1 1 2 2 2 2
CO2 3 3 2 2 2 1 1 1 1 1 2 2 3 2
CO3 3 3 2 1 2 1 1 1 1 1 2 2 3 2
CO4 3 3 2 1 3 1 1 2 3 1 2 2 3 3
CO5 3 3 3 2 3 2 2 2 2 1 3 2 3 3
Mapping Strength: Strong– 3 Medium – 2 Low – 1

Course Structure
No. of No. of No. of
Lecture Tutorial Practical
Hours Hours Hours
Module – 1: Introduction to Computer Networks and Network Layer
1.1 Networks 1 - -
1.2 Network Types 1
1.3 Networks Models: TCP/IP Protocol Suite, The OSI Model. 1
1.4 Network Layer: Network layer services: Packetizing, Routing and 1 - -
forwarding, other services
1.5 Packet switching: Datagram approach, Virtual-Circuit approach 2 - -
1.6 Network layer performance 1 - -
B.E. Blown up Syllabus – III Year 1
 The National Institute of Engineering, Mysuru A.Y: 2024-25
(2022 SCHEME)

Module – 2: Network Layer-Part I

2.1 IPv4 addresses: Address space, Classful addressing 1 - -
2.2 Classless addressing 2 - -
2.3 DHCP, NAT 1 - -
2.4 Forwarding of IP Packets: Forwarding Based on Destination Address 1
2.4 Network Layer Protocols: Internet Protocol, (IP): IPV4 Datagram 1 - -
format
2.5 Fragmentation 1 - -
2.6 Options, Security of IPV4 datagram, ICMP Checksum 1 - -
2.7 Next Generation IP: IPV6 Addressing 1 - -
2.8 The IPV6 Protocol 1 - -
Module – 3: Network Layer-Part II
3.1 Unicast Routing:Routing Algorithms: Distance Vector Routing, 1 - -
3.2 Link state Routing 1
3.3 Unicast Routing Protocols: Routing Information Protocol (RIP) 1 - -
3.4 OSPF 1 - -
3.5 Border Gateway Protocol (BGP): operation of External BGP (eBGP), 2 - -
Operation of Internal BGP (eBGP)
3.6 Multicast Routing: Introduction, Unicasting, Multicasting, 1 - -
broadcasting
3.7 MOSPF 1 - -
Module – 4:Transport Layer
4.1 Transport Layer: Transport Layer Services: process-to-process 1 - -
communication, ICANN Ranges, Encapsulation and Decapsulation,
Multiplexing and Demultiplexing, Flow control and Error Control

4.2 connectionless and connection-oriented service, Transport Layer 1 - -

protocols: Introduction, services, port numbers

4.3 User Datagram Protocol: User Datagram and UDP services 1 - -

4.4 Transmission Control Protocol: TCP services, TCP features, Segment 1 - -

4.5 TCP connection, Windows in TCP, Flow control (in brief) 2 - -

4.6 Error control: checksum, acknowledgement, generating 1 - -
acknowledgement, Retransmission- Retransmission after RTO,
retransmission after 3 duplicates, Out of order segments
4.7 TCP congestion control: congestion window, congestion detection, 1 - -
Congestion policies, fast recovery
Module – 5: Application Layer
5.1 Application Layer: Application-Layer Paradigms, Application 2 - -
Programming Interface (Socket and socket address)
5.2 Standard ClientServer Protocols: World Wide Web 1 - -
5.3 HTTP 1
5.4 FTP 1 - -
5.5 Electronic Mail 1
5.6 TELNET 1
5.7 Secure Shell (SSH) - components, Domain Name System (DNS) 1 - -
Total No. 40 Hours
of Hours
List of Experiments
1 Study of networking devices like Hub, Repeater, Bridge, Switch, 1

B.E. Blown up Syllabus – III Year 2

 The National Institute of Engineering, Mysuru A.Y: 2024-25
(2022 SCHEME)

Router, Gateway, Access point, MODEM and NIC

2 Write a program to implement the following Error Detection 1

Techniques
a. Cyclic Redundancy Check (CRC)
b. Checksum
3 a)Introduction to Cisco packet tracer. 1

b) Create basic topologies and assign IP address, subnet mask,

gateway IP address and test connectivity using PING
command.
4 Perform : 1
a) An Initial Switch Configuration.
(Host name, Console password, vty password, Privileged EXEC mode
password, Privileged EXEC mode secret, IP address on VLAN1
interface, Default gateway)

b) An Initial Router Configuration.

(Configure the router host name, configure the passwords, configure
the banner messages, verify the router configuration)
5 Configure and implement DHCP service in a Local Area Network. also 1
configure Cisco Router as a DHCP sever.
6 a. Implement the Static Routing and Default Routing. 1
b. Configure WEP on a Wireless Router.
7 Configure Dynamic Routing using RIP. 1
8 Using TCP/IP sockets, write a client – server program to make the 1
client send the file name and to make the server send back the contents
of the requested file if present.
9 Configure and implement DNS service. 1
10 Defining and using Access Control Lists. 1
Total No. of Lecture Hours 40 - 1
Total No. of Tutorial Hours 00 -
Total No. of Practical Hours 10
Total 50

Textbook:
1. BehrouzForouzan,” Data Communications and Networking”, Tata McGraw-Hill, 5th Edition, 2013.

Module 1:
Chapter 1: 1.2,1.3
Chapter 2:2.2,2.3
Chapter 18: 18.2,18.3,18.4(18.4.1,18.4.2,18.4.3,18.4.4,18.4.5)

Module 2:
Chapter 18: 18.5(18.5.1)
Chapter 19: 19.1.1,19.1.2,19.1.3,19.1.4, 19.2.3
Chapter 22: 22.1,22.2

B.E. Blown up Syllabus – III Year 3

 The National Institute of Engineering, Mysuru A.Y: 2024-25
(2022 SCHEME)

Module 3:
Chapter 20:20.2(20.2.1,20.2.2),20.3(20.3.2,20.3.3,20.3.4),
Chapter21 : 21.1 , 21.3.2

Module 4:
Chapter 23: 23.1.1,
Chapter 24: 24.1(24.1.1,24.1.2), 24.2(24.2.1,24.2.2), 24.3(24.3.1, 24.3.2, 24.3.3, 24.3.4, 24.3.6, 24.3.7, 24.3.8,
24.3.9)

Module 5:
Chapter 25: 25.1.2,25.2.1
Chapter 26: 26.1(26.1.1, 26.1.2), 26.2, 26.3(26.3.1), 26.4, 26.5(26.5.1), 26.6.

Reference Book:
1. Larry Peterson and Bruce S Davis “Computer Networks: A System Approach 5th Edition, Elsevier -2014
2. Computer Networks, Andrew S. Tanenbaum, Pearson Education, 4th Edition, 2002.
3. Data and Computer Communication, William Stallings, Pearson Education, 8th Edition, 2007

Online Resources:
1. https://archive.nptel.ac.in/courses/106/105/106105183/

B.E. Blown up Syllabus – III Year 4

 Code: BCS503 Course: Automata Theory and Computation
Credits: 4 L:T:P - 3:2:0
SEE: 100 Marks CIE: 100 Marks
SEE Hours: 3 Max. Marks:100

Prerequisites if Any Programming language, Discrete Mathematical structures

any
Learning 1. To give an overview of the theoretical foundations of computer science
objectives from the perspective of formal languages and illustrate finite state machines to
solve problems in computing
2. To familiarize Regular grammars, context frees grammar and also to
explain the hierarchy of problems arising in the computer sciences.

Course Outcomes:
On the successful completion of the course, the student will be able to
COs Course Outcomes Bloom’s level
CO1 Discuss basic concepts of formal languages and Automata Theory Understanding
CO2 Design Finite Automata for different Regular Expressions and Languages Apply
CO3 Construct context free grammar for various languages Apply
Analyze and solve problems related to normal form techniques, push down automata and Analyze
CO4 Turing Machines

Mapping with POs and PSOs:

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

CO1 3 2 2 3 - - - - - - - 2
CO2 3 3 3 3 2 - - - 3 2 2 2 3 2
CO3 3 3 3 3 2 - - - 3 2 2 2 2 2
CO4 3 3 3 3 2 - 2 - 3 2 2 2 2 2
Mapping Strength: Strong– 3 Medium – 2 Low – 1
Course Structure

No. of Lecture No. of Tutorial No. of

Hours Hours Practical
Hours
Module – 1: Introduction to Automata Theory
1.1 Central Concepts of Automata Theory 1
1.2 Finite Automata - Deterministic Finite Automata 2 1
1.3 Non Deterministic Finite Automata, NFA to DFA 2
1.4 Finite Automata with Epsilon Transitions 1
1.5 Elimination of Epsilon Transitions 1 1
 Module – 2: Regular Expressions and Languages
2.1 Regular Expressions 2
2.2 Finite Automata and Regular Expressions – DFA to 2 1
Regular Expression – Kleen’s closure
2.3 Finite Automata to Regular Expression – State 2
elimination
2.4 Regular Expression to Finite automata 1 1
2.5 Applications of Regular Expressions 1
Module – 3: Properties of Regular Languages, Context Free Grammars
3.1 Proving Languages not to be regular, Closure Properties 2
of regular languages
3.2 Equivalence and Minimization of Automata 2 1
3.3 Context Free Grammars 2 1
3.4 Leftmost, rightmost Derivations, Parse Trees, Ambiguity 2
in Grammars
Module – 4: Pushdown Automata
4.1 Pushdown Automata, Languages of PDA 2 1
4.2 Equivalence of PDA and CFG – Grammars to PDA 2
4.3 Elimination of Epsilon, Unit Productions, Useless 2 1
productions
4.4 Chomsky Normal Form 2 1
Module – 5: Turing Machines
5.1 Introduction to Turing Machines 2
5.2 Notation , Instantaneous description and transitions of 2 1
Turning Machine
5.3 Post’s Correspondence Problem 2
5.4 Introduction to Class P and NP problems 2
Total No. of Lecture Hours 40 - -
Total No. of Tutorial Hours 10 -
Total No. of Practical Hours 00

Textbook:
1. Textbook 1
John E Hopcroft, Rajeev Motwani, Jeffrey D Ullman, Introduction to Automata Theory,
Languages, and Computation, 3rd Edition, Pearson Education

Reference Book:
1. Sipser, Michael. Introduction to the Theory of Computation. 3rd ed. Cengage Learning, 2012.
ISBN: 9781133187790.
2. Peter Linz, An Introduction to Formal Languages and Automata, 6/e
 The National Institute of Engineering, Mysuru 2024-25

Machine Learning Algorithms Lab Semester 5

Course Code BCIL504 CIE Marks 50
Teaching Hours/Week(L: T:P) 0:0:2 SEE Marks 50
Credits 01 Exam Hours 2
Examination type(SEE) Practical

Course outcomes:

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

 Demonstrate proficiency in using Python libraries to carry out an end-to-end machine
learning project.
 Implement and evaluate various machine learning algorithms.
 Apply dimensionality reduction techniques and understand their impact on
machine learning models.
 Implement unsupervised learning techniques for clustering.

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 2 1 - 3 - - - - - - 2 2 2
CO2 2 2 2 2 3 - - - - - - - 2 2
CO3 2 2 2 3 2 - - - - - - - 3 3
CO4 2 2 2 2 3 - - - - - - - 2 2

Mapping Strength: Strong 3 Medium 2 Low 1

B.E . Blown up Syllabus III Year

 The National Institute of Engineering, Mysuru 2024-25

Sl. No Experiments

1 CO1 Introduction to Python for Machine Learning

Objective: Install necessary libraries and set up the environment for machine
learning in Python.

Tasks: Install Anaconda (or another Python distribution suitable for data science).

Create a new Python environment specifically for machine learning projects.

Write a Python script to install numpy , pandas, matplotlib, scikit-learn, and tensor
flow. Import these libraries and print their versions.
2 CO1 End-to-End Machine Learning Project

Objective: Work through a complete machine learning project.

Tasks: Use a real-world dataset, perform data cleaning, feature engineering, model
training, and evaluation.
3 CO2 Implementing Bayesian Decision Theory

Objective: Implement Bayesian Decision Theory for classification.

Tasks: Write a Python program to classify a given dataset using Bayesian

Decision Theory.
4 CO2 Classification Using MNIST Dataset

Objective: Implement a classifier for the MNIST dataset.

Tasks: Train a binary classifier on the MNIST dataset and evaluate its
performance using various metrics.
5 CO2 Training and Evaluating Linear Regression Models

Objective: Implement linear regression and evaluate its performance.

Tasks: Use a suitable dataset to train a linear regression model and evaluate its
performance using metrics such as RMSE and R² score.
6 CO2 Regularized Linear Models

Objective: Implement Ridge and Lasso regression.

Tasks: Compare the performance of Ridge and Lasso regression on a dataset and
analyze the effect of regularization.

B.E . Blown up Syllabus III Year

 The National Institute of Engineering, Mysuru 2024-25

7 CO3 Dimensionality Reduction Techniques

Objective: Apply PCA and LDA for dimensionality reduction.

Tasks: Implement PCA and LDA on a high-dimensional dataset and visualize the
results.
8 CO2 Support Vector Machines

Objective: Train and evaluate SVM classifiers.

Tasks: Implement linear and kernelized SVMs on a given dataset and compare
their performance.
9 CO2 Decision Trees and Random Forests

Objective: Implement and evaluate decision trees and random forests.

Tasks: Train a decision tree and a random forest classifier on a dataset, visualize
the trees, and evaluate their performance.
10 CO4 Clustering Algorithms

Objective: Implement various clustering algorithms.

Tasks: Apply K-means, Spectral, and Hierarchical clustering on a dataset and

compare the clustering results.

Textbook:
1. Introduction to Machine Learning by EthemAlpaydin
2. Hands-on Machine Learning with Scikit-Learn and TensorFlow by AurélienGéron

Virtual Labs(CSE):

1. http://cse01-iiith.vlabs.ac.in/ https://playground.tensorflow.org/

B.E . Blown up Syllabus III Year

 Code: BCI505 Course: MACHINE LEARNING
Credits: 3 L:T:P - 3:0:0
SEE: 50 Marks CIE: 50 Marks
SEE Hours: 3 Max. Marks:100
Prerequisites if any Statistics, Probability and linear Algebra

Learning objectives 1. Comprehensive understanding of what Machine Learning is, including its
uses, applications, and challenges.
2. Apply suitable machine learning techniques for data handling and to gain
knowledge from it.
3. Evaluate the performance of algorithms and to provide solution for
various real-world applications.

Course Outcomes:
On the successful completion of the course, the student will be able to
COs Course Outcomes Bloom’s level
Understand and articulate the core concepts of Machine Learning, including its Understanding
CO1
types, challenges,and real-world applications.
Design, implement, and evaluate different Machine Learning models, including Apply
CO2 Linear Regression, Support Vector Machines, and Decision Trees, using real-
world datasets.
Optimize machine learning models through hyper parameter tuning, Apply
CO3
regularization techniques, and dimensionality reduction methods
Apply decision trees and random forest algorithms, and select suitable Analyze
CO4
unsupervised machine learning techniques for analyzing unlabeled data.

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 2 - 2 2 1 - - 2 - - 2 2 2 2
CO2 2 - 2 2 2 - - 2 2 - - 2 2 2
CO3 2 2 3 2 1 1 - 2 - - - 2 3 3
CO4 2 - 2 2 1 - - 2 2 - - 2 2 2

Mapping Strength: Strong– 3 Medium – 2 Low – 1

 Course Structure
Sl. No. of No. of No. of
Modules Lecture Tutorial Practical
No
Hours Hours
Hours
Module – 1: The Machine Learning Landscape
1.1 The Machine Learning Landscape: What Is Machine Learning (ML)? 2
Uses and Applications with examples
1.2 Types of Machine Learning, Main Challenges of Machine Learning, 2
Testing and Validating.
1.3 End to End Machine Learning: Working with Real Data 2
1.4 Frame the Problem, Select the Performance Measure, Prepare the Data for 2
ML Algorithms, Training and Evaluating the Data Set.
1.5 Bayesian Decision Theory: Introduction, Classification. 2
Module – 2: Classification and Training Models
2.1 Classification: MNIST, Training Binary Classifier 2
2.2 Performance Measures, Multiclass classification. 2
2.3 Training Models: Linear Regression, Gradient Descent 2
2.4 Regularized Linear Models – Ridge & Lasso Regression. 2
Module – 3: Dimensionality Reduction and Support Vector Machines
3.1 Dimensionality Reduction: The Curse of Dimensionality, Main 2
Approaches for Dimensionality
3.2 PCA, Linear Discriminant Analysis (LDA). 2
3.3 Support Vector Machines: Linear SVM Classification, Nonlinear SVM 2
3.4 VM Regression, Kernelized SVMs. 2
Module – 4:Decision Trees
4.1 Decision Trees: Univariate Trees: classification & Regression Trees, 2
Training and Visualizing a Decision Tree
4.2 Pruning, Rule Extraction from Trees, Learning Rules from Data, Making 2
Predictions
4.3 Estimating Class Probabilities, CART Training Algorithm, Computational 2
Complexity
4.4 Gini Impurity or Entropy? Regularization Hyperparameters, Multivariate 2
Trees.
Module – 5: Ensemble Learning and Unsupervised Learning
5.1 Ensemble Learning and Random Forests: Voting Classifiers, Bagging 2
and Pasting, Random Patches
5.2 Random Subspaces, Random Forests, Boosting 2
5.3 Unsupervised Learning Techniques: Clustering – K means, Spectral, 2
Hierarchical
Total No. of Lecture Hours 40 - -
Total No. of Tutorial Hours 00 -
Total No. of Practical Hours 00

Textbook:
1. Introduction to Machine Learning, EthemAlpaydin, PHI Learning Pvt. Ltd, 3rd Edition, 2018.
2. Hands-on machine learning with Scikit-Learn and TensorFlow: concepts, tools, and techniques to build
intelligent systems, AurelienGeron, O'Reilly Media, 2019.
Reference Book:

1. Machine Learning, Tom Mitchell, McGraw Hill, 2013.

2. Probability and Statistics for Computer Scientists, Michael Baron, 3rd Edition, CRC press, 2019.
Online Resources:

1. https://nptel.ac.in/courses/106106139
2. https://www.coursera.org/programs/faculty-learning-program-iqr5x/specializations/ibm-intro-machine-
learning?source=search
The National Institute of Engineering, Mysuru 2023-24

Code: BCI516B Course: Information Retrieval

Credits: 3 L:T:P - 3:0:0
SEE: 100 Marks CIE: 50 Marks
SEE Hours: 3 Max. Marks: 100

Prerequisites if any Databases, Probability and Statistics.

Learning objectives  Equip students with skills in various retrieval models and pre-processing
techniques.
 Enable students to design and optimize search systems for web and
enterprise environments.

Course Outcomes:
On the successful completion of the course, the student will be able to
COs Course Outcomes Bloom’s level
Understand various information retrieval models, such as Boolean,
CO1 Understand
Vector Space, and Neural Network models.
Use pre-processing techniques and manage web data, including creating
CO2 Apply
inverted indexes and handling web spamming.
Retrieve structured text and multimedia information, addressing
CO3 Apply
challenges like the semantic gap and feature ambiguity.
Understand enterprise and web search systems, including search engine
CO4 Understand
architectures, ranking methods, and user interaction.

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 1 2 1 1 - - - - 1 - 2 2
CO2 2 3 2 3 2 1 - - - 2 1 - - -
CO3 3 2 2 2 2 - - - - - 2 - 2 2
CO4 3 2 2 3 2 1 1 - 1 2 - - - -

Mapping Strength: Strong– 3 Medium – 2 Low – 1

B.E. Blown up Syllabus – III Year

The National Institute of Engineering, Mysuru 2023-24

Course Structure

No. of No. of No. of

Sl.No Modules Lecture Tutorial Practical
Hours Hours Hours
Module – 1: Introduction to Information Retrieval
Information Vs Data Retrieval, Information Retrieval Models: 2
1.1 - -
Boolean Model
1.2 Vector Space Model, Language Model 2 - -
1.3 Multimedia Retrieval, Probabilistic Model 2 - -
1.4 Neural Network Model, Precision and Recall 2 - -
Module – 2: Text and Webpage Pre-Processing
2.1 Pre-processing Technique, Inverted index 2 - -
2.2 Latent Semantic Indexing, Web Search 2 - -
2.3 Simple Ranking Functions, Web Spamming 2 - -
2.4 Managing Web Data 2 - -
Module – 3: Structured Text Retrieval and Multimedia Information Retrieval
Structuring Power, Explicit vs. Implicit Structure, Static vs. 2
3.1 Dynamic Structure, Single Hierarchy vs. Multiple Hierarchies - -

Early Text Retrieval Models, Model Based on Non-Overlapping 2

3.2 Lists, Model Based on Proximal Nodes, Ranking Structured - -
Text Results
What is Multimedia? Multimedia IR,Text IR versus Multimedia 2
3.3 IR, The Challenges, The Semantic Gap,Feature Ambiguity, - -
Machine-generated Data
Content-based Image Retrieval, Color-Based Retrieval, Texture, 2
3.4 - -
Salient Points
Module – 4:Web Retrieval and Web Crawling
Search Engine Architectures: Cluster based Architecture,
4.1 2 - -
Distributed Architectures
Search Engine Ranking: Link based Ranking, Simple Ranking
4.2 2 - -
Functions, Learning to Rank

B.E. Blown up Syllabus – III Year

The National Institute of Engineering, Mysuru 2023-24

4.3 Search Engine User Interaction 2 - -

4.4 Browsing, Applications of a Web Crawler 2 - -
Module – 5: Enterprise Search
Characteristics and Applications of Enterprise Search,
5.1 2 - -
Enterprise Search Software, Workplace Search
Enterprise Search Tasks, Examples of Search-Supported Tasks,
5.2 2 - -
Search Types, Studying Enterprise Search
5.3 Architecture of Enterprise Search Systems, Gathering 2 - -
5.4 Extracting, Indexing 2 - -
Total No. of Lecture Hours 40 - -
Total No. of Tutorial Hours 00 -
Total No. of Practical Hours 00

Textbook:
1. Ricardo Baeza-Yates and Berthier Ribeiro-Neto, ―Modern Information Retrieval: The Concepts
and Technology behind Search, Second Edition, ACM Press Books.
2. Ricci, F, Rokach, L. Shapira, B.Kantor, ―Recommender Systems Handbook, First Edition.

Reference Book:
1. C. Manning, P. Raghavan, and H. Schütze, ―Introduction to Information Retrieval, Cambridge
University Press.
2. Stefan Buettcher, Charles L. A. Clarke and Gordon V. Cormack, ―Information Retrieval:
Implementing and Evaluating Search Engines, The MIT Press.

Online Resources:

1. Coursera Course Link: https://www.coursera.org/learn/text-retrieval

2. YouTube Video Link: https://www.youtube.com/watch?v=Q72hzU1Z6aQ

B.E. Blown up Syllabus – III Year

 The National Institute of Engineering, Mysuru 2024-25

Code: BCI586 Course: Minor Project

Credits: 2 L:T:P:0:0:4
CIE: 50 Marks Max. Marks: 50

Prerequisites if Form a team , Project objectives, Literature survey, identify resources, define
any Methodology, documentation.
Learning Clearly state the goals and objectives of the project.
objectives
Determine the scope and expected outcomes.
Collaborate with classmates for the project teamwork.
Assign roles and responsibilities based on each team members strengths.
Identify potential risks and challenges that might arise during the project.
Maintain detailed records of your project , design, and development process.
Prepare to present your findings and results clearly and comprehensively.

Course Outcomes:
On the successful completion of the course ,the student will be able to

COs Course Outcomes level

CO1 Conceptualize, design and implement solutions for specific problems Apply
Apply resource management skills for projects and Communicate the solutions
CO2 Apply
through presentations and technical reports

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 - 2 3 1 2 1 1 - - - - - 2 2
CO2 - - - - - - 1 1 1 1 1 2 2 2
Mapping Strength: Strong 3 Medium 2 Low 1

B.E . Blown up Syllabus III Year

The National Institute of Engineering, Mysuru 2024-2025

Code: BRMK557 Course: Research Methodology & IPR

Credits: 2 CIE: 50 Marks
L:T:P- 2:0:0 SEE: 50 Marks
SEE Hours: 2 Total Marks: 50

Prerequisites (if any) NIL

Learning 1. To explain basics of research and its types

objectives 2. To acquire knowledge of Literature Review, Technical Reading, Attributions and Citations
3. To practice Ethics in Engineering Research
4. To gain knowledge of Intellectual Property Rights in engineering

Course Outcomes:
On the successful completion of the course, the student will be able to

COs Course Outcomes Bloom’s level

CO1 Understand the knowledge on basics of research and its types. Understand
CO2 Learn the concept of Literature Review, Technical Reading, Attributions and Citations. Understand
CO3 Learn Ethics in Engineering Research. Understand
CO4 Analyze the application of Intellectual Property Rights in engineering. Analyze

Mapping with POs and PSOs:

COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 - - 3 3 3 3 3 3 - 3 2 2
CO2 3 2 - - 3 3 3 3 3 3 - 3 3 3
CO3 3 2 - - 3 3 3 3 3 3 - 3 - -
CO4 3 3 3 3 3 3 3 3 3 3 3 3 2 2
Mapping Strength: Strong– 3 Medium – 2 Low – 1

Course Structure

No. of No. of No. of

Lecture Tutorial Practical
Hours Hours Hours
Module – 1
Introduction: Meaning of Research, Objectives of Engineering Research, and Motivation in
1.1 Engineering Research, Types of Engineering Research.
2 - -
1.2 Finding and Solving a Worthwhile Problem. 1 - -
Ethics in Engineering Research, Ethics in Engineering Research Practice, Types of Research
1.3 2 - -
Misconduct, Ethical Issues Related to Authorship.
Module – 2
Literature Review and Technical Reading, New and Existing Knowledge, Analysis and Synthesis
of Prior Art Bibliographic Databases, Web of Science, Google and Google Scholar, 1 - -
2.1
Effective Search: The Way Forward Introduction to Technical Reading Conceptualizing Research,
2.2
Critical and Creative Reading, Taking Notes While Reading, Reading Mathematics and 2 - -
Algorithms, Reading a Datasheet.
2.3 Attributions and Citations: Giving Credit Wherever Due, Citations: Functions and Attributes,
Impact of Title and Keywords on Citations, Knowledge Flow through Citation, Citing Datasets,
2 - -
Styles for Citations, Acknowledgments and Attributions, What Should Be Acknowledged,
Acknowledgments in, Books Dissertations, Dedication or Acknowledgments.
Module – 3
Introduction To Intellectual Property: Role of IP in the Economic and Cultural Development of the
3.1 Society, IP Governance, IP as a Global Indicator of Innovation, Origin of IP History of IP in India. Major 1 - -
Amendments in IP Laws and Acts in India.

3.2 Patents: Conditions for Obtaining a Patent Protection, To Patent or Not to Patent an Invention. Rights
Associated with Patents. Enforcement of Patent Rights. Inventions Eligible for Patenting. Non- 2 - -
Patentable Matters. Patent Infringements. Avoid Public Disclosure of an Invention before Patenting.
Process of Patenting.
3.3 Process of Patenting. Prior Art Search. Choice of Application to be Filed. Patent Application Forms.
Jurisdiction of Filing Patent Application. Publication. Pre-grant Opposition. Examination. Grant of a
Patent. Validity of Patent Protection. Post-grant Opposition. Commercialization of a Patent. Need for a 2 - -
Patent Attorney/Agent. Can a Worldwide Patent be Obtained? Do I Need First to File a Patent in India?
Patent Related Forms. Fee Structure. Types of Patent Applications. Commonly Used Terms in

B.E. Blown up Syllabus – III Year

The National Institute of Engineering, Mysuru 2024-2025
Patenting. National Bodies Dealing with Patent Affairs. Utility Models.
Module – 4
Copyrights and Related Rights: Classes of Copyrights. Criteria for Copyright. Ownership of
Copyright. Copyrights of the Author. Copyright Infringements. Copyright Infringement is a Criminal
4.1
Offence. Copyright Infringement is a Cognizable Offence. Fair Use Doctrine. Copyrights and 1 - -
Internet. Non-Copyright Work.

Copyright Registration. Judicial Powers of the Registrar of Copyrights. Fee Structure. Copyright
4.2
Symbol. Validity of Copyright. Copyright Profile of India. Copyright and the word ‘Publish’. Transfer
of Copyrights to a Publisher. Copyrights and the Word ‘Adaptation’. Copyrights and the Word
2 - -
‘Indian Work’. Joint Authorship. Copyright Society. Copyright Board. Copyright Enforcement
Advisory Council (CEAC). International Copyright Agreements, Conventions and Treaties.
Interesting Copyrights Cases.
4.3 Trademarks: Eligibility Criteria. Who Can Apply for a Trademark. Acts and Laws. Designation of
Trademark Symbols. Classification of Trademarks. Registration of a Trademark is Not Compulsory.
Validity of Trademark. Types of Trademark Registered in India. Trademark Registry. Process 2 - -
for Trademarks Registration. Prior Art Search. Famous Case Law: Coca-Cola Company vs. Bisleri
International Pvt. Ltd.
Module – 5
Industrial Designs: Eligibility Criteria. Acts and Laws to Govern Industrial Designs. Design Rights.
Enforcement of Design Rights. Non-Protectable Industrial Designs India. Protection Term. Procedure
5.1 for Registration of Industrial Designs. Prior Art Search. Application for Registration. Duration of the
Registration of a Design. Importance of Design Registration. Cancellation of the Registered Design.
2 - -
Application Forms. Classification of Industrial Designs. Designs Registration Trend in India.
International Treaties. Famous Case Law: Apple Inc. vs. Samsung Electronics Co.
5.2 Geographical Indications: Acts, Laws and Rules Pertaining to GI. Ownership of GI. Rights Granted
to the Holders. Registered GI in India. Identification of Registered GI. Classes of GI. Non-Registerable
GI. Protection of GI. Collective or Certification Marks. Enforcement of GI Rights. Procedure for GI 2 - -
Registration Documents Required for GI Registration. GI Ecosystem in India.

5.3 Case Studies on Patents. Case study of Curcuma (Turmeric) Patent, Case study of Neem Patent, -
Case study of Basmati patent.
1 -
Total No. of Lecture Hours 25
Total No. of Tutorial Hours - -
Total No. of Practical Hours -

Textbooks:
1. Dr. Santosh M Nejakar, Dr. Harish Bendigeri “Research Methodology and Intellectual Property Rights”, ISBN 978-93-5987-928-4,
Edition: 2023-24.

Reference Books:
1. David V. Thiel “Research Methods for Engineers” Cambridge University Press, 978-1-107-03488-4
2. Intellectual Property Rights by N.K.Acharya Asia Law House 6th Edition. ISBN: 978-93-81849-30-9

Online Resources:

1. https://onlinecourses.swayam2.ac.in/ntr24_ed08/preview

B.E. Blown up Syllabus – III Year