Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Big Data Analytics L P C

3 3

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐429T
EAE 7 DS‐EAE DS‐EAE‐4 DS‐429T

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto 5
sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. Understand the Big Data Platform and its Use cases
2. Provide HDFS Concepts and Interfacing with HDFS
3. Provide hands on Hodoop Eco System
4. Exposure to Data Analytics with R
Course Outcomes (CO)
CO 1 Identify Big Data and its Business Implications
CO 2 List the components of Hadoop and Hadoop Eco‐System
CO 3 Develop Big Data Solutions using Hadoop Eco System
CO 4 Manage Job Execution in Hadoop Environment
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 2 ‐ ‐ 2 3 ‐ ‐ ‐ 1 ‐ ‐ ‐
CO 2 ‐ 2 ‐ ‐ ‐ 2 3 ‐ 1 2 ‐ ‐
CO 3 ‐ 1 ‐ ‐ ‐ 2 ‐ ‐ ‐ 2 ‐ ‐
CO 4 ‐ 3 ‐ ‐ ‐ 2 ‐ ‐ ‐ 2 ‐ ‐

UNIT‐I

Introduction to Big Data: Introduction to Big Data, Big Data characteristics, Challenges of Conventional System,
Types of Big Data, Intelligent data analysis, Traditional vs. Big Data business approach, Case Study of Big Data
Solutions.

UNIT‐II

Hadoop: History of Hadoop, Hadoop Distributed File System: Physical organization of Compte Nodes,
Components of Hadoop Analyzing the Data with Hadoop, Scaling Out, Hadoop Streaming, Design of HDFS,Java
interfaces to HDFS Basics, Developing a Map Reduce Application, How Map Reduce Works, Anatomy of a Map
Reduce Job run, Failures, Job Scheduling, Shuffle and Sort, Task execution, Map Reduce Types and Formats,
Map Reduce Features, Hadoop environment. Setting up a Hadoop Cluster, Cluster specification, Cluster Setup
and Installation, Hadoop Configuration, security in Hadoop, Administering Hadoop, Monitoring‐Maintenance,
Hadoop benchmarks, Hadoop in the cloud

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 544
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

UNIT‐III

NoSQL: What is NoSQL? NoSQL business drivers; NoSQL case studies; NoSQL data architecture patterns: Key‐
value stores, Graph stores, Column family (Bigtable) stores, Document stores, Variations of NoSQL architectural
patterns; Using NoSQL to manage big data: What is a big data NoSQL solution? Understanding the types of big
data problems; Analyzing big data with a shared‐nothing architecture; Choosing distribution models: master‐
slave versus peer‐to‐peer; Four ways that NoSQL systems handle big data problems

UNIT – IV

Frameworks: Applications on Big Data Using Pig and Hive, Data processing operators in Pig, Hive services,
HiveQL, Querying Data in Hive, fundamentals of HBase and ZooKeeper, IBM InfoSphere BigInsights and
Streams. Machine Learning: Introduction, Supervised Learning, Unsupervised Learning, Collaborative Filtering.
Big Data Analytics with BigR

Textbook(s):
1. Jiawei Han, Micheline Kamber, Jian Pei, “Data Mining : Concepts and Techniques”, 3rd edition, MK Publisher
2. Tom White “Hadoop: The Definitive Guide” Third Editon, O’reily Media, 2012.

References:
1. Seema Acharya, Subhasini Chellappan, "Big Data Analytics" Wiley 2015.
2. Michael Berthold, David J. Hand, "Intelligent Data Analysis”, Springer, 2007

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 545
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Big Data Analytics Lab L P C

2 1

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐429P
EAE 7 DS‐EAE DS‐EAE‐4 DS‐429P

Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Big Data Analytics) as this is the
practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.

1. Downloading and installing Hadoop; Understanding different Hadoop modes. Startup scripts, Configuration
files
2. Implement the following file management tasks in Hadoop:
i. Adding files and directories
ii. Retrieving files
iii. Deleting files
Hint: A typical Hadoop workflow creates data files (such as log files) elsewhere and copies them into HDFS
using one of the above command line utilities
3. Implement of Matrix Multiplication with Hadoop Map Reduce
4. Write a Map Reduce program that mines weather data. Hint: Weather sensors collecting data every hour
at many locations across the globe gather a large volume of log data, which is a good candidate for analysis
with Map Reduce, since it is semi structured and record‐oriented
5. Run a basic Word Count Map Reduce program to understand Map Reduce Paradigm.
6. Implementation of K‐means clustering using Map Reduce.
7. Installation of Hive along with practice examples.
8. Installation of HBase, Installing thrift along with Practice examples
9. Run the Pig Latin Scripts to find Word Count.
10. Run the Pig Latin Scripts to find a max temp for each and every year.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 546
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Data Science using R L P C

3 3

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐427T
EAE 7 DS‐EAE DS‐EAE‐3 DS‐427T

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto
5 sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. The fundamental knowledge on basics of data science and R programming.
2. The programs in R language for understanding and visualization of data using statistical functions and
plots.
3. The fundamentals of how to obtain, store, explore, and model data efficiently.
4. The fundamentals of probability and statistics for data science.
Course Outcomes (CO)
CO 1 Understand basics of data science and R programming.
CO 2 Understand and visualize data using statistical functions and plots.
CO 3 Explain how to obtain, store, explore, and model data efficiently.
CO 4 Apply probability and statistics for data science.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 1 2 ‐ 3 2 ‐ 1 ‐ ‐ ‐ ‐ ‐
CO 2 ‐ ‐ ‐ 3 2 ‐ 2 ‐ ‐ ‐ ‐ ‐
CO 3 ‐ ‐ ‐ 2 2 ‐ 2 ‐ ‐ ‐ ‐ ‐
CO 4 ‐ 1 ‐ 3 2 ‐ 3 2 2 ‐ ‐ ‐

UNIT‐I

Structured versus unstructured data, Quantitative and qualitative data, The four levels of data: Nominal level,
Ordinal level, Interval level, and Ratio level, The five steps of Data Science: Ask an interesting question, obtain
the data, explore the data, model the data, communicate and visualize the results, Explore the data.

UNIT‐II

How to run R, R Sessions and Functions, Basic Math, Variables, Data Types, Vectors, Conclusion, Advanced Data
Structures, Data Frames, Lists, Matrices, Arrays, Classes, R Programming Structures, Control Statements, Loops,
‐ Looping Over Nonvector Sets,‐ If‐Else, Arithmetic and Boolean Operators and values, Default Values for
Argument, Return Values, Functions are Objects, Recursion.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 668
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

UNIT‐III

Mathematics: Vectors and matrices, Arithmetic symbols, Graphs, Logarithms/exponents, Set theory, Linear
algebra. Probability: Basic definitions, Probability, Bayesian versus Frequentist, Compound events, Conditional
Probability, The rules of probability, Collectively exhaustive events, Bayes theorem, Random variables

UNIT ‐ IV

Statistics: Obtaining data, Sampling data, Measuring Statistics, The Empirical rule, Point estimates, Sampling
distributions, Confidence intervals, Hypothesis tests

Textbook(s):
1. Sinan Ozdemir, “Principles of Data Science”, Packt.
2. Norman Matloff, “The Art of R Programming”, Cengage Learning.

References:
1. G. Jay Kerns, “Introduction to Probability and Statistics Using R”, First Edition.
2. Nina Zumel, John Mount, “Practical Data Science with R”, Manning Publications, 1st Edition, 2014

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 669
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Data Science using R Lab L P C

2 1

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐427P
EAE 7 DS‐EAE DS‐EAE‐3 DS‐427P

Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Data Science using R) as this is the
practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.

1. Installation of R, basic syntax of R.

2. Describing data, viewing and manipulating data using R.
3. Visualizing data‐ tables, charts, plots using R.
4. Implementing binomial distribution and plotting density and distribution function.
5. Implementation probability distribution
6. Exploratory data analysis‐ range, mean, variance, median, standard deviation.
7. Implementation densities of random numbers‐ distribution in R, making histogram.
8. Correlations‐ making of scatter plots, use of scatter plots to investigate relationship between two variables.
9. Statistical function in R‐Statistical inference, contingency tables, chi‐square goodness of fit
10 Implement linear and logistics regression in R.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 670
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Data Warehousing and Data Mining L P C

3 3

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE/CST 7 PCE PCE‐5 CIE‐425T

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto
5 sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. To understand the need of data warehousing for data analysis
2. To understand and apply OLAP operations
3. To identify the need of various data mining techniques.
4. To apply various data mining techniques.
Course Outcomes (CO)
CO 1 Able to understand ETL Process.
CO 2 Able to understand and apply OLAP operations for data analysis.
CO 3 Able to apply supervised learning based data mining techniques.
CO 4 Able to apply unsupervised learning based data mining techniques.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 3 3 2 2 2 ‐ ‐ ‐ 3 2 2 3
CO 2 3 3 2 2 2 ‐ ‐ ‐ 3 2 2 3
CO 3 3 3 2 3 3 ‐ ‐ ‐ 3 2 2 3
CO 4 3 3 2 3 3 ‐ ‐ ‐ 3 2 2 3

UNIT‐I

Introduction to Data Warehousing: Overview, Difference between Database System and Data Warehouse, The
Compelling Need for data warehousing, Data warehouse – The building Blocks: Defining Features, data
warehouses and data marts, overview of the components, Three tier architecture, Metadata in the data
warehouse.
Data pre‐processing: Data cleaning, Data transformation ETL Process. ETL tools.
Defining the business requirements: Dimensional analysis, information packages – a new concept,
requirements gathering methods, requirements definition: scope and content.

UNIT‐II

Principles of Dimensional Modelling: Objectives, From Requirements to data design, Multi‐Dimensional Data
Model, Schemas: the STAR schema, the Snowflake schema, fact constellation schema.
OLAP in the Data Warehouse: Demand for Online Analytical Processing, limitations of other analysis methods‐
OLAP is the answer, OLAP definitions and rules, OLAP characteristics, major features and functions, hyper

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 677
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

cubes.
OLAP Operations: Drill‐down and roll‐up, slice‐and‐dice , pivot or rotation, OLAP models, overview of
variations, the MOLAP model, the ROLAP model, the DOLAP model, ROLAP versus MOLAP, OLAP
implementation considerations. Query and Reporting, Executive Information Systems (EIS), Data Warehouse
and Business Strategy.

UNIT‐III

Data Mining Basics: What is Data Mining, Data Mining Defined, The knowledge discovery process (KDD
Process), Data Mining Applications‐ The Business Context of Data Mining, Data Mining for Process
Improvement, Data Mining as a Research Tool, Data Mining for Marketing, Benefits of data mining,
Major Data Mining Techniques: Classification and Prediction: Issues Regarding Classification and Prediction,
Classification by Decision Tree Induction, KNN Algorithm.

UNIT ‐ IV

Cluster detection, K‐ means Algorithm, Outlier Analysis, memory‐based reasoning, link analysis, Mining
Association Rules in Large Databases: Association Rule Mining, genetic algorithms, neural networks.
Data mining tools.

Textbook(s):
1. Paul Raj Poonia, “Fundamentals of Data Warehousing”, John Wiley & Sons, 2004
2. Kamber and Han, “Data Mining Concepts and Techniques”, Hart Court India P. Ltd. Elsevier, 2nd Ed, 2001

References:
1. W. H. Inmon, “Building the operational data store”, 2nd Ed., John Wiley, 1999.
2. Pang‐ Ning Tan, Michael Steinbach, Viach, Vipin Kumar, Introduction to Data Mining, Pearson
3. Shmueli, “Data Mining for Business Intelligence : Concepts, Techniques and Applications in Microsoft Excel
with XLMiner”, Wiley Publications

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 678
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Data Warehousing and Data Mining Lab L P C

2 1

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE/CST 7 PCE PCE‐5 CIE‐425P

Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Data Warehousing and Data Mining) as
this is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.

1. Study of ETL process and its tools.

2. Program of Data warehouse cleansing to input names from users (inconsistent) and format them.
3. Program of Data warehouse cleansing to remove redundancy in data.
4. Introduction to WEKA tool.
5. Implementation of Classification technique on ARFF files using WEKA.
6. Implementation of Clustering technique on ARFF files using WEKA.
7. Implementation of Association Rule technique on ARFF files using WEKA.
8. Implementation of Visualization technique on ARFF files using WEKA.
9. Perform Data Similarity Measure (Euclidean, Manhattan Distance).
10. Perform Apriori algorithm to mine frequent item‐sets.
11. Develop different clustering algorithms like K‐Means, KMedoids Algorithm, Partitioning Algorithm and
Hierarchical
12. Apply Validity Measures to evaluate the quality of Data

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 679
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Distributed Systems and Cloud Computing L P C

3 3

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE/IT/CST/ITE 7 PCE PCE‐4 CIE‐407T

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto
5 sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. This course provides an insight into Distributed systems.
2. The course Discusses important paradigms in distributed systems
3. The course helps the students to understand process synchronization
4. The course tells about basics of cloud computing and cloud migration
Course Outcomes (CO)
CO 1 Select appropriate distributed system and inter process communication method
CO 2 Understand various process synchronization problems in distributed systems
CO 3 Create distributed file systems using Hadoop
CO 4 Choose appropriate cloud migration approach for the organization
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 2 2 3 ‐ 1 ‐ ‐ 1 ‐ 1
CO 2 3 3 3 3 1 ‐ ‐ 1 ‐ ‐ 1
CO 3 2 ‐ 3 2 3 ‐ ‐ ‐ 1 ‐ ‐ 1
CO 4 2 2 ‐ ‐ ‐ 2 2 ‐ ‐ ‐ ‐ 2

UNIT‐I

Introduction to Distributed Systems: Characteristics of Distributed Systems‐Introduction, Examples of

Distributed systems (Client server, peer to peer, grid and cloud computing), Advantages of distributed systems,
System models ‐Introduction, Architectural and Fundamental models, Networking and Internetworking,
Interposes Communication ( message passing and shared memory), Distributed objects and Remote Method
Invocation, RPC, Events and notifications, Case study‐Java RMI.

UNIT‐II

Synchronization: Time and Global States‐Introduction, Logical Clocks, Synchronizing physical clocks events and
Process states, Synchronizing physical clocks, logical time and logical clocks, global states, distributed
debugging, Coordination and Agreement: Distributed mutual exclusion, Elections, Multicast communication,
consensus and related problems.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 729
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

UNIT‐III

Distributed File Systems: Introduction – File Models – File accessing, sharing and caching – File Replication –
Atomic transactions Case Study HADOOP. : Resource and process management – Task assignment approach –
Load balancing approach – Load sharing approach

UNIT – IV

Cloud Computing, Roots of Cloud Computing, Layers and Types of Clouds, Desired Features of a Cloud, Cloud
Infrastructure Management, Infrastructure as a Service, Hardware as a service, platform as a Service, Software
as a service, Challenges and Risks. Migrating into a Cloud:‐Introduction, Broad Approaches to Migrating into
the Cloud, The Seven‐Step Model of Migration into a Cloud

Textbook(s):
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth Edition, Pearson
2. R. Buyya, CLOUD COMPUTING Principles and Paradigms, Willey
3. Distributed Systems, S.Ghosh, Chapman & Hall/CRC, Taylor & Francis Group, 2010.

References:
1. Distributed Systems – Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, Pearson Education.
2. Distributed Computing, Principles, Algorithms and Systems, Ajay D. Kshemakalyani and Mukesh Singhal,
Cambridge, rp 2010.
3. Gerard Tel, “Introduction to Distributed algorithms”, Cambridge University Press, USA, 2000.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 730
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Distributed Systems and Cloud Computing Lab L P C

2 1

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE/IT/CST/ITE 7 PCE PCE‐4 CIE‐407P

Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Distributed Systems and Cloud
Computing) as this is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.

1. Write a Program in Java to implement RPC

2. Implement the concept of Remote Method Invocation in Java.
3. Write a java program to implement Lamport’s Logical clock
4. Implement mutual exclusion service using Lamport’s Mutual Exclusion Algorithm
5. Install Hadoop on Windows
6. Run a simple application on single node Hadoop Cluster
7. Install Google App Engine and develop a simple web application.
8. Launch Web application using Google App Engine
9. Install Virtualbox / VMware Workstation with different flavours of linux on windows.
10. Simulate a cloud scenario using CloudSim and run a scheduling algorithm

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 731
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Exploratory Data Analytics and Data Visualization L P C

3 3

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐433T
EAE 7 DS‐EAE DS‐EAE‐5B DS‐433T

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto
5 sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. To understand the need for Data Mining and advantages to the business world.
2. To get a clear idea of various classes of Data Mining techniques, their need, scenarios (situations) and
scope of their applicability
3. To learn the algorithms used for various type of Data Mining problems
4. To understand how to explore and communicate data using data visualization techniques
Course Outcomes (CO)
CO 1 Describe the life cycle phases of Data Analytics through discovery, planning and building.
CO 2 Understand and apply Data Analysis Techniques.
CO 3 Implement various Data streams.
CO 4 Understand item sets, Clustering, frame works & Visualizations.
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 ‐ 1 2 ‐ 3 ‐ 2 3 ‐ 1 ‐ ‐
CO 2 ‐ 1 2 ‐ 3 ‐ 2 3 ‐ ‐ ‐ ‐
CO 3 ‐ 1 2 ‐ 2 ‐ 3 ‐ ‐ 1 ‐ ‐
CO 4 ‐ 2 2 ‐ 2 ‐ 2 ‐ ‐ ‐ ‐ ‐

UNIT‐I

Introduction to Data Analytics: Sources and nature of data, classification of data (structured, semi‐structured,
unstructured), characteristics of data, introduction to Big Data platform, need of data analytics, evolution of
analytic scalability, analytic process and tools, analysis vs reporting, modern data analytic tools, applications of
data analytics. Data Analytics Lifecycle: Need, key roles for successful analytic projects, various phases of data
analytics lifecycle – discovery, data preparation, model planning, model building, communicating results, and
operationalization.

UNIT‐II

Data Analysis: Regression modeling, multivariate analysis, Bayesian modeling, inference and Bayesian
networks, support vector and kernel methods, analysis of time series: linear systems analysis & nonlinear
dynamics, rule induction, neural networks: learning and generalisation, competitive learning, principal

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 812
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

component analysis and neural networks, fuzzy logic: extracting fuzzy models from data, fuzzy decision trees,
stochastic search methods.

UNIT‐III

Mining Data Streams: Introduction to streams concepts, stream data model and architecture, stream
computing, sampling data in a stream, filtering streams, counting distinct elements in a stream, estimating
moments, counting oneness in a window, decaying window, Real‐time Analytics Platform ( RTAP) applications,
Case studies – real time sentiment analysis, stock market predictions.

UNIT – IV

Introduction to Visualization and Stages – Computational Support – Issues – Different Types of Tasks – Data
representation – Limitation: Display Space‐ Rendering Time – Navigation Links. Human Vision – Space
Limitation – Time Limitations – Design – Exploration of Complex Information Space – Figure Caption in Visual
Interface – Visual Objects and Data Objects ‐Space Perception and Data in Space – Images, Narrative and
Gestures for Explanation.

Textbook(s):
1. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer.
2. Jiawei Han, Micheline Kamber “Data Mining Concepts and Techniques”, Second Edition, ElsevierRobert

References:
1. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets, Cambridge University Press.
2. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big Data Analytics”, John Wiley

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 813
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Exploratory Data Analytics and Data Visualization Lab L P C

2 1

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

CSE‐DS 7 PC PC DS‐433P
EAE 7 DS‐EAE DS‐EAE‐5B DS‐433P

Marking Scheme:
1. Teachers Continuous Evaluation: 40 marks
2. Term end Theory Examinations: 60 marks
Instructions:
1. The course objectives and course outcomes are identical to that of (Exploratory Data Analytics and Data
Visualization) as this is the practical component of the corresponding theory paper.
2. The practical list shall be notified by the teacher in the first week of the class commencement under
intimation to the office of the Head of Department / Institution in which the paper is being offered from
the list of practicals below. Atleast 10 experiments must be performed by the students, they may be asked
to do more. Atleast 5 experiments must be from the given list.

1. To get the input from user and perform numerical operations (MAX, MIN, AVG, SUM, SQRT, ROUND) using
in R.
2. To perform data import/export (.CSV, .XLS, .TXT) operations using data frames in R.
3. To get the input matrix from user and perform Matrix addition, subtraction, multiplication, inverse
transpose and division operations using vector concept in R
4. To perform statistical operations (Mean, Median, Mode and Standard deviation) using R
5. To perform data pre‐processing operations i) Handling Missing data ii) Min‐Max normalization.
6. To perform dimensionality reduction operation using PCA for Houses Data Set
7. To perform Simple Linear Regression with R..
8. To perform K‐Means clustering operation and visualize for iris data set
9. Learn how to collect data via web‐scraping, APIs and data connectors from suitable sources as specified by
the instructor.
10. Perform association analysis on a given dataset and evaluate its accuracy

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 814
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

Principles of Entrepreneurship Mindset L P C

2 2

Discipline(s) / EAE / OAE Semester Group Sub‐group Paper Code

All 7 HS/MS MS MS‐401

Marking Scheme:
1. Teachers Continuous Evaluation: 25 marks
2. Term end Theory Examinations: 75 marks
Instructions for paper setter:
1. There should be 9 questions in the term end examinations question paper.
2. The first (1st) question should be compulsory and cover the entire syllabus. This question should be
objective, single line answers or short answer type question of total 15 marks.
3. Apart from question 1 which is compulsory, rest of the paper shall consist of 4 units as per the syllabus.
Every unit shall have two questions covering the corresponding unit of the syllabus. However, the student
shall be asked to attempt only one of the two questions in the unit. Individual questions may contain upto 5
sub‐parts / sub‐questions. Each Unit shall have a marks weightage of 15.
4. The questions are to be framed keeping in view the learning outcomes of the course / paper. The standard
/ level of the questions to be asked should be at the level of the prescribed textbook.
5. The requirement of (scientific) calculators / log‐tables / data – tables may be specified if required.
Course Objectives :
1. To understand basic aspects of establishing a business in a competitive environment
2. To apply the basic understanding to examine the existing business ventures
3. To examine various business considerations such as marketing, financial and teaming etc.
4. To assess strategies for planning a business venture
Course Outcomes (CO)
CO 1 Understand basic aspects of establishing a business in a competitive environment
CO 2 Apply the basic understanding to examine the existing business ventures
CO 3 Examine various business considerations such as marketing, financial and teaming etc.
CO 4 Assessing strategies for planning a business venture
Course Outcomes (CO) to Programme Outcomes (PO) mapping (scale 1: low, 2: Medium, 3: High)
PO01 PO02 PO03 PO04 PO05 PO06 PO07 PO08 PO09 PO10 PO11 PO12
CO 1 2 2 1 2 ‐ 2 ‐ ‐ 1 2 3 2
CO 2 2 2 1 2 ‐ 2 ‐ ‐ 1 2 3 2
CO 3 2 2 1 2 ‐ 2 ‐ ‐ 1 2 3 2
CO 4 2 2 1 2 ‐ 2 ‐ ‐ 1 2 3 2

UNIT‐I

Entrepreneurial perspective: Foundation, Nature and development ofentrepreneurship, importance of

entrepreneurs,Entrepreneurial Mind, Individual entrepreneur Typesof entrepreneurs, Entrepreneurship in India

UNIT‐II

Beginning Considerations: Creativity and developing business ideas; Creatingand starting the venture; Building
a competitiveadvantage; Opportunity recognition, Opportunityassessment; Legal issues

UNIT‐III

Developing Financial Plans: Sources of Funds,Managing Cash Flow,Creating a successful Financial

PlanDeveloping a business plan

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 1240
 Handbook of B.Tech. Programmes offered by USICT at Affiliated Institutions of the University.

UNIT ‐ IV

Developing Marketing Plans: Developing a powerful Marketing Plan, E‐commerce,Integrated Marketing

Communications
Leading Considerations: Developing Team, Inviting candidates to join team,Leadership model

Textbook(s):
1. Robert D Hisrich, Michael P Peters & Dean A Shepherd, “Entrepreneurship” 10th Edition,McGraw Hill
Education, 2018

References:
1. Norman M. Scarborough and Jeffery R. cornwell, “Essentials of entrepreneurship and small business
management” 8th Edition, Pearson, 2016
2. Rajiv Roy, “Entrepreneurship”, 2nd Edition, Oxford University Press, 2011
3. Sangeeta Sharma, “Entrepreneurship Development”, 1st Edition, Prentice‐Hall India, 2016
4. John Mullins, “The New Business Road Test: What entrepreneurs and investors should dobefore launching a
lean start‐up” 5th Edition, Pearson Education, 2017
5. Charantimath, Entrepreneurship Development and Small Business Enterprise, Pearson Education.

Applicable from Batch Admitted in Academic Session 2021-22 Onwards Page 1241