BigData Analytics

Course code 24MCA352 CIE Marks 50

Teaching Hours/Week(L:P:SDA) 3:0:0 SEE Marks 50

Total Hours of pedagogy 40 Total Marks 100

Credits 03 Exam Hours 03
Course Learning objectives:
 Identify the characteristics of datasets and compare the trivial data and big
 Demonstrate an open source software framework called Hadoop and supported tool to empower any
meaningful conversation on Big data and analytics.
 Compare and Contrast different Hadoop supporting tools with traditional tool.
 How Big Data can be analyzed to extract knowledge and apply tools for bigdata analytics
Module-1
Getting an Overview of Big Data:
What is Big Data? History of Data Management-Evolution of Big Data, Structuring Big Data-Types of Data,
Elements of Data, Advantages of Big Data Analytics Introducing Technologies for Handling Big Data
Distributed and Parallel Computing for Big Data, Introducing Hadoop, Cloud Computing and Big Data: Cloud
Delivery Models, Cloud Services for Big Data, Cloud Providers in Big Data Market, In-Memory
Computing Technology for Big Data.

Text Book 1:Chapter 1 & 3

Teaching-Learning Chalk and talk method / PowerPoint Presentation

Process

Module-2
Understanding Hadoop Ecosystem :
Hadoop Ecosystem, Hadoop Distributed File System: HDFS Architecture, Concept of Blocks in HDFS in HDFS
Architecture, NameNodes and DataNodes, The Command-line Interface, Using HDFS Files, HDFS High
Availability, Features of HDFS, MapReduce, Hadoop YARN, Introducing HBase: HBase Architecture, Regions,
Storing Big Data with Hbase, Interacting with Hadoop Ecosystem, Hbase in Operation – Programming with
HBase,Combining HBase and HDFS: REST and Thrift, Data Integrity in HDFS, Features of HBase, Hive, Pig and
Pig Latin, Sqoop, Zookeeper, Flume, Oozie

Text Book 1:Chapter 4

Teaching-Learning Chalk and talk method / PowerPoint Presentation

Process

Module-3
Understanding MapReduce
Fundamentals and HBasE:The MapReduce Framework: Exploring the Features of MapReduce , working of
MapReduce, Exploring Map and Reduce functions.
Techniques to Optimize MapReduce Jobs: Harware / Network Topology,
Synchronization, File System. Uses of MapReduce, Role of HBase in Big data Processing: Characteristics of
HBase, Installation of HBase.

Text Book 1: Chapter 5

Teaching-Learning Chalk and talk method / PowerPoint Presentation

Process
 Module-4
Introduction to MongoDB and Cassandra:
Introduction to MongoDB: What is and Why MongoDB? Terms used in RDBMS and MongoDB, Data types
in MongoDB,MongoDB Query language. Apache Cassandra, features, CQL data types, CQLSH, key spaces,
CRUD, collections, TTL, using a counter, ALTER commands, import and export, query system tables.
Text Book 2: Chapter 6 & 7

Teaching-Learning Chalk and talk method / PowerPoint Presentation

Process

Module-5
Introduction to Hive and Pig :
what is Hive? , Hive Architecture, Hive Data Types, Hive File Format, Hive Query Language (HQL), RCFile
Implementation, SerDe, User-defined Function (UDF).
What is Pig? The Anatomy of Pig, Pig on Hadoop , Pig Philosophy, Use Case for Pig: ETL Processing, Pig Latin
Overview , Data Types in Pig ,Running Pig , Execution Modes of Pig ,HDFS Commands ,Relational Operators,
Eval Function, Complex Data Types ,Piggy Bank, User- Defined Functions (UDF)
,Parameter Substitution , Diagnostic Operator , Word Count Example using Pig ,When to use Pig? When not
to use Pig? Pig at Yahoo!, Pig versus Hive.

Text Book 2 : Chapter 9 & 10

Teaching-Learning Chalk and talk method / PowerPoint Presentation

Process

Assessment Details(both CIE and SEE)

CIE for the practical component of IPCC

SEE for IPCC

Suggested Learning Resources:

Text Books:
1. “Big Data: Black Book” Dt Editorial Services Dreamtech Press comprehensive Problem solver.
2. “Big Data Analytics “ Seema Acharya, Subhashini Chellappan 2nd Edition, Wiley India
Reference books:
1. Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications” Wiley.

2. Michael Minelli, Michehe Chambers, “Big Data, Big Analytics: Emerging Business Intelligence and
Analytic Trends for Today‟s Businesses”, 1st Edition, Michael Minelli, Michele Chambers,
AmbigaDhiraj, Wiley CIO Series, 2013.

3. Tom White, “Hadoop: The Definitive Guide”, 3rd Edition, O‟reilly, 2012.
Skill Development Activities Suggested
 The students with the help of the course teacher can take up technical –activities which will enhance their
skill or the students should interact with industry (small, medium and large), understand their problems or
foresee what can be undertaken for study in the form of research/testing/projects, and for creative and
innovative methods to solve the identified problem. 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 Understand and comprehend the basics of Python programming. L2.
CO2 Apply knowledge in real time applications L3
CO3 Apply the Data Pre-processing & Data Wrapping L3
CO4 Demonstrate the Web Scraping And Numerical Analysis L3

Sl. No. Description POs

1 Foundation Knowledge: Apply knowledge of mathematics, programming logic and coding PO1
fundamentals for solution architecture and problem solving.

2 Problem Analysis: Identify, review, formulate and analyse problems for primarily PO2
focussing on customer requirements using critical thinking frameworks

3 Development of Solutions: Design, develop and investigate problems with as an PO3

innovative approach for solutions incorporating ESG/SDG goals.

4 Modern Tool Usage: Select, adapt and apply modern computational tools such as PO4
development of algorithms with an understanding of the limitations including human
biases..

5 Individual and Teamwork: Function and communicate effectively as an individual or a PO5

team leader in diverse and multidisciplinary groups. Use methodologies such as agile.

6 Project Management and Finance: Use the principles of project management such as PO6
scheduling, work breakdown structure and be conversant with the principles of Finance for
profitable project management.
7 Ethics: Commit to professional ethics in managing software projects with financial aspects. PO7
Learn to use new technologies for cyber security and insulate customers from malware

8 Life-long learning: Change management skills and the ability to learn, keep up with PO8
contemporary technologies and ways of working.
Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8

CO1
CO2 X X
CO3 X
CO4 X

Data Analytics Lab with Mini-project

Course code 22MCAL36 CIE Marks 50
Teaching :3:0 SEE Marks 50
Hours/Week(L:P:SDA)
Total Hours of 03 Total Marks 100
pedagogy
Credits 02 Exam Hours 03
Course objectives:
 Develop python program to perform search/sort on a given data set
 Demonstrate object oriented principles
 Demonstrate data visualization using Numpy for a given problem
 Demonstrate regression model for a given problem
 Design and develop an application for the given problem
Sl. No Experiments
1 Write a Python program to perform linear search
2 Write a Python program to insert an element into a sorted list
3 Write a python program using object oriented programming to
demonstrate encapsulation, overloading and inheritance
4 Implement a python program to demonstrate
1) Importing Datasets 2) Cleaning the Data
3) Data frame manipulation using Numpy
5 Implement a python program to demonstrate the following using
NumPy
a) Array manipulation, Searching, Sorting and splitting.
b) broadcasting and Plotting NumPy arrays
6 Implement a python program to demonstrate Data visualization with
various Types of Graphs using Numpy
7 Write a Python program that creates a mxn integer array and Prints its
attributes using matplotlib
8 Write a Python program to demonstrate the generation of linear
regression models.
9 Write a Python program to demonstrate the generation of logistic
regression models using
10 Write a Python program to demonstrate Time series analysis with
Pandas.
11 Write a Python program to demonstrate Data Visualization using
Seaborn
Part B
1 Students shall carry out a mini project using python/pandas to
demonstrate the data analysis.
2 A team of two students must develop the mini project. However during
the examination, each student must demonstrate the project
individually.
3 The team must submit a brief project report (20-25 pages) that must
include the following a. Introduction b. Requirement Analysis c.
Software Requirement Specification d. Analysis and Design, e.
Implementation f. Testing
4 Brief synopsis not more than two pages to be submitted by the team as
per the format given. It is recommended that students to do prior art
search as part of literature survey before submitting the synopsis for the
Mini/Major projects.
5 Rubrics may be used to evaluate the Mini-Project
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
CO1:Apply object-oriented programming concepts to develop dynamic interactive Python
Applications.
CO2: Use the procedural statements: assignments, conditional statements, loops, method calls
and arrays
CO3: Design, code, and test small Python programs with a basic understanding of top-down
Design.
CO4: Learn how to create GUI and solve real-world problem using language idioms, data
structures and standard library.
Assessment Details (both CIE and SEE)

Semester End Evaluation (SEE):

Data Structures and Algorithms Laboratory

Course code 22MCAL27 CIE Marks 50
Teaching Hours/Week 0:3:0 SEE Marks 50
(L:P: SDA)
 Credits 02 External Marks 100
Course objectives:
 Evaluate the Expressions like postfix, prefix conversions.
 Implementing various data structures viz. Stacks, Queues, Linked Lists, Trees and Graphs
Sl.No Experiments
1. Implement a Program in C for converting an Infix Expression to Postfix
Expression.
2. Design, develop, and execute a program in C to evaluate a valid postfix
expression using stack. Assume that the postfix expression is read as a
single line consisting of non-negative single digit operands and binary
arithmetic operators. The arithmetic operators are + (add), - (subtract), *
(multiply) and / (divide).
3. Design, develop, and execute a program in C to simulate the working of a
queue of integers using an array. Provide the following operations: a. Insert
b. Delete c. Display
4. Write a C program to simulate the working of a singly linked list providing
the following operations: a. Display & Insert b. Delete from the
beginning/end c. Delete a given element
5. Write a C program to Implement the following searching techniques a.
Linear Search b. Binary Search.
6. Write a C program to implement the following sorting algorithms using
user defined functions: a. Bubble sort (Ascending order) b. Selection sort
(Descending order).
7. Find Minimum Cost Spanning Tree of a given undirected graph using
Kruskal's algorithm ( C programming)
8. From a given vertex in a weighted connected graph, find shortest paths to
other vertices Using Dijkstra's algorithm (C programming)
Course outcomes (Course Skill Set):
At the end of the course the student will be able to:
 Implement the techniques for evaluating the given expression.
 Implement sorting / searching techniques, and validate input/output for the given problem.
 Implement data structures (namely Stacks, Queues, Circular Queues, Linked Lists, and Trees), its
operations and algorithms.
 Implement the algorithm to find whether the given graph is connected or not and conclude on the
performance of the technique implemented.
Assessment Details (both CIE and SEE)

Semester End Evaluation (SEE):

 Cryptography and Network Security
Course Code 24MCA251 CIE Marks 50
Teaching 4:0:0 SEE Marks 50
Hours/Week(L:P:SDA
)
Total Hours of 40 Total Marks 100
Pedagogy
Credits 03 Exam Hours 03
Course Learning objectives:
 To make the student learn different encryption techniques along with hash functions, MAC,
digital signatures and their use in various protocols for network security and system security.
Module-1
INTRODUCTION: Computer Security Concepts, The OSI Security Architecture, Security Attacks,
Security Services, Security Mechanisms, A Model for Network Security.
CLASSICAL ENCRYPTION TECHNIQUES: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Steganography.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-2
BLOCK CIPHERS AND THE DATA ENCRYPTION STANDARD: Block Cipher Principles, The
Data Encryption Standard (DES), A DES Example, The Strength of DES, Differential and Linear
Cryptanalysis, Block Cipher Design Principles.
BLOCK CIPHER OPERATION: Multiple Encryption and Triple DES, Electronic Codebook
Mode, Cipher Block Chaining Mode, Cipher Feedback Mode, Output Feedback Mode, Counter
Mode. STREAM CIPHERS : Stream Ciphers, RC4.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-3
NUMBER THEORY-: Divisibility and the Division Algorithm, The Euclidean Algorithm,
Modular Arithmetic, Prime Numbers, Fermat‟s and Euler‟s Theorems, Testing for
Primality, The Chinese Remainder Theorem, Discrete Logarithms. PUBLIC-KEY
CRYPTOGRAPHY, RSA AND OTHER PUBLIC-KEY CRYPTOSYSTEMS: Principles
of Public-Key Cryptosystems, The RSA Algorithm, DiffieHellman Key Exchange,
ElGamal Cryptosystem.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-4
CRYPTOGRAPHIC HASH FUNCTIONS: Applications of Cryptographic Hash Function, Two Simple
Hash Functions, 195 G V P College of Engineering (Autonomous) 2013 Requirements and Security,
Hash Functions Based on Cipher Block Chaining, Secure Hash Algorithm (SHA). MESSAGE
AUTHENTICATION CODES : Message Authentication Requirements, Message Authentication
Functions, Message Authentication Codes, Security of MACs, MACs Based on Hash Functions
(HMAC).
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Module-5
DIGITAL SIGNATURES- Digital Signatures, ElGamal Digital Signature Scheme, Schnorr Digital
Signature Scheme, Digital Signature Standard (DSS).
KEY MANAGEMENT AND DISTRIBUTION: Symmetric Key Distribution Using Symmetric Encryption,
Symmetric Key Distribution Using Asymmetric Encryption, Distribution of Public Keys, X.509
Certificates, Public Key Infrastructure.
Teaching- Chalk and talk method / PowerPoint Presentation
Learning
Process
Assessment Details (both CIE and SEE):

Suggested Learning Resources:

Text Books:

1. William Stallings: Cryptography And Network Security- Principles And Practice, 5th Edition,
Pearson/PHI, 2011.

Reference books:

1. William Stallings, “Network Security Essentials (Applications and Standards)”, 4th Edition,
Pearson Education. ,2012

2. Buchmann: “Introduction to Cryptography”, 2nd Edition, Springer, 2004.

3. 5. Robert Bragg, Mark Rhodes: “Network Security: The complete reference”, 1st Edition,
TMH, 2004.
Skill Development Activities Suggested:
 The students with the help of the course teacher can take up technical –activities which will
enhance their skill or the students should interact with industry (small, medium and large),
understand their problems or foresee what can be undertaken for study in the form of
research/testing/projects, and for creative and innovative methods to solve the identified
problem. 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 design classical encryption techniques and block L2
ciphers.
CO2 Understand and analyse data encryption standard. L2
CO3 Understand and analyze public-key cryptography, RSA and L2
other public-key cryptosystems
CO4 Understand key management and distribution schemes and L2
design User Authentication, such as Diffie-Hellman Key
Exchange, ElGamal Cryptosystem, etc
CO5 Analyze and design hash and MAC algorithms, and digital L2
signatures
 Data Mining and Business Intelligence
Course Code 24MCA242 CIE Marks 50
Teaching Hours/Week(L:P:SDA) 4:0:0 SEE Marks 50
Total Hours of Pedagogy 40 External Marks 100
Credits 4 Exam Hours 03
Course Learning objectives:
 To introduce the concept of data Mining as an important tool for enterprise data management and as
a cutting edge technology for building competitive advantage.
 To enable students to effectively identify sources of data and process it for data mining.
 To impart skills that can enable students to approach business problems analytically by identifying
opportunities to derive business value from data.
 Learning how to gather and analyse large sets of data to gain useful business understanding.
Module-1
Introduction to Data Mining: What Is Data Mining, Kinds of Data Can Be Mined, Kinds of Patterns Can Be
Mined, Technologies Used, Kinds of Applications Are Targeted, Major Issues in Data Mining, KDD Process,
Types of Attribute Types, Measuring Data Similarity and Dissimilarity.
Data Pre-processing: Why pre-processing, Data cleaning: Missing Values, Noisy Data; Data Integration,
Data Reduction: Attribute Subset Selection; Data Transformation and Data Discretization: Normalization,
Binning, Histogram Analysis, Concept Hierarchy Generation.
Teaching-Learning Process Chalk and talk method / PowerPoint
Presentation
Module-2
Classification: Basic Concepts; Decision Tree Induction: Decision Tree Induction, Attribute Selection
Measures, Tree Pruning; Bayes Classification Methods: Bayes’ Theorem, Naive Bayesian Classification;
Model Evaluation and Selection: Metrics for Evaluating Classifier Performance, Holdout Method and
Random Subsampling, Cross-Validation, Bootstrap.
Teaching-Learning Process Chalk and talk method /
PowerPoint Presentation
Module-3
Clustering Techniques:Cluster analysis: Basic Concepts; Partitional Methods: KMeans, K-Medoids;
Hierarchical Methods: Agglomerative, Divisive, BIRCH; Density-Based Methods: DBSCAN.
Outlier Analysis: Statistical Distribution-Based Outlier Detection,Distance based outlier detection,Density
Based Local Outlier Detection
Teaching-Learning Process Chalk and talk method /
PowerPoint Presentation
Module-4
Association Analysis: Basic Concepts and Algorithms:Basic Concepts: Market Basket Analysis - A
Motivating Example, Frequent Itemsets, Closed Itemsets, and Association Rules;
Frequent Itemset Mining Methods:Apriori Algorithm - Finding Frequent Itemsets by ConfinedCandidate
Generation, Generating Association Rules from Frequent Itemsets, Evaluation of Association Patterns.
Teaching-Learning Process Chalk and talk method /
PowerPoint Presentation
Module-5
Applications and Trends in Data Mining: Data Mining Applications, Data mining system products and
Research prototypes, Additional themes on data mining, Trends in Data Mining.
Teaching-Learning Process Chalk and talk method /
PowerPoint Presentation

Assessment Details (both CIE and SEE):

Suggested Learning Resources:

Text Books:
1. Jiawei Han, MichelineKamber, Jian Pei “Data Mining Concepts and Techniques”, 3rd Edition,
Morgan Kaufmann Publisher.
[ 1.,1.2,1.3,1.4,1.5,1.6,1.9,2.1,2.2,2.3,2.4,2.5,5.1,6.1,6.2,6.3,6.4,6.12,6.13,6.15,7.1,7.2,7.3,7.4,7.5,
7.11]

2. Pang-Ning Tan, Michael Steinbach, Vipin Kumar “ Introduction to Data Mining”, Pearson, First
impression.

3. G. Shmueli, N.R. Patel, P.C. Bruce, “Data Mining for Business Intelligence: Concepts, Techniques,
and Applications in Microsoft Office Excel with XLMiner”, 1st Edition, Wiley India.

4. Carlo Vercellis, “Business Intelligence: Data Mining and Optimization for Decision Making”, Wiley
India Publication
Skill Development Activities Suggested:
 The students with the help of the course teacher can take up technical –activities which will enhance
their skill or the students should interact with industry (small, medium and large), understand their
problems or foresee what can be undertaken for study in the form of research/testing/projects, and for
creative and innovative methods to solve the identified problem. 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 To Demonstrate an understanding of the L2
concepts of importance of data mining, and the
principles of business intelligence
CO2 ToOrganize and Prepare the data needed for L2
data mining using pre preprocessing techniques
CO3 ToImplement the appropriate data mining L2
methods like classification, clustering, or
Frequent Pattern mining on large data sets.
CO4 ToDefine and apply metrics to measure the L2
performance of various data mining algorithms.
CO5 Apply BI to solve practical problems : Analyze L2
the problem domain, use the data collected in
enterprise apply the appropriate data mining
technique, interpret and visualize the results
and provide decision support.
 Cloud Computing
Course Code 24MCA252 CIE Marks 50
Teaching 4:0:0 SEE Marks 50
Hours/Week(L:P:SDA
)
Total Hours of 40 External Marks 100
Pedagogy
Credits 4 Exam Hours 03
Course Learning objectives:
 Explain the fundamentals of cloud computing
 Illustrate the cloud application programming and aneka platform
 Contrast different cloud platforms used in industry
Module-1
Introduction to Cloud Computing: Eras of computing, The vision of Cloud Computing, Defining a
cloud, A closer look, Cloud computing reference model, Historical developments: Distributed
systems, Virtualization, Web 2.0; Service oriented computing; Utility oriented computing.
TeachingLearning Process Chalk and Talk/PPT/Web Content
Module-2
Architectures for parallel and distributed computing: Parallel Vs Distributed computing, Elements
of parallel computing, Elements of distributed computing, Technologies for distributed computing.
TeachingLearning Process Chalk and Talk/PPT/Web Content
Module-3
Virtualization: Introduction, Characteristics of virtualized environments, Taxonomy of
virtualization techniques, Virtualization and cloud computing, Pros and cons of virtualization,
Technology examples: Xen: Para virtualization, VmWare: Full virtualization, Microsoft Hyper – V.
TeachingLearning Process Chalk and Talk/PPT/Web Content
Module-4
Cloud computing architecture: Introduction, Cloud reference model: Architecture, IaaS, PaaS,
SaaS, Types of Clouds: Public, Private, Hybrid and Community clouds, Economics of the cloud,
Open challenges.
TeachingLearning Process Chalk and Talk/PPT/Web Content
Module-5
Cloud Platforms in Industry : Amazon web services; Google AppEngine; Microsoft Azure; Cloud
Applications. Scientific applications: Healthcare; Biology; Geo-Science, Business and Consumer
applications: ARM & ERP; Productivity; Social networking
TeachingLearning Process Chalk and Talk/PPT/Web Content
Assessment Details (both CIE and SEE):
Suggested Learning Resources:
Textbooks :
1. Rjkumar Buyya, Christian Vecchiola, and ThamaraiSelci, Mastering Cloud Computing, Tata
McGraw Hill, New Delhi, India, 2013
Reference Books

 Cloud Computing for Dummies by Judith Hurwitz, R.Bloor, M. Kanfman, F.Halper (Wiley
India Edition)

 2. Cloud Computing: A Practical Approach by J.Vette, Toby J. Vette, Robert Elsenpeter

(Tata McGraw Hill).
Skill Development Activity
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 Demonstrate the fundamental and core L2
concepts of cloud computing
CO2 Compare between parallel and distributed L3
computing
CO3 Investigate the system virtualization and outline L2
its role in enabling the cloud computing system
model
CO4 Compare different deployment and service L2
models of cloud to develop different variety of
applications

Mapping of COS and POs

PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1
CO2
CO3
CO4
 Mobile Application Development
Course Code 24MCA253 CIE Marks 50
Teaching 4:0:0 SEE Marks 50
Hours/Week(L:P:SDA
)
Total Hours of 40 External Marks 100
Pedagogy
Credits 4 Exam Hours 03