SYLLABI OF PROGRAM CORE COURSES: V SEMESTER CSE (IOT)

Course Title of the Course Credit Course Pre-Requisite

No. s Structur
e
3L-0T-
CIEPC14 Embedded Systems 4 ----
2P

COURSE OUTCOMES:

CO1: To understand various application areas of embedded system

CO2: To understand various ways of implementing an embedded
system - using a general purpose processor, using an
application specific processor and using a single purpose
computer.
CO3: To understand AVR microcontroller
CO4: To understand embedded softwares
CO5: To be able to understand TinyML

Unit
Topics
No.

Formal definition of an Embedded System. Embedded system

examples.
Compare and contrast embedded system and
conventional/generic computer system.
Unit 1
Overview of elements of an Embedded system. Processor level
implementation using generic devices, full custom ASIP, Soft core
implementation on FPGA. Key parameters of Embedded System
Design (Time to market and cost).

Microcontroller Classification based on memory access, ISA

Microcontroller Classification based data bus width.
Example microcontroller families (8-bit, 16-bit and 32-bit
Unit 2 examples). Memory technologies, Memory interface busses.
Desirable microcontroller features. Development, debugging and
testing tools, Elements of Microcontroller Ecosystem: Reset,
Clock, Power supply and program download options.

Unit 3 AVR Microcontroller architecture details, Elements of physical

1
 interfacing: Input devices, Output, environmental sensors,
actuators, Elements of analog signal processing., Inter and Intra-
device communication Interfaces, Real Time Clock, Storage
devices, Power supply topologies for embedded systems.

Embedded software, Introduction to RTOS, Threads, Processes

Unit 4 and Message Passing Basics of scheduling, Complete system
design example, Security in embedded systems.

Introduction to embedded machine learning, Need of Machine

Unit 5 learning for an embedded device, Fundamentals of TinyML,
Specialized embedded projects

Suggested Readings:

1. Design with PIC Microcontrollers, John B. Peatman, Pearson

Education Asia, 2002

2. Embedded Hardware: Know It All. Jack Ganssle et al. ISBN:

0750685840. Newnes.

3. Designing Embedded Hardware. 2nd Edition. John Catsoulis. ISBN:

0596007558.

4. Computers as components: Principles of Embedded Computing

System Design, Wayne Wolf, Morgan Kaufman Publication, 2000

5. Embedded Systems: World Class Designs. Jack Ganssle. ISBN:

0750686251.

6. Embedded System Design: A Unified Hardware/Software

Introduction. Frank Vahid and Tony Givargis. ISBN: 0471386782.
Wiley.

7. An Embedded Software Primer. David E. Simon. ISBN 0-201-61569-

X. Addison-Wesley.

List of Practicals:

1. To interface the seven segment display with microcontroller 8051.

2. To create a series of moving lights using PIC on LEDs.

2
 3. To interface the stepper motor with microcontroller.
4. To display character/s on 8*8 LED matrix.
5. To interface the seven segment display and series LEDs with
ATMega32.
6. 8 X 8 matrix LED LCD interfacing with AVR.
7. Stepper motor interfacing with AVR.
8. Serial transmission and reception with AVR.
9. Keyboard interfacing with AVR.
10. Mini project on Arduino with TinyML kit.

Course Title of the Course Credit Course Pre-Requisite

No. s Structur
e
Artificial
3L-0T- Analysis & Design
CICPC15 Intelligence & 4
2P of Algorithms
Machine Learning

COURSE OUTCOMES:

CO1: To distinguish between a conventional system and an intelligent

system.

CO2: To explain Artificial Intelligence concept and its applications

CO3: To use the appropriate searching techniques and reasoning

methods in achieving desired goals

CO4: To develop an understanding of the fundamentals of machine

learning

Co5: To implement the supervised learning and unsupervised learning

strategies

Unit
Topics
No.
Unit 1
History of Artificial Intelligence, Fundamentals of AI, Risks and
Benefits of AI, Intelligent Agents, Good Behavior: The Concept of
Rationality. Search Algorithms, Uninformed Search Strategies,

3
 Informed(Heuristic) Search Strategies , Heuristic Functions

Adversarial Search and Games, Game Theory, Optimal

Decisions in Games, Heuristic Alpha- Beta Tree Search,
Limitations of Game Search Algorithms, Constraint Satisfaction
Unit 2
Problems: Defining Constraint Satisfaction Problems, Constraint
Propagation: Inference in CSPs, Backtracking Search for CSPs,
Local Search for CSPs.

Knowledge and reasoning, representation Logical, Propositional

Logic.
Syntax and Semantics of First - Order Logic , Using First -
Order Logic , Knowledge Engineering in First – Order Logic
Unit 3
Inference in First-Order Logic, Propositional vs First-Order
Inference, Unification and First-Order Inference, Forward
Chaining, Backward Chaining, Resolution, Knowledge
Representation

Basic concepts: Definition of learning systems, Goals and

applications of machine learning. Aspects of developing a
learning system: training data, concept representation, function
approximation.

Types of Learning: Supervised learning, unsupervised learning

Unit 4
and reinforcement learning. Overview of classification: setup,
training, test, validation dataset, over fitting.
Naïve Bayes, Linear and Logistic Regression.

Supervised learning: decision trees, nearest neighbour

algorithm.

Unsupervised learning: Clustering. K-means. EM Algorithm.

Unit 5 Mixture of Gaussians. Factor analysis. PCA (Principal
components analysis), ICA (Independent components analysis)

Suggested Readings:

1. S Russel and P Norvig , " Artificial Intelligence- Pearson New

International Edition- A Modern Approach , "4 th edition

4
 Pearson Education . ,2020

2. George F Luger , " Artificial Intelligence- Structures and

Strategies for Complex Problem Solving : 6thedition,"
Pearson Education ,2008

3. E. Rich and K. Knight ,"Artificial Intelligence”, Tata McGraw

Hill,2010

4. Simon Haykin, "Neural Networks: A Comprehensive formulation”,

Pearson Education ,1997

5. Nils J Nilsson, “Artificial Intelligence”, Morgan Kaufmann,1997

6. Ivan Bratko, "Prolog Programming for Artificial Intelligence”,

Addison Wesley, 2011

7. RichardDuda,PeterHartandDavidStork,“PatternClassification,”Joh
nWiley&Sons,2000

8. TomMitchell, “Machine Learning”, McGraw-Hill,1997

9. Trevor Hastie, Robert Tibshirani and Jerome Friedman, “The

Elements of Statistical Learning”, Springer, 2017

List of Practicals:

1. Write a program to implement Tic-Tac-Toe game problem.

2. Write a program to implement BFS (for 8-puzzle problem or Water Jug

problem or any Al search problem).

3. Write a program to implement DFS (for 8-puzzle problem or Water Jug

problem or any Al search problem).

4. Write a program to implement Single Player Game (Using Heuristic

Function)

5. Write a program to solve N-Queens problem.

6. Convert a given Prolog predicates into Semantic

7. Write a program to plot various plots using python on a given data

set.

8. Write a program to implement Naïve Bayes theorem.

9. Write a program to implement Linear regression.

5
 10. Write a program to implement Logistic Regression.

11. Write a program to Implement KNN Algorithm.

12. Write a program to implement a Decision Tree.

13. Write a program to implement K-Means algorithm.

Course Title of the Course Credit Course Pre-Requisite

No. s Structur
e
Advanced Computer 3L-0T- Data
CICPC16 4
Networks 2P Communication

COURSE OUTCOMES:

CO1: Learn the different network architecture.

CO2: Understand the routing strategies in unicast and multicast scenario.
CO3: Compare the different routing protocols
CO4: Understand and apply the concepts of Transport Layer.
CO5: Lean about the latest topics in Networking
Unit
Topics
No.

Overview of computer network, OSI/ISO seven- layer architecture,

Unit 1 TCP/IP suite of protocol, FDDI, DQDB, Fast Ethernet, Gigabit
Ethernet, Wi Fi, WiMax.

Network Layer Services, IPv4 address, Internet Protocol (IP), ARP,

RARP, and ICMP. Unicast Routing Protocols: Distance Vector
Unit 2 Routing, Link State Routing and Path-Vector Routing: Routing
Information Protocol (RIP), Open Shortest Path First (OSPF),
Border Gateway Protocol (BGP).

Unit 3 Mobility in network: Unicasting, Multicasting and Broadcasting.

IP Multicasting: Basics, Multicasting routing protocols: Multicast

6
 Distance Vector Routing Protocol (DVMRP), Multicast Link State
Routing Protocol (MOSPF), and Protocol Independent Multicast
(PIM). Internet Group Management Protocol (IGMP).

Transport Layer: UDP, TCP protocols, Flow Control: Silly Window

Syndrome, Error Control, and Connection Establishment.
Unit 4
Congestion Control, TCP Timers, Overview of TCP Reno and TCP
Tahoe

IPV6: Why IPV6, IPv6 addressing, IPv6 protocol, extension &

options, Transition from IPv4 to IPv6: Dual Stack, Tunneling,
Header Translation.
Unit 5
Introduction to Optical Networking: Advantage and
Disadvantages. SONET Layered Architecture and Frame Format.
Overview of VoIP, Network Function Virtualization, Software-
Defined Networking (SDN)

Suggested Readings:

1. W. ER. Stevens, “TCP/IP illustrated, Volume 1: The protocols”,

Addison Wesley, 1994
2. Frouzan, “TCP/IP Protocol Suite”, Tata Mc Grew Hill, 4th Ed.,
2009.
3. William Stallings, “Foundations of Modern Networking: SDN,
NFV, QoE, IoT, and Cloud”, Addison Wesley, 2015
4. Nader F. Mir, “Computer and Communication Networks”,
Pearson, 2009.
5. James F. Kurose and Keith W. Ross, “Computer Networking: A
Top-Down Approach”, Pearson, 2022

List of Practicals:

1. WAP to convert binary IP address into dotted decimal and vice-

versa.
2. WAP to compute the class of a given IP address.
3. Implementation of static routing to connect computers of five
different locations in WAN environment.

7
 4. Implementation of dynamic routing using DHCP to connect
computers of five different locations in WAN environment.
5. WAP to implement Bellman-Ford Algorithm.
6. WAP to implement Distance Vector Algorithm.
7. Implementation of dynamic routing using RIP to connect
computers of five different locations in WAN environment.
8. Implementation of dynamic routing using OSPF version II to
connect computers of five different locations in WAN environment.
9. Implementation of dynamic routing using BGP to connect
computers of five different locations in WAN environment.
10. Introduction of Wireshark. Capture the packets and save it and
perform following.
a. Filter the Transport layer packets.
b. Analyse How many TCP and UDP packets have been sent.
c. Filter packets relate to DNS.
d. Explore the statistics menu of Wireshark.
Course Title of the Course Credit Course Pre-Requisite
No. s Structur
e
Computer
3L-0T-
CICPC17 Cloud Computing 4 Architecture &
2P
Organization

COURSE OUTCOMES:

CO1: To understand the concepts of cloud computing.

CO2: To Demonstrate the awareness of cloud computing
technologies.
CO3: To understand the concepts of virtualization in cloud
computing.
CO4: To demonstrate the awareness of various cloud computing
applications.
CO5: To understand the quality of service and security issues in
cloud computing

8
 Unit
Topics
No.

Introduction to Cloud Computing, Definition, Characteristics,

Components, Cloud provider, SAAS, PAAS, IAAS and Others,
Organizational scenarios of clouds, Administering & Monitoring
Unit 1 cloud services, benefits and limitations, Deploy application over
cloud, Comparison among SAAS, PAAS, IAAS, Cloud computing
platforms: Infrastructure as service: Amazon EC2, Platform as
Service: Google App Engine, Microsoft Azure

Introduction to Cloud Technologies, Study of Hypervisors,

Unit 2 SOAP, REST, Compare SOAP and REST, Web services, AJAX
and mashups-Web services, Mashups: user interface services.

Virtual machine technology, virtualization applications in

enterprises, Pitfalls of virtualization, Multi-entity support, Multi-
Unit 3
schema approach, Multi-tenance using cloud data stores, Data
access control for enterprise applications.

Data in the cloud: Relational databases, Cloud file systems: GFS

and HDFS, Big Table, HBase and Dynamo, Map-Reduce and
extensions: Parallel computing, The map-Reduce model, Parallel
Unit 4 efficiency of Map-Reduce, Relational operations using Map-
Reduce, Introduction to cloud development, Monitoring in
Cloud, A grid of clouds, Mobile Cloud Computing, Sky
computing, Utility Computing, Elastic Computing.

Cloud security fundamentals, Vulnerability assessment tool for

cloud, Privacy and Security in cloud, Cloud computing security
architecture, Cloud computing security challenges, Issues in
cloud computing, Implementing real time application over cloud
Unit 5 platform, Issues in Inter cloud environments, QoS Issues in
Cloud, Dependability, data migration, streaming in Cloud.
Quality of Service (QoS) monitoring in a Cloud computing
environment, , Inter Cloud issues, , load balancing, resource
optimization

Suggested Readings:

1. Cloud Computing : A Practical Approach, Antohy T Velte, et.al

9
 McGrawHill,

2. Cloud Computing for Dummies by Judith Hurwitz, R.Bloor,

M.Kanfman, F.Halper (Wiley India Edition)

3. Cloud Security & Privacy by Tim Malhar, S.Kumaraswammy,S.Latif

(SPD,O’REILLY)

4. Cloud Computing Bible by Barrie Sosinsky, Wiley In

List of Practicals:

1. Develop a Hello World application using Google App

Engine.
2. Create a warehouse application on SalesForce.com.

3. Creating an application in SalesForce.com using Apex

Programming Language.
4. Implementing SOAP Web services in C#, JAVA
Applications.
5. Implement Para-virtualization using VM Ware’s
Workstation/Oracle’s Virtual Box and Guest.
6. Create an application (Ex: Word Count) using Hadoop

Map/Reduce.
7. Develop a simple Hadoop application called Word Count.

Counts the number of occurrences of each word in each

input set.
8. Develop a Hadoop application to count the number of

characters, no of words and each character's frequency.

9. Case Study: PAAS(Facebook, Google App Engine)

10. Case Study: Amazon Web Services.

10
 Course No Course Name Course Structure
CICPE02 Data Science L T P 3-0-2
COURSE OUTCOMES
CO1: Understand basics of Data Science.
CO2: Learn the statistics and skills of data science.
C03: Usage of the tools for data science
CO4: Implement language models for data science.
CO5: Explore and Solve Real World Problems related to data science.
Unit No. Topics
UNIT 1 Data Science, Data Science Vs Data Analytics, Data Scientist, Data Science and
Business Intelligence, Components and Data Science Lifecycle, Pros and Cons of
Data Science

UNIT 2 Statistics for Data Science: Descriptive Statistics, Inferential Statistics, Skills
Required for Data Science, Types of Data, Types of Data, Event Prediction

11
 Tools: Hadoop, Apache Spark, Natural Language Processing, Phases of NLP,
UNIT 3 Semantic Analysis, Syntactic Analysis, Preprocessing: Tokenization, Tokens to
vector; Sentiment Analysis, NLTK Exploration: PoS Tagging, Stemming and
Lemmatization
Statistics and Correlation Analysis, Hypothesis and Inference, Statistical
UNIT 4 Distributions, Language Modeling: Word2Vec, Paragraph2Vec, FastText, N-
Gram Model, Hidden MarkoV Model, Viterbi Algorithm
Application of Data Science: Social Media, Risk and Fraud Detection, Healthcare,
UNIT 5 Hate Speech Detection, Recommender Systems, Image Recognition, Speech
Recognition, Augmented Reality
SUGGESTED READINGS

1. “Data Science and Data Analytics”, Amit Kumar Tyagi, CRC Press, 2021
2. “The Data Science Handbook: Advice and Insights from 25 Amazing Data Scientists” Carl Shan, Haijiang
Henry Wang, William Chen, Max Song, 2015, Data Science Book Shelf
3. Data Science for Beginners: Comprehensive Guide to Most Important Basics in Data Science,
Campbell, Alex, 2021

List of Practicals:

1. Install, configure, and run Hadoop and HDFS.

2. Implement an MapReduce program that processes a weather dataset
3. Installation of NLTK. Write a program to tokenize a text file into sentences and
words. Write a program to identify and remove stop words from a text file after
importing.
4. Write a program to count word frequency of a text file.
5. Write a program to evaluate frequency distribution of each word in a loaded text
file and plot the frequency distribution graph for it.
6. Create a character N-gram model and words N-gram model in python to develop
an automatic text filler using N-Grams.
7. Implement Hidden Markov Model.
8. Implement Word embedding model (Word2Vec, Paragraph2Vec, FastText).
9. Write a program to implement SVM classification algorithm.
10. Write a program for Sentiment Analysis.

12