0% found this document useful (0 votes)
52 views6 pages

ME Lab - II Sem Syllabus

Uploaded by

Mat
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)
52 views6 pages

ME Lab - II Sem Syllabus

Uploaded by

Mat
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/ 6

TOTAL : 60 PERIODS

COURSE OUTCOMES:
CO1: Design and implement basic and advanced data structures extensively
CO2: Design algorithms using graph structures
CO3: Design and develop efficient algorithms with minimum complexity using design
techniques
CO4: Develop programs using various algorithms.
CO5: Choose appropriate data structures and algorithms, understand the ADT/libraries,
and use it to design algorithms for a specific problem.

REFERENCES:
1. Lipschutz Seymour, “Data Structures Schaum's Outlines Series”, Tata McGraw Hill, 3rd
Edition, 2014.
2. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman, “Data Structures and Algorithms”,
Pearson Education, Reprint 2006.
3. http://www.coursera.org/specializations/data-structures-algorithms
4. http://www.tutorialspoint.com/data_structures_algorithms
5. http://www.geeksforgeeks.org/data-structures/

CP4291 INTERNET OF THINGS L T P C


3 0 2 4
COURSE OBJECTIVES:
 To Understand the Architectural Overview of IoT
 To Understand the IoT Reference Architecture and Real World Design Constraints
 To Understand the various IoT levels
 To understand the basics of cloud architecture
 To gain experience in Raspberry PI and experiment simple IoT application on it

UNIT I INTRODUCTION 9+6


Internet of Things- Domain Specific IoTs - IoT and M2M-Sensors for IoT Applications–Structure of
IoT– IoT Map Device- IoT System Management with NETCONF-YANG

UNIT II IoT ARCHITECTURE, GENERATIONS AND PROTOCOLS 9+6


IETF architecture for IoT - IoT reference architecture -First Generation – Description &
Characteristics–Advanced Generation – Description & Characteristics–Integrated IoT Sensors –
Description & Characteristics

UNIT III IoT PROTOCOLS AND TECHNOLOGY 9+6


SCADA and RFID Protocols - BACnet Protocol -Zigbee Architecture - 6LowPAN - CoAP -Wireless
Sensor Structure–Energy Storage Module–Power Management Module–RF Module–Sensing
Module

UNIT IV CLOUD ARCHITECTURE BASICS 9+6


The Cloud types; IaaS, PaaS, SaaS.- Development environments for service development; Amazon,
Azure, Google Appcloud platform in industry

17
UNIT V IOT PROJECTS ON RASPBERRY PI 9+6
Building IOT with RASPBERRY PI- Creating the sensor project - Preparing Raspberry Pi - Clayster
libraries – Hardware Interacting with the hardware - Interfacing the hardware- Internal representation
of sensor values - Persisting data - External representation of sensor values - Exporting sensor data

SUGGESTED ACTIVITIES:
1. Develop an application for LED Blink and Pattern using Arduino or Raspberry Pi
2. Develop an application for LED Pattern with Push Button Control using Arduino
or Raspberry Pi
3. Develop an application for LM35 Temperature Sensor to display temperature values using
arduino or Raspberry Pi
4. Develop an application for Forest fire detection end node using Raspberry Pi device and
sensor
5. Develop an application for home intrusion detection web application
6. Develop an application for Smart parking application using python and Django for web
application

COURSE OUTCOMES:
CO1: Understand the various concept of the IoT and their technologies
CO2: Develop the IoT application using different hardware platforms
CO3: Implement the various IoT Protocols
CO4: Understand the basic principles of cloud computing
CO5: Develop and deploy the IoT application into cloud environment
TOTAL: 75 PERIODS
REFERENCES:
1. Arshdeep Bahga, Vijay Madisetti, Internet of Things: A hands-on approach, Universities
Press, 2015
2. Dieter Uckelmann, Mark Harrison, Florian Michahelles (Eds), Architecting the Internet of
Things, Springer, 2011
3. Peter Waher, 'Learning Internet of Things', Packt Publishing, 2015
4. Ovidiu Vermesan Peter Friess, 'Internet of Things – From Research and Innovation to
Market Deployment', River Publishers, 2014
5. N. Ida, Sensors, Actuators and Their Interfaces: A Multidisciplinary Introduction, 2nd
EditionScitech Publishers, 202014
6. Reese, G. (2009). Cloud Application Architectures: Building Applications and
Infrastructure in the Cloud. Sebastopol, CA: O'Reilly Media, Inc. (2009)

CP4292 MULTICORE ARCHITECTURE AND PROGRAMMING L T PC


3 0 2 4
COURSE OBJECTIVES:
 To understand the need for multi-core processors, and their architecture.
 To understand the challenges in parallel and multithreaded programming.
 To learn about the various parallel programming paradigms,
 To develop multicore programs and design parallel solutions.

18
UNIT I MULTI-CORE PROCESSORS 9
Single core to Multi-core architectures – SIMD and MIMD systems – Interconnection networks –
Symmetric and Distributed Shared Memory Architectures – Cache coherence – Performance
Issues – Parallel program design.

UNIT II PARALLEL PROGRAM CHALLENGES 9


Performance – Scalability – Synchronization and data sharing – Data races – Synchronization
primitives (mutexes, locks, semaphores, barriers) – deadlocks and livelocks – communication
between threads (condition variables, signals, message queues and pipes).

UNIT III SHARED MEMORY PROGRAMMING WITH OpenMP 9


OpenMP Execution Model – Memory Model – OpenMP Directives – Work-sharing Constructs –
Library functions – Handling Data and Functional Parallelism – Handling Loops – Performance
Considerations.

UNIT IV DISTRIBUTED MEMORY PROGRAMMING WITH MPI 9


MPI program execution – MPI constructs – libraries – MPI send and receive – Point-to-point and
Collective communication – MPI derived datatypes – Performance evaluation

UNIT V PARALLEL PROGRAM DEVELOPMENT 9


Case studies – n-Body solvers – Tree Search – OpenMP and MPI implementations and
comparison.
TOTAL: 45 PERIODS
PRACTICALS:
1. Write a simple Program to demonstrate an OpenMP Fork-Join Parallelism.
2. Create a program that computes a simple matrix-vector multiplication b=Ax, either in
C/C++. Use OpenMP directives to make it run in parallel.
3. Create a program that computes the sum of all the elements in an array A (C/C++) or
a program that finds the largest number in an array A. Use OpenMP directives to make it
run in parallel.
4. Write a simple Program demonstrating Message-Passing logic using OpenMP.
5. Implement the All-Pairs Shortest-Path Problem (Floyd's Algorithm) Using OpenMP.
6. Implement a program Parallel Random Number Generators using Monte Carlo Methods
in OpenMP.
7. Write a Program to demonstrate MPI-broadcast-and-collective-communication in C.
8. Write a Program to demonstrate MPI-scatter-gather-and-all gather in C.
9. Write a Program to demonstrate MPI-send-and-receive in C.
10. Write a Program to demonstrate by performing-parallel-rank-with-MPI in C.
TOTAL: 30 PERIODS
TOTAL:45+30=75 PERIODS
COURSE OUTCOMES:
At the end of the course, the students should be able to:
CO1: Describe multicore architectures and identify their characteristics and challenges.
CO2: Identify the issues in programming Parallel Processors.
CO3: Write programs using OpenMP and MPI.
CO4: Design parallel programming solutions to common problems.
CO5: Compare and contrast programming for serial processors and programming for parallel
processors.

19
REFERENCES:
1. Peter S. Pacheco, “An Introduction to Parallel Programming, Morgan-Kauffman/Elsevier,
2021.
2. Darryl Gove, “Multicore Application Programming for Windows, Linux, and Oracle Solaris,
Pearson, 2011 (unit 2)
3. Michael J Quinn, “Parallel programming in C with MPI and OpenMP, Tata McGraw
Hill,2003.
4. Victor Alessandrini, Shared Memory Application Programming, 1st Edition, Concepts and
Strategies in Multicore Application Programming, Morgan Kaufmann, 2015.
5. Yan Solihin, Fundamentals of Parallel Multicore Architecture, CRC Press, 2015.

CP4252 MACHINE LEARNING L T PC


3 0 2 4
COURSE OBJECTIVES:
 To understand the concepts and mathematical foundations of machine learning and types of
problems tackled by machine learning
 To explore the different supervised learning techniques including ensemble methods
 To learn different aspects of unsupervised learning and reinforcement learning
 To learn the role of probabilistic methods for machine learning
 To understand the basic concepts of neural networks and deep learning

UNIT I INTRODUCTION AND MATHEMATICAL FOUNDATIONS 9


What is Machine Learning? Need –History – Definitions – Applications - Advantages, Disadvantages
& Challenges -Types of Machine Learning Problems – Mathematical Foundations - Linear Algebra &
Analytical Geometry -Probability and Statistics- Bayesian Conditional Probability -Vector Calculus &
Optimization - Decision Theory - Information theory

UNIT II SUPERVISED LEARNING 9


Introduction-Discriminative and Generative Models -Linear Regression - Least Squares -Under-fitting
/ Overfitting -Cross-Validation – Lasso Regression- Classification - Logistic Regression- Gradient
Linear Models -Support Vector Machines –Kernel Methods -Instance based Methods - K-Nearest
Neighbors - Tree based Methods –Decision Trees –ID3 – CART - Ensemble Methods –Random
Forest - Evaluation of Classification Algorithms

UNIT III UNSUPERVISED LEARNING AND REINFORCEMENT LEARNING 9


Introduction - Clustering Algorithms -K – Means – Hierarchical Clustering - Cluster Validity -
Dimensionality Reduction –Principal Component Analysis – Recommendation Systems - EM
algorithm. Reinforcement Learning – Elements -Model based Learning – Temporal Difference
Learning

UNIT IV PROBABILISTIC METHODS FOR LEARNING 9


Introduction -Naïve Bayes Algorithm -Maximum Likelihood -Maximum Apriori -Bayesian Belief
Networks -Probabilistic Modelling of Problems -Inference in Bayesian Belief Networks – Probability
Density Estimation - Sequence Models – Markov Models – Hidden Markov Models

20
UNIT V NEURAL NETWORKS AND DEEP LEARNING 9
Neural Networks – Biological Motivation- Perceptron – Multi-layer Perceptron – Feed Forward
Network – Back Propagation-Activation and Loss Functions- Limitations of Machine Learning – Deep
Learning– Convolution Neural Networks – Recurrent Neural Networks – Use cases
45 PERIODS
SUGGESTED ACTIVITIES:
1. Give an example from our daily life for each type of machine learning problem
2. Study at least 3 Tools available for Machine Learning and discuss pros & cons of each
3. Take an example of a classification problem. Draw different decision trees for the example
and explain the pros and cons of each decision variable at each level of the tree
4. Outline 10 machine learning applications in healthcare
5. Give 5 examples where sequential models are suitable.
6. Give at least 5 recent applications of CNN
PRACTICAL EXERCISES: 30 PERIODS
1. Implement a Linear Regression with a Real Dataset
(https://www.kaggle.com/harrywang/housing). Experiment with different features in building a
model. Tune the model's hyperparameters.
2. Implement a binary classification model. That is, answers a binary question such as "Are
houses in this neighborhood above a certain price?"(use data from exercise 1). Modify the
classification threshold and determine how that modification influences the model. Experiment
with different classification metrics to determine your model's effectiveness.
3. Classification with Nearest Neighbors. In this question, you will use the scikit-learn’s KNN
classifier to classify real vs. fake news headlines. The aim of this question is for you to read
the scikit-learn API and get comfortable with training/validation splits. Use California Housing
Dataset
4. In this exercise, you'll experiment with validation sets and test sets using the dataset. Split
a training set into a smaller training set and a validation set. Analyze deltas between training
set and validation set results. Test the trained model with a test set to determine whether your
trained model is overfitting. Detect and fix a common training problem.
5. Implement the k-means algorithm using https://archive.ics.uci.edu/ml/datasets/Codon+usage
dataset
6. Implement the Naïve Bayes Classifier using
https://archive.ics.uci.edu/ml/datasets/Gait+Classification dataset
7. Project - (in Pairs) Your project must implement one or more machine learning algorithms and
apply them to some data.

a. Your project may be a comparison of several existing algorithms, or it may propose a


new algorithm in which case you still must compare it to at least one other approach.
b. You can either pick a project of your own design, or you can choose from the set of
pre-defined projects.
c. You are free to use any third-party ideas or code that you wish as long as it is publicly
available.
d. You must properly provide references to any work that is not your own in the write-up.
e. Project proposal You must turn in a brief project proposal. Your project proposal
should describe the idea behind your project. You should also briefly describe software
you will need to write, and papers (2-3) you plan to read.

21
List of Projects (datasets available)
1. Sentiment Analysis of Product Reviews
2. Stock Prediction
3. Sales Forecasting
4. Music Recommendation
5. Handwriting Digit Classification
6. Fake News Detection
7. Sports Prediction
8. Object Detection
9. Disease Prediction

COURSE OUTCOMES:
Upon the completion of course, students will be able to
CO1: Understand and outline problems for each type of machine learning
CO2: Design a Decision tree and Random forest for an application
CO3: Implement Probabilistic Discriminative and Generative algorithms for an application and
analyze the results.
CO4: Use a tool to implement typical Clustering algorithms for different types of applications.
CO5: Design and implement an HMM for a Sequence Model type of application and identify
applications suitable for different types of Machine Learning with suitable justification.
TOTAL:75 PERIODS
REFERENCES
1. Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, Chapman & Hall/CRC,
2nd Edition, 2014.
2. Kevin Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012
3. Ethem Alpaydin, “Introduction to Machine Learning”, Third Edition, Adaptive Computation and
Machine Learning Series, MIT Press, 2014
4. Tom M Mitchell, “Machine Learning”, McGraw Hill Education, 2013.
5. Peter Flach, “Machine Learning: The Art and Science of Algorithms that Make Sense of Data”,
First Edition, Cambridge University Press, 2012.
6. Shai Shalev-Shwartz and Shai Ben-David, “Understanding Machine Learning: From Theory to
Algorithms”, Cambridge University Press, 2015
7. Christopher Bishop, “Pattern Recognition and Machine Learning”, Springer, 2007.
8. Hal Daumé III, “A Course in Machine Learning”, 2017 (freely available online)
9. Trevor Hastie, Robert Tibshirani, Jerome Friedman, “The Elements of Statistical Learning”,
Springer, 2009 (freely available online)
10. Aurélien Géron , Hands-On Machine Learning with Scikit-Learn and TensorFlow: Concepts,
Tools, and Techniques to Build Intelligent Systems 2nd Edition, o'reilly, (2017)

SE4151 ADVANCED SOFTWARE ENGINEERING LT PC


3 00 3
COURSE OBJECTIVES:
 To understand the rationale for software development process models
 To understand why the architectural design of software is important;
 To understand the five important dimensions of dependability, namely, availability,
reliability, safety, security, and resilience.

22

You might also like