MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES

(Deemed to be University under section 3 of the UGC Act 1956)

NAAC 'A' Grade University

BCS-DS-602: Machine Learning

Periods/week Credits Max. Marks : 200

L: 3 T: 1 4.0 Continuous Evaluation : 100
Duration of Exam: 3 Hrs End Sem Examination : 100

Pre-Requisite: Nil
Course Type: Program Core

Course Outcomes: The student will be able to-

BCS-DS-602.1. Outline the techniques, mathematical concepts, and algorithms used in machine learning.
BCS-DS-602.2. Describe the basic concepts of statistics, artificial intelligence, information theory and
probability theory relevant to machine learning.
BCS-DS-602.3. Understand Supervised learning techniques for regression and classification in machine
learning
BCS-DS-602.4. Apply the appropriate machine learning technique using unsupervised techniques for
pattern recognition, optimization and decision problems
BCS-DS-602.5. Design the algorithms and techniques to solve problems using Artificial Neural Networks.
BCS-DS-602.6. Analyze the complexities of various problems in different domains.

PART- A
Unit-1: Introduction Basic Concepts
1.1 Probability Theory
1.2 Probability densities
1.3 Types of Variables: Quantitative & Qualitative
1.4 Measures of Central Tendency
1.5 Measures of Spread: Range, Variance, Standard deviation
1.6 Population parameters and Sample Statistics
1.7 Bayesian probabilities and Bayes Theorem
1.8 Gaussian distribution

Unit-2: Machine Learning

2.1 Introduction to Machine Learning Concepts
2.2 Types of Machine Learning Algorithms
2.3 Dimensionality Reduction Techniques: (PCA -Principal components analysis)
2.4 Feature Extraction
2.5 Feature Selection

Unit-3: Supervised Learning

3.1 Introduction to supervised learning setup
3.2 Regression and Classification
3.3 Linear Regression
3.4 Logistic Regression
3.5 Naive Bayes Classifier Algorithm
3.6 Support vector machines
3.7 Ensemble methods: Bagging, Boosting
3.8 Evaluating and debugging learning algorithms

PART- B
Unit-4: Unsupervised Learning
4.1 Introduction to Unsupervised learning
4.2 Clustering techniques
4.3 Common distance measures
4.4K-means algorithm
4.5Hierarchical agglomeration
4.6 Cross Validation and Resampling Methods
4.7 Assessing the performance of an algorithm

Unit 5: Artificial Neural Network

5.1 Introduction to Neural Networks
5.2 Neural Network representation
5.3 Gradient Descent
5.4 Perceptron, Multilayer perceptron
5.5 Backpropagation algorithm
5.6 Feed-forward Network Networks
5.7 Network Training – Parameter optimization

Unit 6:Deep Learning

6.1 Inductive Learning
6.2 Graph-Based Learning
6.3 SVM (Support Vector Machine) and Kernel Methods
6.4 Generative Methods
6.5 Human Cognitive Learning

Text Books / Reference Books:

1. S. Haykin. 2008, Neural networks and learning machines. Pearson.
2. Mitchell, Tom. 1997, Machine Learning. New York, NY: McGraw-Hill, ISBN: 9780070428072
3. Rbchard o Duda, Peter E. Hart and David G. Stork, 2001 pattern Classification, John Wiley & Sons Inc.
4. Chris Bishop, 2007, Pattern Recognition and Machine Learning, Springer-Verlag New York, ISBN: 978-
0-387-31073-2
Software required/Weblinks:
Python, R language
www.tutorialpoint.com

Instructions for paper setting: Seven questions are to be set in total. First question will be conceptual
covering entire syllabus and will be compulsory to attempt. Three questions will be set from each Part A
and Part B (one from each unit) Student needs to attempt two questions out of three from each part. Each
question will be of 20 marks.

Distribution of Continuous Evaluation:

Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Semester Examination
COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
602)
BCS-DS-602.1 2 2 - - - - - - - - - - - 1 -
BCS-DS-602.2 2 - - - 2 - - - - - - - - - -
BCS-DS-602.3 - - - - - - - - - - - - - - -
BCS-DS-602.4 3 3 2 - 1 - - - - - 1 1 1 - 1
BCS-DS-602.5 2 - 2 1 1 - - - - 1 - - 1 1 1
BCS-DS-602.6 2 2 - 2 - 1 - - - - - 1 1 - 1
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-603: Internet Of Things (IOT)

Periods/week Credits Max. Marks : 200

L: 3 T: 1 4.0 Continuous Evaluation : 100
Duration of Exam: 3 Hrs End Sem Examination : 100

Pre-Requisite: Basic Knowledge of computers

Course Type: Program Core

Course Outcomes: Student will be able to-

BCS-DS-603.1 Describe concepts and technologies of IoT communication.
BCS-DS-603.2 Map out the processes for IoT solutions and data management in IoT.
BCS-DS-603.3 Identify different infrastructure components including sensors, embedded hardware,
gateways and network systems for IoT applications.
BCS-DS-603.4 Differentiate between the levels of the IoT stack and be familiar with the key technologies
and protocols employed at each layer of the stack.
BCS-DS-603.5 Illustrate security requirements and privacy risks in IoT communication.
BCS-DS-603.6 Apply the knowledge and skills acquired during the course to build and test a complete,
working IoT system involving prototyping, programming and data analysis.

PART- A
Unit-1: Introduction to IoT
1.1 Introduction to IoT Communications
1.2 IoT categories: Industrial and Consumer
1.3 IoT components and implementation: Functional blocks
1.4 Layered architecture of IoT
1.5 Machine to Machine Communication, IoT vs M2M
1.6 IoT Enabling Technologies

Unit-2: IoT Communication

2.1 IoT Network Configurations: Node, PAN, LAN, WAN, Gateway, Proxy
2.2 IoT Communication: IoT Protocol Stack
2.3 IoT Communication Models
2.4 Connectivity technologies: IEEE802.15.4, ZigBee, 6LOWPAN, Bluetooth, Z-wave, RFID
2.5 MQTT, CoAP, XMPP, AMQP

Unit-3: IoT Systems and Networks

3.1 Study of RF Wireless Sensors
3.2 Wireless Sensor Networks
3.3 Components of a sensor node
3.4 Challenges in Wireless sensor networks, Node Cooperation
3.5 WSN Coverage
3.6 Network Devices
PART-B
Unit-4: Elements of IoT Application Development
4.1 Component based IoT Reference Model
4.2 Hardware Components- Computing (Arduino, Raspberry Pi), Sensing, Actuation.
4.3 Software Components- Programming API’s (using Python/Arduino) for Communication
4.4 IoT Platforms: Capabilities and Examples
4.5 Device Data Storage on Cloud: Sensor Cloud Architecture and Applications
4.6 Fog Computing: Requirement and Architecture

Unit-5: IoT Security Frameworks

5.1 Challenges in IoT Implementation
5.2 IoT Security Threats
5.3 Security Requirements of IoT Communications
5.4 Principles of Secure IoT Communication
5.5 IoT Security Framework

Unit-6: IoT Applications/ Case Studies

6.1 Home Automation
6.2 Asset Management
6.3 Tagging and Tracking for Healthcare applications
6.4 Connected Vehicles
6.5 Smart Irrigation
6.6 Smart Cities

Text Books / Reference Books:

1.Vijay Madisetti, Arshdeep Bahga, Ïnternet of Things, “A Hands on Approach”, University Press
2. Dr. SRN Reddy, Rachit Thukral and Manasi Mishra, “Introduction to Internet of Things: A practical
Approach”, ETI Labs
3. Pethuru Raj and Anupama C. Raman, “The Internet of Things: Enabling Technologies, Platforms, and
Use Cases”, CRC Press
4. Jeeva Jose, “Internet of Things”, Khanna Publishing House, Delhi
5. Adrian McEwen, “Designing the Internet of Things”, Wiley
6. Raj Kamal, “Internet of Things: Architecture and Design”, McGraw Hill
7. Cuno Pfister, “Getting Started with the Internet of Things”, O Reilly Media

Software required/Weblinks:
https://onlinecourses.nptel.ac.in/noc17_cs22
www.analyticsvidya.com

Instructions for paper setting: Seven questions are to be set in total. First question will be conceptual
covering entire syllabus and will be compulsory to attempt. Three questions will be set from each Part A
and Part B (one from each unit) Student needs to attempt two questions out of three from each part. Each
question will be of 20 marks.

Distribution of Continuous Evaluation:

Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Semester Examination

COURSE ARTICULATION MATRIX :

 CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO
Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
603)
BCS-DS- 3 - - - - - - - - - - 1 - - -
603.1
BCS-DS- - 3 - - - - - - - - - - - - -
603.2
BCS-DS- - - 3 - - - - - - - - - - - -
603.3
BCS-DS- - - 2 3 2 - - - - - - - - - -
603.4
BCS-DS- - - - - - 2 3 1 - - - - - - -
603.5
BCS-DS- - - - 2 2 3 - - - 1 - 2 1 - -
603.6
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-624: Complier Design

Periods/week Credits Max. Marks : 200

L: 3 T: 0 3.0 Continuous Evaluation : 100
Duration of Examination: 3 Hrs End Sem Examination : 100

Pre-Requisite: Basic Knowledge of computers

Course Type: Program Electives

Course Outcomes: Students will be able to-

BCS-DS-624.1. Describe the different phases of the compilation process
BCS-DS-624.2. Apply the formal attributed grammars for specifying the syntax and semantics of
programming languages.
BCS-DS-624.3. Design scanner and parser using LEX tool & YACC tool.
BCS-DS-624.4. Identify different language translators.
BCS-DS-624.5. Interpret new code optimization techniques to improve the performance of a program in
terms of speed & space.
BCS-DS-624.6. Employ the knowledge of patterns, tokens & regular expressions for solving a problem in
the field of data mining.

PART- A
Unit-1: Concept of Programming language
1.1 Syntactic and semantic rules of a Programming language, Characteristics of a good programming language,
1.2 Specification & implementation of elementary data types,
1.3 Declarations, type checking & type conversions.
1.4 Implicit & explicit sequence controls
1.5 sequence control within expressions,
1.6 sequence control within statement,
1.7 Subprogram sequence control: simple call return,
1.8 recursive subprograms,
1.9 Names & referencing environment, static & dynamic scope,
1.10 Local data & local referencing environment,
1.11 Shared data: dynamic & static scope.
1.12 Parameter & parameter transmission schemes.

Unit–2: Lexical Analysis

2.1 structure of compiler and its different phases,
2.2 Compiler construction tools, Role of lexical analyzer
2.3 design and Implementation of lexical analyzer,
2.4 Regular expressions, Specification and recognition of tokens.
2.5 A language specifying lexical analyzer: LEX, Finite automata,
2.6 conversion from regular expression to finite automata, and vice versa,
2.7 minimizing number of states of DFA, input buffering,

Unit-3: Syntax Analysis

3.1. Context free grammars,
3.2. Role of parsers, definition of parsing,
3.3. Types of parsing. Parsing Technique: Top down parsing,
3.4. Predictive parsing
3.5. Operator precedence parsing,
3.6. Top down parsers, LR parsers, SLR
3.7. LALR and Canonical LR parser
PART- B
Unit-4: Syntax Directed Translations
4.1 Syntax directed definition, construction of syntax trees,
4.2 syntax directed translation scheme,
4.3 implementation of syntax directed translation.
4.4 three address code: quadruples, triples and indirect triples,

Unit-5: Symbol Table & Error Detection and Recovery

5.1 Symbol tables and its contents.
5.2 Data structures for symbol tables; trees, arrays,
5.3 linked lists, hash tables.
5.4 Errors, lexical phase error.
5.5 syntactic phase error, semantic error,
5.6 error recovery techniques,

Unit-6: Code Optimization & Code Generation

6.1 Code generation, forms of object code,
6.2 machine dependent code, optimization of intermediate codes,
6.3 register allocation for temporary and user defined variables,
6.4 code optimization.

Text Books / Reference Books:

1. A. V. AHO, Ravi Sethi & J.D. Ullman; 1998, Compilers Principle, Techniques & Tools, AW.
2. O.G.Kakde, 2015, Compiler Design, 4thEdition, Laxmi Publications
3. Tremblay & Sorenson, NA, 1985, Theory and Practice of Compiler writing, TMH.
4. K L P Mishra, 2006, Theory of computer science: Automata, Languages and computation,3rd edition,
PHI

Software required/Weblinks:
C/C++(TurboC/DOS BOX)
www. 3schools.com

Instructions for paper setting: Seven questions are to be set in total. First question will be conceptual
covering entire syllabus and will be compulsory to attempt. Three questions will be set from each Part A
and Part B (one from each unit) Student needs to attempt two questions out of three from each part. Each
question will be of 20 marks.

Distribution of Continuous Evaluation:

Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Semester Examination
COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
624)
BCS-DS-624.1 1 1 2 - - - - - - 1 3 3 1 1 1
BCS-DS-624.2 2 1 - - 3 1 - - - 2 - - 1 2 -
BCS-DS-624.3 2 - 1 1 3 1 - - - 2 - - 1 2 -
BCS-DS-624.4 1 - - - - - 2 - - - 2 2 - - 1
BCS-DS-624.5 1 2 - 1 - - - - - - 2 1 - - -
BCS-DS-624.6 1 - 3 - - - - - - - - 2 2 - 1
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-632: Data Mining

Periods/week Credits Max. Marks : 200

L: 3 T: 0 3.0 Continuous Evaluation : 100
Duration of Examination: 3 Hrs End Sem Examination :100

Pre-Requisite: Database Management Systems(BCS-DS-404)

Course Type: Program Electives

Course Outcomes: Students will be able to-

BCS-DS-632.1. Identify appropriate data mining algorithms to solve real world problems.
BCS-DS-632.2. Compare and evaluate different data mining techniques like classification, prediction,
clustering and association rule mining.
BCS-DS-632.3. Describe complex data types with respect to spatial and web mining.
BCS-DS-632.4. Develop skills to write queries using DMQL
BCS-DS-632.5. Develop skill in selecting the appropriate data mining algorithm for solving practical
problems.
PART-A

Unit 1: Data Mining & Business Intelligence:

1.1 Introduction: Scope of Data Mining: What is Data Mining;
1.2 How does Data Mining Works, Predictive Modeling:
1.3 Data Mining and Data Warehousing: Architecture for Data Mining:
1.4 Profitable Applications: Data Mining Tools,
1.5 Business Intelligence, Business Intelligence tools,
1.6 Business Intelligence Infrastructure, Business Intelligence Applications,
1.7 BI versus Data Warehouse, BI versus Data Mining, Future of BI.

Unit 2: Data Preprocessing:

2.1 Introduction, Data Preprocessing Overview,
2.2 Data Cleaning, Data Integration and Transformation,
2.3 Data Reduction, Discretization
2.4 Concept Hierarchy Generation.

Unit 3: Data Mining Techniques- An Overview:

3.1 Introduction, Data Mining,
3.2 Data Mining Versus Database Management System,
3.3 Data Mining Techniques-
3.4 Association rules, Classification, Regression,
3.5 Clustering, Neural networks.
PART-B

Unit 4: Clustering:
4.1 Introduction, Clustering,
4.2 Cluster Analysis,
4.3 Clustering Methods- K means, Hierarchical clustering,
4.4 Agglomerative clustering, Divisive clustering,
4.5 Clustering and segmentation software, evaluating clusters.
Unit 5: Web Mining:
5.1 Introduction, Terminologies,
5.2 Categories of Web Mining – Web Content Mining,
5.3 Web Structure Mining,
5.4 Web Usage Mining,
5.5 Applications of Web Mining, and Agent based and Data base approaches,
5.6 Web mining Software.

Unit 6: Applications of Data mining:

6.1 Introduction, Business Applications Using Data Mining
6.2 Risk management and targeted marketing,
6.3 Customer profiles and feature construction,
6.4 Medical applications (diabetic screening),
6.5 Scientific Applications using Data Mining, Other Applications.

Text Books / Reference Books:

1. Arun Pujar, 2010, Data Mining Techniques, 2nd Edition, Orient Black Swan/ Universities Press.
2. Alex Berson, 2004, Data Warehousing, Data Mining and OLTP, 1st Edition, MGH.
3. W.H. Inman, 2005, Building the Data Warehouse, 4th Edition, John Wiley & Sons.
4. W.H Ionhman, C.Klelly, 1993, Developing the Data Warehouses, John Wiley & Sons.
5. Sourav S Bhowmick , Sanjay K Madria , Wee K Ng , Hardcover,2003, Web Data Management, Springer.
6. Pieter Adriaans & Dolf Zantinge, 1997, Data Mining, Pearson,

Instructions for paper setting: Seven questions are to be set in total. First question will be conceptual
covering entire syllabus and will be compulsory to attempt. Three questions will be set from each Part A
and Part B (one from each unit) Student needs to attempt two questions out of three from each part. Each
question will be of 20 marks.

Distribution of Continuous Evaluation:

Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Assignment/Tutorials
Sessional tests
Surprise questions during lectures/Class Performance
End Sem examination
COURSE ARTICULATION MATRIX:

CO Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

(BCS-DS-632) 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3

BCS-DS-632.1 3 - 2 - 1 2 1 - 2 1 1 1 - 1 2
BCS-DS-632.2 - 2 3 2 - 1 1 1 - 1 1 2 - 2 -
BCS-DS-632.3 3 - 2 - 1 1 - 2 2 - 2 3 1 - 1
BCS-DS-632.4 2 - 1 3 3 - 2 - 1 - 1 - 2 1 1
BCS-DS-632.5 - 2 3 2 2 - - 1 - 1 - - 3 1 -
MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
 (Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BHM-MC-009: Quantitative Aptitude and Personality Development-III

Periods/week Credits Max. Marks : 100

P :2 0 Continuous Evaluation : 50
Duration of Exam: 2 Hrs End Sem Examination : 50

Pre-Requisite: Basic Knowledge of maths and reasoning

Course Type: HSMC

Course Outcomes: Students will be able to-

BHM-MC-009.1. Recognize problem based on Modern Mathematics and Algebra
BHM-MC-009.2. Solve basic to moderate level problems based on Mensuration and Geometry.
BHM-MC-009.3. Calculate solution to logical reasoning.
BHM-MC-009.4. Get proficient with resume building and will be able to draft effective cover letters.
BHM-MC-009.5. Participate effectively and confidently in a Group Discussion
BHM-MC-009.6. Manage interviews effectively.

PART – A
Unit 1: Modern Mathematics and Algebra
1.1 Permutation and Combination
1.1.1 Principal of counting and Basic formulas
1.1.2 Arrangements, Selection and Selection + Arrangement.
1.1.3 Linear/Circular arrangements, Digits and Alphabetic Problems and Applications.
1.2 Probability
1.2.1 Events and Sample Space, Basic Formulas.
1.2.2 Problems on Coins, Cards and Dices.
1.2.3 Conditional Probability, Bayes’ Theorem and their Applications.
1.3 Algebra
1.3.1 Linear & Quadratic equations
1.3.2 Mathematical inequalities
1.3.4 Maximum & Minimum Values
1.3.3 Integral Solutions

Unit 2: Geometry and Mensuration

2.1 Geometry
2.1.1 Basic geometry & Theorems, Lines & Angles
2.1.2 Polygons, Triangle and Quadrilaterals
2.1.3 Circles
2.2 Mensuration I- Areas
2.2.1 Different types of Triangles and their area and perimeter.
2.2.2 Different types of Quadrilateral and their area and perimeter.
2.2.3 Circumference and Area of Circle, Area of Sector and length of Sector.
2.2.4 Mixed Figures and their Applications.
2.3 Mensuration II- Surface Areas and Volumes
2.3.1 Problems on Cubes & Cuboids, Cone, Cylinder and Sphere.
2.3.2 Prism and Pyramid.
2.3.3 Mixed Figures and their Applications.

Unit 3: Logical Reasoning

3.1 Linear Arrangement
 3.2 Circular Arrangement
3.3 Puzzles

Part - B
Unit 4: Professional Writing
4.1. Profiling on Social Sites: LinkedIn, Facebook, Instagram
4.2. Cover Letter/Emails
4.3. Resume Writing

Unit 5: Group Discussions

5.1. Do’s and Dont’s of a Group Discussion
5.2. Roles played in a Group Discussion
5.3. Tips for Cracking a Group Discussion

Unit 6: Managing Interviews

6.1. Developing the employability mindset
6.2. Preparing for Self -Introduction
6.3. Researching the employer
6.4. Portfolio Management
6.5. Answering Questions in an Interview

Text Books/Reference Books:

1. Arun Sharma, 2017 Teach Your Self Quantitative Aptitude, 1st Edition, McGraw Hills Education.
2. R S Aggarwal,2017, A Modern Approach to Logical Reasoning, S Chand & Company Pvt Ltd.
3. Yana Parker & Beth Brown, The Damn Good resume Guide
4. Ceri Roderick & Stephan Lucks, Interview Answers

Instructions for paper setting: Fifty MCQ will be set in total. Twenty five MCQ will be set from Part A
and twenty five MCQ will be set from Part B. All questions will be compulsory. Each question will be of 1
mark. There will be no negative marking. Calculator will not be allowed.

Distribution of Continuous Evaluation:

Sessional- I 30%
Sessional- II 30%
Assignment/Tutorial 20%
Class Work/ Performance 10%
Attendance 10%

Course Articulation Matrix :

CO Statement PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

(BHM-MC- 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
009)
BHM-MC-009.1 1 - - - - 1 - - - - - 1 - - 1
BHM-MC-009.2 1 - - - - 1 - - - - - 1 - - 1
BHM-MC-009.3 1 - - 2 - - - - - - - - - - -
BHM-MC-009.4 - - - - - - - 1 - 3 - 1 - - -
BHM-MC-009.5 - - - - - - - 1 - 3 - - - - -
BHM-MC-009.6 1 - - - - 1 - - - - - 1 - - 1
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-652: Machine Learning Lab

Periods/week Credits Max. Marks : 100

P: 2 1.0 Continuous Evaluation : 50
Duration of Examination: 2 Hrs End Sem Examination : 50

Co-Requisite: Machine Learning (BCS-DS-602)

Course Type: Program Core

Course Outcomes: The students will be able to-

BCS-DS-652.1. Understand the implementation procedures for the machine learning algorithms.
BCS-DS-652.2. Design Java/Python programs for various Learning algorithms.
BCS-DS-652.3. Apply appropriate data sets to the Machine Learning algorithms.
BCS-DS-652.4. Identify Machine Learning algorithms to solve real world problems.
BCS-DS-652.5. Formulate clustering algorithm for solving the problem.
BCS-DS-652.6. Implement the pre-processing operations on given dataset.

List of Practicals:
1. Write a program to import the datasets of Real-time/Offline applications.
2. Perform various operations on the dataset using Numpy module for numerical computation.
3. Perform dataset handling operations using Pandas.
4. Implement different preprocessing operations on the given dataset.
5. Write a program to the demonstrate the working of Linear Regression. Use an appropriate dataset and
evaluate the results.
6. Write a program to the demonstrate the working of Logistic Regression. Use an appropriate dataset and
evaluate the results.
7. Write a program to implement the naïve Bayesian classifier for a sample training data set stored as a
.CSV file. Compute the accuracy of the classifier, considering few test data sets.
8. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an appropriate
data set for building the decision tree and apply this knowledge to classify a new sample.
9. Write a program to implement k-Nearest Neighbor algorithm to classify the iris data set. Print both
correct and wrong predictions. Java/Python ML library classes can be used for this problem.
10. Write a program to Implement K-means clustering. Use appropriate dataset and evaluate the algorithm.

Software Required/Weblinks:
https://nptel.ac.in/courses/106016139/
htttps://www.courseera.org/learn/big-data-machine-learning
https://cognitive.ai/courses/machine-learning-with-python

Note: At least 5 more exercises to be given by the teacher concerned.

Distribution of Continuous Evaluation:

Viva- I 30%
Viva- II 30%
File/Records 20%
Class Work/ Performance 10%
Attendance 10%
Evaluation Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Semester Practical Examination

COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
652)
BCS-DS-652.1 1 - 1 - - - - - - 2 - - 2 2 -
BCS-DS-652.2 3 - 2 2 1 - - - 1 2 2 - - 1 2
BCS-DS-652.3 2 - 3 1 1 - - - 1 - - - 2 3 3
BCS-DS-652.4 3 1 3 1 - - - - - - - 2 2 2 2
BCS-DS-652.5 2 2 3 1 - - - - - - 2 2 - 3 -
BCS-DS-652.6 3 3 3 2 3 - - 1 2 3 1 2 3 - 3
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-653: Internet Of Things (IOT) lab

Periods/week Credits Max. Marks : 100

P: 2 1.0 Continuous Evaluation : 50
Duration of Examination: 2 Hrs End Sem Examination : 50

Co-Requisite: Internet Of Things (IOT)( BCS-DS-603)

Course Type: Program Core

Course Outcomes: Students will be able-

BCS-DS-653.1. Identify different infrastructure components including sensors, embedded hardware,
gateways and network systems for specified IoT application.
BCS-DS-653.2. Set up an embedded/microcomputer system and enable to write IoT application on it.
BCS-DS-653.3. Integrate microcontroller/microcomputer system with sensors to acquire data in real time.
BCS-DS-653.4. Establish a secure and consistent communication from microcontroller/microcomputer
system to the cloud.
BCS-DS-653.5. Design an application to create communication with multiple sensors to store data locally
and make it available on the Internet for subsequent comparison with cloud data.
BCS-DS-653.6. Apply the knowledge and skills acquired during the course to design IoT based solutions
for real world problems.

List of Experiments
1. Familiarization with Arduino board and perform necessary software installation.
2. To interface LED with Arduino and write a program to blink LED at defined delay.
3. To interface Push button/Digital sensor (IR/LDR) with Arduino and write a program to turn ON LED when
push button is pressed or at sensor detection.
4. Working with A/D conversion and sensor integration.
5. To interface Bluetooth with Arduino/Raspberry Pi and write a program to turn LED ON/OFF when ‘A’/’B’
is received from smartphone using Bluetooth.
6. Creating own Android App using MIT App Inventor, controlling Arduino connected devices and sending
data to ThingSpeak cloud.
7. Introduction to Raspberry-Pi: Setup and Procedure.
8. Controlling GPIO Pins of Raspberry-Pi to blink interfaced LED.
9. Sending sensor data to ThingSpeak cloud via R-Pi.
10. To interface DHT11 sensor with Arduino/Raspberry Pi and write a program to upload temperature and
humidity readings to ThingSpeak cloud.
11. Write a program on Arduino/Raspberry Pi to publish temperature data to MQTT broker.
12. Write a program on Arduino/Raspberry Pi to subscribe to MQTT broker for temperature data and print
it.
13. Study of other equivalent SBC boards for IoT applications.

Reference Books:
1. Dr. SRN Reddy, Rachit Thukral and Manasi Mishra, “Introduction to Internet of Things: A practical
Approach”, ETI Labs
2. Jeeva Jose, “Internet of Things”, Khanna Publishing House, Delhi
3. Adrian McEwen, “Designing the Internet of Things”, Wiley
4. Cuno Pfister, “Getting Started with the Internet of Things”, O Reilly Media

Software Required/Weblinks:
https://www.arduino.cc/
https://www.raspberrypi.org/

Note: At least 5 more exercises to be given by the teacher concerned.

Distribution of Continuous Evaluation:

Viva- I 30%
Viva- II 30%
File/Records 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Semester Practical Examination

COURSE ARTICULATION MATRIX :

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
653)
BCS-DS- 1 3 - - - - - - - - - 1 - - 1
653.1
BCS-DS- - - 3 1 - 2 - - - - - 1 - - -
653.2
BCS-DS- - - 2 2 - - - - - - - 1 - - -
653.3
BCS-DS- - - - - 3 2 2 - - - - 1 - - -
653.4
BCS-DS- - - - 2 3 3 2 - - - - 1 1 - -
653.5
BCS-DS- - - - - 2 2 3 - 1 - 2 1 - 2 -
653.6
MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-673: Complier Design Lab

Periods/week Credits Max. Marks : 100

P: 2 1.0 Continuous Evaluation : 50
Duration of Examination: 2 Hrs End Sem Examination : 50

Co-Requisite: Complier Design(BCS-DS-624)

Course Type: Program Electives

Course Outcomes: Students will be able to-

BCS-DS-673.1. Recognize and effectively explain the working of Lexical Analyzer.
BCS-DS-673.2. Understand the parsing techniques and their importance.
BCS-DS-673.3. Develop program to solve complex problems in compiler.
BCS-DS-673.4. Apply various data structures for storage allocation.
BCS-DS-673.5. Learn the new code optimization techniques and apply it to improve the performance of a
program in terms of speed & space.
BCS-DS-673.6. Use new tools and technologies used for designing a compiler.

List of Practicals:
1. Design a lexical analyzer for given language and the lexical analyzer should ignore redundant spaces,
tabs and new lines. It should also ignore comments. Although the syntax specification states that
identifiers can be arbitrarily long, you may restrict the length to some reasonable value. Simulate the
same in C language.
2. Write a C program to identify whether a given line is a comment or not.
3. Write a C program to recognize strings under 'a', 'a*b+',' abb'.
4. Write a C program to test whether a given identifier is valid or not.
5. Write a C program to simulate lexical analyzer for validating operators.
6. Write a C program for construction of LL(1) parsing.
7. Write a C program to implement LALR parsing.
8. Write a C program to implement Program semantic rules to calculate the expression that takes an
expression with digits, +and * and computes the value.
9. Implementation of symbol table.
10. Implement any one storage allocation strategies (Heap,Stack,Static).
11. Implementation of simple code optimization techniques (constant folding. etc.)

Text Books / Reference Books:

1. Ullman, J.D. and Aho, A.V., 1977. Principles of compiler design. Reading: Addison Wesley.
2. Yashwant, K., 1999. Let us C. Array and pointers, 7th edition, BPB publication.

Software required/Weblinks:
C/C++
www.w3schools.com/sql
www.tutorialspoint.com/sql

Note: At least 5 more exercises to be given by the teacher concerned.

Distribution of Continuous Evaluation:

Viva- I 30%
Viva- II 30%
 File/Records 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Semester Practical Examination

COURSE ARTICULATION MATRIX :

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
673)
BCS-DS-673.1 2 2 1 2 3 2 2 1 2 2 2 3 2 2 2
BCS-DS-673.2 3 2 2 2 3 2 3 2 2 3 3 3 2 2 2
BCS-DS-673.3 2 1 2 1 3 3 1 1 2 1 2 2 2 2 2
BCS-DS-673.4 1 3 2 3 3 1 1 1 2 1 3 3 2 2 2
BCS-DS-673.5 1 1 1 3 1 2 3 1 3 1 1 3 2 2 3
BCS-DS-673.6 1 1 3 1 3 3 3 2 3 3 1 3 1 3 3
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

BCS-DS-682: Data mining Lab using WEKA

Periods/week Credits Max. Marks : 100

P: 2 1.0 Continuous Evaluation : 50
Duration of Examination: 2 Hrs End Sem Examination : 50

Co-Requisite: Data Mining (BCS-DS-632)

Course Type: Program Electives

Course Outcomes: Students will be able to-

BCS-DS-682.1: Relate the concept of loading, preprocessing, and analysis of large data sets.
BCS-DS-682.2: Describe the concept of various classification models and also draw a connection between
these models.
BCS-DS-682.3 .Implement various clustering techniques and also draw a connection between these
techniques.
BCS-DS-682.4: Able to apply and explore the ideas and find association among data .
BCS-DS-682.5: Design and analyze new models to solve various real world problems.
BCS-DS-682.6: Plan and generate alternate solution to the existing framework and also study and analyze
the results through data visualization.

Program 1: Use Boston House Price Dataset i.e. housing.arff. Apply all preprocessing algorithms and
create a version of the initial data set in which the categorical data are converted into numerical data.

Program 2: Use all the above algorithms to classify weather data from the “weather.arff” file. Perform
initial preprocessing and create a version of the initial dataset in which all numeric attributes should be
converted to categorical data.

Program 3: Use k-means algorithm to bank data from the “bank.arff” file. Perform initial preprocessing
and create a version of the initial data set in which the ID field should be removed and the "children"
attribute should be converted to categorical data.

Program 4: Use Apriori algorithm to generate association rules for Iris data from the “iris.arff” file. Perform
preprocessing and convert categorical data into numeric attributes and analyze results.

Program 5: Use “vote.arff” file for the processing of various attribute selection algorithm and evaluation
of various performance measures.

Program 6: Use “diabetes.arff” file to evaluate various performance parameters for any three classifiers.
Then generate and display the comparison graph for all the above performance parameters through various
charts or graphs.
Program 7: Design and create an ensemble model using more than one classification algorithms (Bagging
and Boosting)
Program 8: Design and create an ensemble model using more than two classification algorithms
(Boosting).
Program 9: Design a Project for the Analysis and Identification handwritten digits using neural network
model behavior.
Program 10: Design a Project for the Analysis and Prediction of student’s behavior using suitable
algorithms.
Text Books/ Reference Books:
1. Bostjan Kaluza, 2013, Instant Weka How-to, Packt Publishing
2. Eric Goh, 2019, Learn By Examples - A Quick Guide to Data Mining with Weka and Java using Weka, SVBook
Pte. Ltd.
3. Eric Goh, 2019, Learn By Examples - A Quick Guide to Data Mining with Rapid miner and Weka, SVBook Pte.
Ltd.

Software required/Weblinks:
WEKA 3.8.3
www.cs.wakato.ac.nz
http://wekatutorial.com
www.tutorialspoint.com

Distribution of Continuous Evaluation:

Viva- I 30%
Viva- II 30%
File/Records 20%
Class Work/ Performance 10%
Attendance 10%

Evaluation Tools:
Experiments in lab
File work/Class Performance
Viva (Question and answers in lab)
End Term Practical Exam

COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(BCS-DS-
682)
BCS-DS-682.1 3 3 3 3 1 1 1 1 1 1 1 1 1 1 1
BCS-DS-682.2 3 3 3 3 3 3 2 1 3 2 2 3 3 2 2
3 3 3 3 3 3 2 1 3 2 2 3 2 2
BCS-DS-682.3
3
BCS-DS-682.4 3 3 3 3 3 3 2 1 2 2 2 3 3 2 2
BCS-DS-682.5 3 3 3 3 3 3 2 1 3 1 3 3 3 2 3
BCS-DS-682.6 3 3 3 3 3 3 2 1 2 1 3 3 3 2 3
 MANAV RACHNA INTERNATIONAL INSTITUTE OF RESEARCH AND STUDIES
(Deemed to be University under section 3 of the UGC Act 1956)
NAAC 'A' Grade University

PROJ-CS-600: Project-I

Periods/week Credits Max. Marks : 50

P: 2 1.0 Continuous Evaluation : 50
Duration of Examination: 2 Hrs

Pre-Requisite: Basic Knowledge of computers

Course Type: Projects

Course Outcomes: Students will be able to-

PROJ-CS-600.1: Conceptualize real world situations related to systems development decisions, Originating
from source requirements and goals.
PROJ-CS-600.2: Identify various computing tools.
PROJ-CS-600.3: Identify their area of interest and do extensive literature survey on the same.
PROJ-CS-600.4: Design models as a solution for particular problems.
PROJ-CS-600.5: Implement basic solutions in various platforms
PROJ-CS-600.6: Prepare a summarized report in the form of synopsis.

Text Books / Reference Books:

1. Harold Kerzner, 2013, Project Management: A Systems Approach to Planning, Scheduling, and
Controlling; 11th edition, WILEY.
2. Adrienne Watt, 2008, Project management; BC Open Text book.

Software required/Weblinks:
Ieee.org
www.neptal.com

Distribution of Continuous Evaluation:

Presentation/Viva 40%
Report 20%
Class Work/ Performance 20%
Attendance 20%

Evaluation Tools:
Presentation/Implementation
COURSE ARTICULATION MATRIX:

CO PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO PSO

Statement 1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
(PROJ-CS-
600)
PROJ-CS-600.1 - - - 2 - 3 3 1 - - - - - - -
PROJ-CS-600.2 - - - - 2 - - - - - - - - - -
PROJ-CS-600.3 - 2 - 1 - - - - - - - - - - 3
PROJ-CS-600.4 - - 3 - - - - - - - 1 - - - -
PROJ-CS-600.5 - - - 2 3 - - - - - - - - - -
PROJ-CS-600.6 - - - 3 - - - 3 2 - 2 2 - - -