Artificial Intelligence

Course Code MCS101 CIE Marks 50

Teaching 3:0:2 SEE Marks 50
Hours/Week
(L:P:SDA)
Total Hours of 50 Total Marks 100
Pedagogy
Credits 03 Exam Hours 03
Course Learning Objectives:
● Define the foundational concepts of artificial intelligence and key problem-solving techniques.
● Explain the knowledge representation and reasoning techniques to solve complex problems in AI systems.
● Use machine learning algorithms to evaluate their performance in real-world applications.
● Build the applications of natural language processing and robotics to enhance human-computer interaction.
● Explore the ethical considerations and societal implications of AI technologies.
Module-1
Module 1:Introduction to Artificial Intelligence and Problem Solving, Definition and scope of AI, History and evolution of
AI, Types of AI: Narrow AI vs. General AI, Problem formulation and problem-solving techniques, Search algorithms:
Uninformed and informed search strategies, Heuristic search and constraint satisfaction problems.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-2
Module 2: Knowledge Representation and Reasoning, Types of knowledge representation, Propositional logic and first-order
logic ,Semantic networks and frames, Ontologies and their applications, Deductive and inductive reasoning, Rule-based systems
and non-monotonic reasoning, Probabilistic reasoning and Bayesian networks.
Teaching-
Learnin Chalk and talk/PPT/case study/web content
g
Process
Module-3
Module 3: Machine Learning, Introduction to machine learning, Supervised, unsupervised, and reinforcement learning,
Common algorithms: Decision trees, SVM, neural networks Evaluation metrics for machine learning models ,Practical
applications of machine learning in AI systems.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-4
Module 4: Natural Language Processing and Robotics, Basics of natural language processing (NLP), Text processing and
language models, Sentiment analysis and language generation, Robotics fundamentals and sensor technologies, Robot
kinematics, control, and applications of AI in robotics.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-5
Module 5: Ethical and Societal Implications of AI, Ethical considerations in AI development ,AI and job displacement
,Privacy concerns and data security, Bias and fairness in AI algorithms, Accountability and transparency in AI systems, The role
of government and regulation in AI, Public perception and trust in AI technologies, Future of AI and its impact on society.
Teaching- Chalk and talk/PPT/case study/web content
Learni
ng
Proces
s

@#@#@
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The minimum
passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the maximum marks of
SEE. A student shall be deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Three Unit Tests each of 20 Marks
2. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks
to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
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:

1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions) from each
module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module.
Suggested Learning Resources:
Text Books:
1. Artificial Intelligence: A Modern Approach" by Stuart Russell and Peter Norvig, 4th Edition (2021)
2. "Deep Learning" by Ian Goodfellow, Yoshua Bengio, and Aaron Courville third Edition.
Reference Books:
1. "Pattern Recognition and Machine Learning" by Christopher M. Bishop Edition: fourth Edition (2020)
"Artificial Intelligence: Foundations of Computational Agents" by David L. Poole and Alan K. Mackworth
Edition: third Edition (2021).
Web links and Video Lectures (e-Resources):
● https://cs221.stanford.edu
● https://www.kaggle.com/learn/machine-learning
● https://www.youtube.com/playlist?list=PLkDaE6sXhPqQ5s2cW2g1iGgC4eD9W6xZ2
● https://www.youtube.com/playlist?list=PLD6B6F0A3B1D4D3D8A7E3C5E8A7B2E0C

Skill Development Activities Suggested

● The students with the help of the course teacher can take up relevant technical –activities which will enhance
their skill. The prepared report shall be evaluated for CIE marks.

Course outcome (Course Skill Set)

At the end of the course the student will be able to:
Sl. No. Description Blooms Level
CO1 Explain the foundational concepts of artificial intelligence, including its history, types, and key L2
problem-solving techniques.

CO2 Apply knowledge representation and reasoning techniques to solve complex problems in AI L3
systems.

CO3 Implement machine learning algorithms and evaluate their performance in real-world L2
applications.

CO4 Explore the principles and applications of natural language processing and robotics to enhance L4
human-computer interaction.

@#@#@
Mapping of COS and Pos

PO1 PO2 PO3 PO4 PO5 PO6

CO1 x x

CO2 x x

CO3 x

CO4 x

Program Outcome of this course

Sl. Description POs

No.
1 Demonstrate the ability to independently conduct research anddevelopment work to address practical PO1
engineering problems.

2 PO2
Develop and deliver comprehensive technical presentations thateffectively convey complex information to
diverse audiences.

3 Exhibit mastery in the specialized study area, surpassing therequirements of a relevant bachelor's program. PO3

4 Analyze engineering problems critically and apply appropriatetechniques, skills, and modern tools to develop PO4
innovative solutions.

5 Collaborate effectively in teams while also functioningindependently, recognizing opportunities for career PO5
advancement andresearch.

6 Cultivate a proactive approach to continuous learning andprofessional development in response to evolving PO6
technologicallandscapes.

@#@#@
 Data Science and Management
Course Code MCS102 CIE Marks 50
Teaching Hours/Week (L:P:SDA) 4:0:2 SEE Marks 50
Total Hours of Pedagogy 50 Total Marks 100
Credits 03 Exam Hours 03

Course Learning objectives:

1. Explain the foundational concepts of data science, including its history, significance, and the data
science process.
2. Apply statistical methods and data analysis techniques to interpret and draw insights from complex
datasets.
3. Implement various machine learning algorithms and assess their performance using appropriate
evaluation metrics in real-world scenarios.
4. Utilize data visualization tools and techniques to effectively communicate findings and insights to
diverse audiences.

Module-1
Module 1:Introduction to Data Science and R Tool, Overview of Data Science Importance of Data Science in
Engineering , Data Science Process , Data Types and Structures, Introduction to R Programming, Basic Data
Manipulation in R, Simple programs using R.Introduction to RDBMS: Definition and Purpose of RDBMS
Key Concepts: Tables, Rows, Columns, and Relationships, SQL Basics: SELECT, INSERT, UPDATE,
DELETE Importance of RDBMS in Data Management for Data Science
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-2
Module 2: Linear Algebra for Data Science, Algebraic View, Vectors and Matrices, Product of Matrix &
Vector, Rank and Null Space, Solutions of Over determined Equations, Pseudo inverse, Geometric View,
Vectors and Distances, Projections, Eigenvalue Decomposition.
Teaching-
Learning Chalk and talk/PPT/case study/web content
Process
Module-3
Module 3: Statistical Foundations, Descriptive Statistics, Notion of Probability, Probability Distributions
Understanding Univariate and Multivariate Normal Distributions, Mean, Variance, Covariance, and
Covariance Matrix, Introduction to Hypothesis Testing, Confidence Intervals for Estimates.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process

Module-4
Module 4: Optimization and Data Science Problem Solving, Introduction to Optimization
Understanding Optimization Techniques, Typology of Data Science Problems, Solution Framework for Data
Science Problems.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-5

@#@#@
Module 5: Regression and Classification Techniques, Linear Regression , Simple Linear Regression and
Assumptions, Multivariate Linear Regression, Model Assessment and Variable Importance, Subset
Selection, Classification Techniques , Classification using Logistic Regression.
Teaching- Chalk and talk/PPT/case study/web content
Learning
Process

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum total of the
CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Three Unit Tests each of 20 Marks
2. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
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:

1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module

@#@#@
 Suggested Learning Resources:
Text Books:
1. "Python for Data Analysis" by Wes McKinney, 2nd Edition (2018)
2. "Data Science from Scratch: First Principles with Python" by Joel Grus, 2nd Edition (2019)

Reference Books:
1. "An Introduction to Statistical Learning" by Gareth James, Daniela Witten, Trevor Hastie, and Robert
Toshigami, 2nd Edition (2021)
2. "The Elements of Statistical Learning" by Trevor Hastie, Robert Toshigami, and Jerome Friedman, 2nd
Edition (2009)
3. "Data Science for Business: What You Need to Know about Data Mining and Data-Analytic Thinking" by
Foster Provost and Tom Fawcett, 2nd Edition (2013)
Web links and Video Lectures (e-Resources):
https://www.coursera.org/specializations/jhu-data-science
https://www.kaggle.com/learn/data-science
https://www.edx.org/professional-certificate/harvardx-data-science
https://www.youtube.com/playlist?list=PL4cUxeGkcC9g1s4L6G8p8Fq5XK6Pq7b1k

Sl. No. Description

1 Demonstrate the ability to independently conduct research anddevelopment work to address practical engineerin

2
Develop and deliver comprehensive technical presentations thateffectively convey complex information to diver

3 Exhibit mastery in the specialized study area, surpassing therequirements of a relevant bachelor's program.

4 Analyze engineering problems critically and apply appropriatetechniques, skills, and modern tools to develop in

5 Collaborate effectively in teams while also functioningindependently, recognizing opportunities for career advan

6 Cultivate a proactive approach to continuous learning andprofessional development in response to evolving tech

Skill Development Activities Suggested

● The students with the help of the course teacher can take up relevant technical activities which will
enhance their skill. The prepared report shall be evaluated for CIE marks.

Course outcome (Course Skill Set)

At the end of the course the student will be able to:
Sl. No. Description Blooms
Level
CO1 Explore the foundational concepts of data science, history, significance, and process. L3

CO2 Apply statistical methods and data analysis techniques to interpret and draw insights from L3
complex datasets.
CO3 Implement various machine learning algorithms and assess their performance using L2
appropriate evaluation metrics in real-world scenarios.
CO4 Utilize data visualization tools and techniques to effectively communicate findings and L4
insights to diverse audiences.

@#@#@
 Data Structures & Algorithms for Problem Solving
Course Code MCS103 CIE Marks 50
Teaching Hours/Week 2:0:2 SEE Marks 50
(L:P:SDA)
Total Hours of Pedagogy 50 Total Marks 100
Credits 03 Exam Hours 03
Course Learning Objectives:
● To reduce development time and the resources required to maintain existing applications.
● To increase code reuse and provide a competitive advantage through effective use of data structures
and algorithms.
Module-1
Search Trees: Two Models of Search Trees. General Properties and Transformations. Height of a Search Tree.
Basic Find, Insert, and Delete. Returning from Leaf to Root. Dealing with Non unique Keys. Queries for the
Keys in an Interval. Building Optimal Search Trees. Converting Trees into Lists. Removing a Tree. Balanced
Search Trees: Height-Balanced Trees. Weight-Balanced Trees. (a, b)- And B-Trees. Red-Black Trees and
Trees of Almost Optimal Height. Top-Down Rebalancing for Red-Black Trees.
Teaching
Learning Chalk and talk/PPT/web content
Process
Module-2
Tree Structures for Sets of Intervals. Interval Trees. Segment Trees. Trees for the Union of Intervals. Trees for
Sums of Weighted Interval. Trees for Interval-Restricted Maximum Sum Queries. Orthogonal Range Trees.
Higher-Dimensional Segment Trees. Other Systems of Building Blocks. Range-Counting and the Semigroup
Model. Kd-Trees and Related Structures.
Teaching-
Learning Chalk and talk/PPT/case study/web content
Process
Module-3
Heaps: Balanced Search Trees as Heaps. Array-Based Heaps. Heap-Ordered Trees and Half Ordered Trees.
Leftist Heaps. Skew Heaps. Binomial Heaps. Changing Keys in Heaps. Fibonacci Heaps. Heaps of Optimal
Complexity. Double-Ended Heap Structures and Multidimensional Heaps. Heap-Related Structures with
Constant-Time Updates.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-4
Graph Algorithms: Bellman - Ford Algorithm; Single source shortest paths in a DAG; Johnson’s Algorithm
for sparse graphs; Flow networks and Ford-Fulkerson method; Maximum bipartite matching. Polynomials and
the FFT: Representation of polynomials; The DFT and FFT; Efficient implementation of FFT.
Teaching Chalk and talk/PPT/case study/web content
Learning
Process
Module-5
String-Matching Algorithms: Naïve string Matching; Rabin - Karp algorithm; String matching with finite
automata; Knuth-Morris-Pratt algorithm; Boyer – Moore algorithms.

Teaching- Chalk and talk/PPT/case study/web content

Learning
Process

@#@#@
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Three Unit Tests each of 20 Marks
2. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
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:
1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions) from
each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module

Suggested Learning Resources:

Text Books:
1. Advanced Data Structures, Peter Brass, Cambridge University Press, 2008.
2. Kenneth A. Berman. Algorithms. Cengage Learning. 2002.
3. T. H Cormen, C E Leiserson, R L Rivest and C Stein. Introduction to Algorithms. PHI, 3rd Edition, 2010
Text Books:
1. Data Structures and Algorithm Analysis in C++, Mark Allen Weiss, 4 th Edition, 2014, Pearson.
2. Data structures with Java, Ford and Topp, Pearson Education.
3. Ellis Horowitz, SartajSahni, S.Rajasekharan. Fundamentals of Computer Algorithms. Universities press. 2nd
Edition, 2007
4. Data structures and Algorithms in Java, M.T.Goodrich, R.Tomassia, 3rd edition, Wiley India Edition.

Web links and Video Lectures (e-Resources):

https://www.coursera.org/learn/advanced-data-structures
https://nptel.ac.in/courses/106106133
https://pages.cs.wisc.edu/~shuchi/courses/787-F07/about.html
https://www.youtube.com/watch?v=0JUN9aDxVmI&list=PL2SOU6wwxB0uP4rJgf5ayhHWgw7akUWSf
Skill Development Activities Suggested
● The students with the help of the course teacher can take up relevant technical activities
which will enhance their skills. The prepared report shall be evaluated for CIE marks.

Course outcome (Course Skill Set)

At the end of the course the student will be able to:
Sl. No. Description Blooms
Level
CO1 Analyze and apply fundamental data structures and algorithms to solve complex L4
computational problems effectively
CO2 Evaluate and implement various searching, sorting to optimize algorithm performance. L5

CO3 Design and analyze advanced tree and graph algorithms, including balanced search trees L5
and graph traversal methods, to address real-world applications

@#@#@
Sl. No. Description POs
1 Demonstrate the ability to independently conduct research anddevelopment work to address practical PO1
engineering problems.

2 PO2
Develop and deliver comprehensive technical presentations thateffectively convey complex information to
diverse audiences.

3 Exhibit mastery in the specialized study area, surpassing therequirements of a relevant bachelor's program. PO3

4 Analyze engineering problems critically and apply appropriatetechniques, skills, and modern tools to PO4
develop innovative solutions.

5 Collaborate effectively in teams while also functioningindependently, recognizing opportunities for career PO5
advancement andresearch.

6 Cultivate a proactive approach to continuous learning andprofessional development in response to evolving PO6
technologicallandscapes.

Program Outcome of this course

PO1 PO2 PO PO4 PO5 PO6

3
CO1 x x
CO2 x x
CO3 x
CO4 x

@#@#@
 Software
Advanced Engineering
Software Engineering
Course Code MCS104E
MCS104C CIE Marks 50
Teaching Hours/Week (L:P:SDA) 2:0:2 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03

Course Learning objectives:

● Reduce the development time, and resources required to maintain existing applications.
● Increase code reuse, and provide a competitive advantage to organizations that uses it.

Module-1
INTRODUCTION: What is software engineering? Software Engineering Concepts, Development Activities, Managing
Software Development, Modelling with UML, Project Organization and Communication.

Teaching-
Learning Chalk and Talk/ PPT
Process
Module-2
REQUIREMENT ELICITATION AND ANALYSIS: Requirements Elicitation: Requirements Elicitation Concepts,
Requirements Elicitation Activities, Managing Requirements Elicitation, Analysis: Analysis Concepts, Analysis
Activities, Managing Analysis.

Teaching-
Learning Chalk and Talk/ PPT
Process
Module-3
SYSTEM DESIGN: System design-Decomposing the system: Overview of System Design, System Design Concepts,
System Design Activities: Objects to Subsystems, System Design – Addressing design goals: Activities: An overview of
system design actives, UML deployment diagrams, Addressing Design Goals, Managing System Design.

Teaching-
Learning Chalk and Talk/ PPT
Process
Module-4
OBJECT DESIGN, IMPLEMENTATION AND TESTING : Object design-Reusing pattern solutions: An Overview of
Object Design, Reuse Concepts: Design Patterns, Reuse Activities, Managing Reuse, Object design-Specifying interface:
An overview of interface specification, Interfaces Specification Concepts, Interfaces Specification Activities, Managing
Object Design, Mapping model to code: Mapping Models to Code Overview, Mapping Concepts,
Mapping Activities, Managing Implementation, Testing: An overview of testing, Testing concepts, Managing testing.
Teaching-
Learning Chalk and Talk/ PPT
Process
Module-5
SOFTWARE MAINTENANCE AND SOFTWARE CONFIGURATION MANAGEMENT: Software maintenance: What is
Software Maintenance?, Factors that Mandate Change, Lehman’s Laws of system evolution, Types of software
maintenance, Software maintenance process and actives, Reverse Engineering, Software Re-engineering, Patterns for
Software Maintenance, Tool support for Software Maintenance. Software Configuration Management: The baseline of
Software Life Cycle, What is Software Configuration Management, Why Software Configuration
Management, Software Configuration Management Functions, Software Configuration Management Tools.

@#@#@
Teaching-
Learning Chalk and Talk/ PPT
Process
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The minimum
passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the maximum marks of
SEE. A student shall be deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures not less than 50% (50 marks out of 100) in the sum total of the CIE (Continuous Internal
Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
● Three Unit Tests each of 20 Marks
● Two assignments each of 20 Marks or one Skill Development Activity of 40 marks
● to attain the COs and POs

The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
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:

● The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.
● The question paper will have ten full questions carrying equal marks.
● Each full question is for 20 marks. There will be two full questions (with a maximum of four sub-questions) from
each module.
● Each full question will have a sub-question covering all the topics under a module.
● The students will have to answer five full questions, selecting one full question from each module

Suggested Learning Resources:

Books
3. Object-Oriented Software Engineering, Bernd Bruegge, Alan H Dutoit, Pearson Education, 3 rd edition, 2014.
4. Object oriented software engineering, David C. Kung, Tata McGraw Hill 2015.
5. Object oriented software engineering, Stephan R. Schach, Tata McGraw Hill 2008.
6. Applying UML and Patterns, Craig Larman, Pearson Education 3rd ed, 2005

Web links and Video Lectures (e-Resources):

1. https://medium.com/javarevisited/my-favorite-courses-to-learn-object-oriented-programming-and- design-
in-2019-197bab351733
2. https://www.youtube.com/watch?v=BqVqjJq7_vI

Skill Development Activities Suggested

The students with the help of the course teacher can take up relevant technical activities which will enhance their skill. The
prepared report shall be evaluated for CIE marks.

Course outcome (Course Skill Set)

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

Sl. No. Description Blooms Level
CO1 Apply Object Oriented Software Engineering approach in every aspect of software L3
project
CO2 Adapt appropriate object oriented design aspects in the development process L4 CO3 Adapt the concepts and
tools related to software configuration management L4

@#@#@
Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6

CO1 X X
CO2 X X
CO3 X X
CO4 x x

@#@#@
 Internet of Things
Course Code MCS105D CIE Marks 50
Teaching Hours/Week (L:P:SDA) 3 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Course Learning objectives:

● Explore the knowledge on combination of functionalities and services of networking

● Explain the definition and significance of the Internet of Things.
● Discuss the architecture, operation and business benefits of an IoT solution.

Module-1
What is The Internet of Things? Overview and Motivations, Examples of Applications, IPV6
Role, Areas of Development and Standardization, Scope of the Present Investigation. Internet
of Things Definitions and frameworks-IoT Definitions, IoT Frameworks, Basic Nodal
Capabilities. Internet of Things Application Examples-Overview, Smart Metering/Advanced
Metering Infrastructure-Health/Body Area Networks, City Automation, Automotive
Applications, Home Automation, Smart Cards, Tracking, OverThe-Air-Passive
Surveillance/Ring of Steel, Control Application Examples, Myriad
Other Applications.
Teaching- Chalk and talk
Learning PPT
Process
Module-2
Fundamental IoT Mechanism and Key Technologies-Identification of IoT Object and
Services, Structural Aspects of the IoT, Key IoT Technologies. Evolving IoT Standards-
Overview and Approaches, IETF IPV6 Routing Protocol for RPL Roll, Constrained
Application Protocol, Representational State Transfer, ETSI M2M, Third Generation
Partnership Project Service Requirements for Machine-Type Communications, CENELEC,
IETF IPv6 Over Low power WPAN, Zigbee IP(ZIP),IPSO
Teaching- Chalk and talk
Learning PPT
Process
Module-3
Layer ½ Connectivity: Wireless Technologies for the IoT-WPAN Technologies for IoT/M2M,
Cellular and Mobile Network Technologies for IoT/M2M, Layer 3 Connectivity
:IPv6 Technologies for the IoT: Overview and Motivations. Address Capabilities, IPv6
Protocol Overview, IPv6 Tunneling, IPsec in IPv6,Header Compression Schemes, Quality of
Service in IPv6, Migration Strategies to IPv6
Teaching- Chalk and talk
Learning PPT
Process
Module-4
Case Studies illustrating IoT Design-Introduction, Home Automation, Cities, Environment,
Agriculture, Productivity Applications.

@#@#@
 Teaching- Chalk and talk
Learning PPT
Process
Module-5
Data Analytics for IoT – Introduction, Apache Hadoop, Using HadoopMapReduce for Batch
Data Analysis, Apache Oozie, Apache Spark, Apache Storm, Using Apache Storm for Real-
time Data Analysis, Structural Health Monitoring Case Study.
Teaching- Chalk and talk
Learning PPT
Process
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%. The
minimum passing mark for the CIE is 50% of the maximum marks. Minimum passing marks in SEE is 40% of the
maximum marks of SEE. A student shall be deemed to have satisfied the academic requirements and earned the
credits allotted to each subject/ course if the student secures not less than 50% (50 marks out of 100) in the sum total
of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
Continuous Internal Evaluation:
1. Three Unit Tests each of 20 Marks
2. Two assignments each of 20 Marks or one Skill Development Activity of 40 marks
to attain the COs and POs
The sum of three tests, two assignments/skill Development Activities, will be scaled down to 50 marks
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:

1. The SEE question paper will be set for 100 marks and the marks scored will be proportionately reduced to 50.
2. The question paper will have ten full questions carrying equal marks.
3. Each full question is for 20 marks. There will be two full questions (with a maximum of four sub- questions)
from each module.
4. Each full question will have a sub-question covering all the topics under a module.
5. The students will have to answer five full questions, selecting one full question from each module

Suggested Learning Resources:

Books
9. Building the Internet ofThings with IPv6 and MIPv6: The Evolving World of M2M
Communications Daniel Minoli Wiley 2013
10. Internet of Things: A Hands-on Approach ArshdeepBahga, Vijay Madisetti Universities
Press 2015
11. The Internet of Things Michael Miller Pearson 2015 First Edition
12. Designing Connected Products Claire Rowland,Elizabeth Goodman et.al O’Reilly First
Edition, 2015

Web links and Video Lectures (e-Resources):

@#@#@
● https://www.tutorialspoint.com/internet_of_things/index.htm#:~:text=IoT%20(Internet%20of%20Things)
%20is,to%20any%20industry%20or%20system.
● https://www.javatpoint.com/iot-internet-of-things
● https://www.digimat.in/nptel/courses/video/106105166/L01.html(Video Lectures)

Skill Development Activities Suggested

The students with the help of the course teacher can take up relevant technical – activities which
will enhance their skill
Course outcome (Course Skill Set)
At the end of the course the student will be able to :
Sl. No. Description Blooms Le
CO1 Choose appropriate schemes for the applications of IOT in real time L2
scenarios
CO2 Manage the Internet resources through different protocols used in each L1
layer
CO3 Compare various protocols and algorithms in different layers that facilitate L3
effective communication mechanisms
CO4 Identify how IoT differs from traditional data collection systems L2

@#@#@
ogram Outcome of this course
Sl. No. Description POs
1 Demonstrate the ability to independently conduct research anddevelopment work to address PO1
practical engineering problems.

2 PO2
Develop and deliver comprehensive technical presentations thateffectively convey complex
information to diverse audiences.

3 Exhibit mastery in the specialized study area, surpassing therequirements of a relevant PO3
bachelor's program.

4 Analyze engineering problems critically and apply appropriatetechniques, skills, and modern PO4
tools to develop innovative solutions.

5 Collaborate effectively in teams while also functioningindependently, recognizing PO5

opportunities for career advancement andresearch.

6 Cultivate a proactive approach to continuous learning andprofessional development in PO6

response to evolving technologicallandscapes.

PO1 PO2 PO3 PO4 PO5 PO6

CO1 x x
CO2
CO3 x
CO4 x
Mapping of COS and POs

@#@#@
 ALGORITHMS & AI LABORATORY

Course Code MCSL106 CIE Marks 40

Number of Contact Hours/Week 0:0:2 SEE Marks 60
Total Number of Lab Contact Hours 36 Exam Hours 03
Credits – 2
Course Learning Objectives: This course MCSL106 will enable students to:
● Implement and evaluate Algorithm and AI in Python programming language.
Descriptions (if any):
Installation procedure of the required software must be demonstrated, carried out in groups.
and documented in the journal.
Programs List:
1. Implement a simple linear regression algorithm to predict a continuous target variable based on a given
dataset.
2. Develop a program to implement a Support Vector Machine for binary classification. Use a sample
dataset and visualize the decision boundary.
3. Develop a simple case-based reasoning system that stores instances of past cases. Implement a retrieval
method to find the most similar cases and make predictions based on them.
4. Write a program to demonstrate the ID3 decision tree algorithm using an appropriate dataset
for classification.
5. Build an Artificial Neural Network by implementing the Backpropagation algorithm and test it with
suitable datasets.
6. Implement a KNN algorithm for regression tasks instead of classification. Use a small dataset, and
predict continuous values based on the average of the nearest neighbors.
7. Create a program that calculates different distance metrics (Euclidean and Manhattan) between two
points in a dataset. Allow the user to input two points and display the calculated distances.
8. Implement the k-Nearest Neighbor algorithm to classify the Iris dataset, printing both correct and
incorrect predictions.
9. Develop a program to implement the non-parametric Locally Weighted Regression algorithm, fitting
data points and visualizing results.
10. Implement a Q-learning algorithm to navigate a simple grid environment, defining the reward structure
and analyzing agent performance.
Laboratory Outcomes: The student should be able to:
● Implement and demonstrate AI algorithms.
● Evaluate different algorithms.
Conduct of Practical Examination:
● Experiment distribution.
o For laboratories having only one part: Students are allowed to pick one experiment from
the lot with equal opportunity.
o For laboratories having PART A and PART B: Students are allowed to pick one
experiment from PART A and one experiment from PART B, with equal opportunity.
● Change of experiment is allowed only once and marks allotted for procedure to be made zero of
the changed part only.
● Marks Distribution (Courseed to change in accoradance with university regulations)
q) For laboratories having only one part – Procedure + Execution + Viva-Voce: 15+70+15 =
100 Marks
r) For laboratories having PART A and PART B
i. Part A – Procedure + Execution + Viva = 6 + 28 + 6 = 40 Marks
ii. Part B – Procedure + Execution + Viva = 9 + 42 + 9 = 60 Marks

@#@#@