BIG DATA ANALYTICS Semester 6

Course Code BAD601 CIE Marks 50

Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 8-10 Lab slots Total Marks 100
Credits 04 Exam Hours 3
Examination nature (SEE) Theory/practical
Course objectives:
1. To implement MapReduce programs for processing big data.
2. To realize storage and processing of big data using MongoDB, Pig, Hive and Spark.
3. To analyze big data using machine learning techniques.

Teaching-Learning Process (General Instructions)

These are sample Strategies; that teachers can use to accelerate the attainment of the various course outcomes.
1. Lecturer method (L) needs not to be only a traditional lecture method, but alternative effective teaching
methods could be adopted to attain the outcomes.
2. Use of Video/Animation to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes critical thinking.
5. Discuss how every concept can be applied to the real world - and when that's possible, it helps improve the
students' understanding.
6. Use any of these methods: Chalk and board, Active Learning, Case Studies.
MODULE-1
Classification of data, Characteristics, Evolution and definition of Big data, What is Big data, Why Big data,
Traditional Business Intelligence Vs Big Data,Typical data warehouse and Hadoop environment.
Big Data Analytics: What is Big data Analytics, Classification of Analytics, Importance of Big Data
Analytics, Technologies used in Big data Environments, Few Top Analytical Tools , NoSQL, Hadoop.

TB1: Ch 1: 1.1, Ch2: 2.1-2.5,2.7,2.9-2.11, Ch3: 3.2,3.5,3.8,3.12, Ch4: 4.1,4.2

MODULE-2
Introduction to Hadoop: Introducing hadoop, Why hadoop, Why not RDBMS, RDBMS Vs Hadoop, History
of Hadoop, Hadoop overview, Use case of Hadoop, HDFS (Hadoop Distributed File System),Processing data
with Hadoop, Managing resources and applications with Hadoop YARN(Yet Another Resource Negotiator).
Introduction to Map Reduce Programming: Introduction, Mapper, Reducer, Combiner, Partitioner,
Searching, Sorting, Compression.

TB1: Ch 5: 5.1-,5.8, 5.10-5.12, Ch 8: 8.1 - 8.8

MODULE-3
Introduction to MongoDB: What is MongoDB, Why MongoDB, Terms used in RDBMS and MongoDB, Data
Types in MongoDB, MongoDB Query Language.

TB1: Ch 6: 6.1-6.5
MODULE-4
Introduction to Hive: What is Hive, Hive Architecture, Hive data types, Hive file formats, Hive Query
Language (HQL), RC File implementation, User Defined Function (UDF).
Introduction to Pig: What is Pig, Anatomy of Pig, Pig on Hadoop, Pig Philosophy, Use case for Pig, 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 Function, Pig Vs Hive.

TB1: Ch 9: 9.1-9.6,9.8, Ch 10: 10.1 - 10.15, 10.22

MODULE-5
Spark and Big Data Analytics: Spark, Introduction to Data Analysis with Spark.

1
Text, Web Content and Link Analytics: Introduction, Text Mining, Web Mining, Web Content and Web
Usage Analytics, Page Rank, Structure of Web and Analyzing a Web Graph.
TB2: Ch5: 5.2,5.3, Ch 9: 9.1-9.4

PRACTICAL COMPONENT OF IPCC

Sl.NO Experiments (Java/Python/R)
1 Install Hadoop and Implement the following file management tasks in Hadoop:
Adding files and directories
Retrieving files
Deleting files and directories.
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.
2 Develop a MapReduce program to implement Matrix Multiplication
3 Develop a Map Reduce program that mines weather data and displays appropriate messages indicating
the weather conditions of the day.
4 Develop a MapReduce program to find the tags associated with each movie by analyzing movie lens
data.
5 Implement Functions: Count – Sort – Limit – Skip – Aggregate using MongoDB
6
Develop Pig Latin scripts to sort, group, join, project, and filter the data.
7 Use Hive to create, alter, and drop databases, tables, views, functions, and indexes.
8 Implement a word count program in Hadoop and Spark.
9 Use CDH (Cloudera Distribution for Hadoop) and HUE (Hadoop User Interface) to analyze data and
generate reports for sample datasets
Course outcomes (Course Skill Set):
At the end of the course, the student will be able to:

1. Identify and list various Big Data concepts, tools and applications.
2. Develop programs using HADOOP framework.
3. Make use of Hadoop Cluster to deploy Map Reduce jobs, PIG, HIVE and Spark programs.
4. Analyze the given data set and identify deep insights from the data set.
5. Demonstrate Text, Web Content and Link Analytics.

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the
SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures a minimum of 40% (40 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.

CIE for the theory component of the IPCC (maximum marks 50)
● IPCC means practical portion integrated with the theory of the course.
● CIE marks for the theory component are 25 marks and that for the practical component is 25
marks.
● 25 marks for the theory component are split into 15 marks for two Internal Assessment Tests (Two
Tests, each of 15 Marks with 01-hour duration, are to be conducted) and 10 marks for other

2
 assessment methods mentioned in 22OB4.2. The first test at the end of 40-50% coverage of the
syllabus and the second test after covering 85-90% of the syllabus.
● Scaled-down marks of the sum of two tests and other assessment methods will be CIE marks for the
theory component of IPCC (that is for 25 marks).
● The student has to secure 40% of 25 marks to qualify in the CIE of the theory component of IPCC.
CIE for the practical component of the IPCC
● 15 marks for the conduction of the experiment and preparation of laboratory record, and 10 marks
for the test to be conducted after the completion of all the laboratory sessions.
● On completion of every experiment/program in the laboratory, the students shall be evaluated
including viva-voce and marks shall be awarded on the same day.
● The CIE marks awarded in the case of the Practical component shall be based on the continuous
evaluation of the laboratory report. Each experiment report can be evaluated for 10 marks. Marks of
all experiments’ write-ups are added and scaled down to 15 marks.
● The laboratory test (duration 02/03 hours) after completion of all the experiments shall be
conducted for 50 marks and scaled down to 10 marks.
● Scaled-down marks of write-up evaluations and tests added will be CIE marks for the laboratory
component of IPCC for 25 marks.
● The student has to secure 40% of 25 marks to qualify in the CIE of the practical component of the IPCC.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored by the student shall be proportionally scaled down to 50 Marks
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion will have
a CIE component only. Questions mentioned in the SEE paper may include questions from the
practical component.
Suggested Learning Resources:
Books:
1. Seema Acharya and Subhashini Chellappan “Big data and Analytics” Wiley India Publishers, 2nd Edition,
2019.
2. Rajkamal and Preeti Saxena, “Big Data Analytics, Introduction to Hadoop, Spark and Machine Learning”,
McGraw Hill Publication, 2019.
Reference Books:
1. Adam Shook and Donald Mine, “MapReduce Design Patterns: Building Effective Algorithms and Analytics for
Hadoop and Other Systems” - O'Reilly 2012
2. Tom White, “Hadoop: The Definitive Guide” 4th Edition, O’reilly Media, 2015.
3. Thomas Erl, Wajid Khattak, and Paul Buhler, Big Data Fundamentals: Concepts, Drivers & Techniques,
Pearson India Education Service Pvt. Ltd., 1st Edition, 2016
4. John D. Kelleher, Brian Mac Namee, Aoife D'Arcy -Fundamentals of Machine Learning for Predictive Data
Analytics: Algorithms, Worked Examples, MIT Press 2020, 2nd Edition

3
Web links and Video Lectures (e-Resources):
● https://www.kaggle.com/datasets/grouplens/movielens-20m-dataset
● https://www.youtube.com/watch?v=bAyrObl7TYE&list=PLEiEAq2VkUUJqp1k-g5W1mo37urJQOdCZ
● https://www.youtube.com/watch?v=VmO0QgPCbZY&list=PLEiEAq2VkUUJqp1kg5W1mo37urJQOdCZ&in
dex=4
● https://www.youtube.com/watch?v=GG-VRm6XnNk https://www.youtube.com/watch?v=JglO2Nv_92A

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

1. Implement MongoDB based application to store big data for data processing and analyzing the results [10
marks]

4
 Annexure-II 1

MACHINE LEARNING Semester 6

Course Code BCS602 CIE Marks 50
Teaching Hours/Week (L: T:P: S) 4:0:0:0 SEE Marks 50
Total Hours of Pedagogy 50 Total Marks 100
Credits 04 Exam Hours 03
Examination type (SEE) Theory
Course objectives:
● To introduce the fundamental concepts and techniques of machine learning.
● To understanding of various types of machine learning and the challenges faced in real-
world applications.
● To familiarize the machine learning algorithms such as regression, decision trees,
Bayesian models, clustering, and neural networks.
● To explore advanced concept like reinforcement learning and provide practical insight
into its applications.
● To enable students to model and evaluate machine learning solutions for different types
of problems.

Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) needs not to be only a traditional lecture method, but alternative effective
teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation/Demonstration to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes critical
thinking.
5. Adopt Problem/Practical Based Learning (PBL), which fosters students’ Analytical skills, develop
design thinking skills, and practical skill such as the ability to design, evaluate, generalize, and
analyze information rather than simply recall it.
6. Use animations/videos to help the students to understand the concepts.
7. Demonstrate the concepts using PYTHON and its libraries wherever possible

Module-1
Introduction: Need for Machine Learning, Machine Learning Explained, Machine Learning in Relation
to other Fields, Types of Machine Learning, Challenges of Machine Learning, Machine Learning Process,
Machine Learning Applications.

Understanding Data – 1: Introduction, Big Data Analysis Framework, Descriptive Statistics, Univariate
Data Analysis and Visualization.

Chapter-1, 2 (2.1-2.5)
Module-2
Understanding Data – 2: Bivariate Data and Multivariate Data, Multivariate Statistics, Essential
Mathematics for Multivariate Data, Feature Engineering and Dimensionality Reduction Techniques.

Basic Learning Theory: Design of Learning System, Introduction to Concept of Learning, Modelling in
Machine Learning.

Chapter-2 (2.6-2.8, 2.10), Chapter-3 (3.3, 3.4, 3.6)

Module-3

1
 Annexure-II 2

Similarity-based Learning: Nearest-Neighbor Learning, Weighted K-Nearest-Neighbor Algorithm,

Nearest Centroid Classifier, Locally Weighted Regression (LWR).

Regression Analysis: Introduction to Regression, Introduction to Linear Regression, Multiple Linear

Regression, Polynomial Regression, Logistic Regression.

Decision Tree Learning: Introduction to Decision Tree Learning Model, Decision Tree Induction
Algorithms.

Chapter-4 (4.2-4.5), Chapter-5 (5.1-5.3, 5.5-5.7), Chapter-6 (6.1, 6.2)

Module-4
Bayesian Learning: Introduction to Probability-based Learning, Fundamentals of Bayes Theorem,
Classification Using Bayes Model, Naïve Bayes Algorithm for Continuous Attributes.

Artificial Neural Networks: Introduction, Biological Neurons, Artificial Neurons, Perceptron and Learning
Theory, Types of Artificial Neural Networks, Popular Applications of Artificial Neural Networks,
Advantages and Disadvantages of ANN, Challenges of ANN.

Chapter-8 (8.1-8.4), Chapter-10 (10.1-10.5, 10.9-10.11)

Module-5
Clustering Algorithms: Introduction to Clustering Approaches, Proximity Measures, Hierarchical
Clustering Algorithms, Partitional Clustering Algorithm, Density-based Methods, Grid-based Approach.

Reinforcement Learning: Overview of Reinforcement Learning, Scope of Reinforcement Learning,

Reinforcement Learning as Machine Learning, Components of Reinforcement Learning, Markov Decision
Process, Multi-Arm Bandit Problem and Reinforcement Problem Types, Model-based Learning, Model Free
Methods, Q-Learning, SARSA Learning.

Chapter -13 (13.1-13.6), Chapter-14 (14-1-14.10)

Course outcome (Course Skill Set)
At the end of the course, the student will be able to :
1. Describe the machine learning techniques, their types and data analysis framework.
2. Apply mathematical concepts for feature engineering and perform dimensionality reduction to enhance
model performance.
3. Develop similarity-based learning models and regression models for solving classification and
prediction tasks.
4. Build probabilistic learning models and design neural network models using perceptrons and multilayer
architectures
5. Utilize clustering algorithms to identify patterns in data and implement reinforcement learning
techniques

2
 Annexure-II 3

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is
50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50)
and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A
student shall be deemed to have satisfied the academic requirements and earned the credits allotted
to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in the sum
total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination) taken
together.

Continuous Internal Evaluation:

● For the Assignment component of the CIE, there are 25 marks and for the Internal Assessment
Test component, there are 25 marks.
● The first test will be administered after 40-50% of the syllabus has been covered, and the second
test will be administered after 85-90% of the syllabus has been covered
● Any two assignment methods mentioned in the 22OB2.4, if an assignment is project-based
then only one assignment for the course shall be planned. The teacher should not conduct two
assignments at the end of the semester if two assignments are planned.
● For the course, CIE marks will be based on a scaled-down sum of two tests and other methods
of assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’s taxonomy
as per the outcome defined for the course.

Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers for
the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a maximum
of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.

Suggested Learning Resources:

Books
1. S Sridhar, M Vijayalakshmi, “Machine Learning”, OXFORD University Press 2021, First Edition.

Reference Books

1. Murty, M. N., and V. S. Ananthanarayana. Machine Learning: Theory and Practice, Universities Press,
2024.
2. T. M. Mitchell, “Machine Learning”, McGraw Hill, 1997.
3. Burkov, Andriy. The hundred-page machine learning book. Vol. 1. Quebec City, QC, Canada: Andriy
Burkov, 2019.

Web links and Video Lectures (e-Resources):

● https://www.universitiespress.com/resources?id=9789393330697
● https://www.drssridhar.com/?page_id=1053
● Machine Learning Tutorials: https://www.geeksforgeeks.org/machine-learning/
● Machine Learning Tutorials: https://www.tutorialspoint.com/machine_learning/index.htm
● Python for Machine Learning: https://www.w3schools.com/python/python_ml_getting_started.asp
● Introduction to Machine Learning: https://onlinecourses.nptel.ac.in/noc22_cs29/preview

3
 Annexure-II 4

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

● Practical Assignment: Implementation of Practical Exercises Chapter 2: Q1-Q4, Chapter 3: Q1,

Chapter-4: Q1, Chapter-7: Q1, Chapter-8: Q1 - 10 Marks.
(Note: Refer to Reference book 1 for programming assignments
https://www.universitiespress.com/resources?id=9789393330697)
● Course project: By considering suitable machine learning-based real-world application problem [15
Marks]

4
 Annexure-II 1

Blockchain Technology Semester 6

Course Code BCS613A CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination type (SEE) Theory
Course objectives:
● To Understand Blockchain terminologies with its applications. design
● To learn working principles of Blockchain and methodologies used in Bitcoin
● To gain knowledge on Ethereum Network, Wallets, Nodes, Smart contract & DApps
● To learn blockchain Based Application Architecture using Hyperledger and the Smart
Contract Lifecycle

Teaching-Learning Process (General Instructions)

These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Lecturer method (L) needs not to be only a traditional lecture method, but alternative effective
teaching methods could be adopted to attain the outcomes.
2. Use of Video/Animation/Demonstration to explain functioning of various concepts.
3. Encourage collaborative (Group Learning) Learning in the class.
4. Ask at least three HOT (Higher order Thinking) questions in the class, which promotes critical
thinking.
5. Adopt Problem Based Learning (PBL), which fosters students’ Analytical skills, develop design
thinking skills such as the ability to design, evaluate, generalize, and analyze information rather
than simply recall it.
6. Use animations/videos to help the students to understand the concepts.

Module-1
Distributed systems, CAP theorem, Byzantine Generals problem, Consensus. The history of blockchain,
Introduction to blockchain, Various technical definitions of blockchains, Generic elements of a
blockchain, Features of a blockchain, Applications of blockchain technology, Tiers of blockchain
technology, Consensus in blockchain, CAP theorem and blockchain, Benefits and limitations of
blockchain.

Chapter 1
Module-2
Decentralization using blockchain, Methods of decentralization, Blockchain and full ecosystem
decentralization, Smart contract, Decentralized organizations, Decentralized autonomous
organizations, Decentralized autonomous corporations, Decentralized autonomous societies
Decentralized applications, Platforms for decentralization.
Cryptographic primitives: Symmetric cryptography, Asymmetric cryptography, Public and private keys,
Hash functions: Compression of arbitrary messages into fixed length digest, Easy to compute, Pre-image
resistance, Second pre-image resistance, Collision resistance, Message Digest (MD),Secure Hash
Algorithms (SHAs), Merkle trees, Patricia trees, Distributed hash tables (DHTs), Digital signatures,
Elliptic Curve Digital signature algorithm (ECDSA).

Chapter 2, Chapter 3: pg:56-105

Module-3

1
 Annexure-II 2

Bitcoin, Bitcoin definition, Transactions, The transaction life cycle, The transaction structure,
Types of transaction, The structure of a block , The structure of a block header, The genesis
block, The bitcoin network, Wallets, Smart Contracts-History, Definition, Ricardian contracts,
Smart contract templates, Oracles, Smart Oracles, Deploying smart contracts on a blockchain,
The DAO.

Chapter 4:pg:111-148, Chapter 6

Module-4
Ethereum 101, Introduction, Ethereum clients and releases, The Ethereum stack, Ethereum blockchain,
Currency (ETH and ETC), Forks, Gas, The consensus mechanism, The world state, Transactions, Contract
creation transaction, Message call transaction, Elements of the Ethereum blockchain , Ethereum virtual
machine (EVM), Accounts, Block, Ether, Messages, Mining, The Ethereum network.
Hands-on: Clients and wallets –Geth.

Chapter 7: pg: 210-227, 235-269

Module-5
Hyperledger, Hyperledger as a protocol, Fabric, Hyperledger Fabric, Sawtooth lake, Corda.

Chapter 9
Course outcomes (Course Skill Set)
At the end of the course, the student will be able to :
1. Explain the Blockchain terminologies with its applications. design
2. Illustrate the working principles of Blockchain and the Smart Contract Lifecycle
3. Demonstrate the principles and methodologies used in Bitcoin
4. Develop Ethereum Network, Wallets, Nodes, Smart contract and DApps.
5. Make use of Hyperledger in Blockchain Based Application Architecture.

2
 Annexure-II 3

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE)
is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of
50) and for the SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A
student shall be deemed to have satisfied the academic requirements and earned the credits
allotted to each subject/ course if the student secures a minimum of 40% (40 marks out of 100) in
the sum total of the CIE (Continuous Internal Evaluation) and SEE (Semester End Examination)
taken together.

Continuous Internal Evaluation:

● For the Assignment component of the CIE, there are 25 marks and for the Internal Assessment
Test component, there are 25 marks.
● The first test will be administered after 40-50% of the syllabus has been covered, and the
second test will be administered after 85-90% of the syllabus has been covered
● Any two assignment methods mentioned in the 22OB2.4, if an assignment is project-based
then only one assignment for the course shall be planned. The teacher should not conduct
two assignments at the end of the semester if two assignments are planned.
● For the course, CIE marks will be based on a scaled-down sum of two tests and other methods
of assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’s
taxonomy as per the outcome defined for the course.

Semester-End Examination:
Theory SEE will be conducted by University as per the scheduled timetable, with common question papers
for the course (duration 03 hours).
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module (with a
maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored shall be proportionally reduced to 50 marks.

Suggested Learning Resources:

Books
1. Imran Bashir. “Mastring BlockChain”, Third Edition, Packt – 2020.

Reference Book

1. Andreas M. , Mastering Bitcoin: Programming the Open Blockchain – O’rielly – 2017.

Web links and Video Lectures (e-Resources):

● https://nptel.ac.in/courses/106104220
● https://www.geeksforgeeks.org/blockchain/
● https://www.tutorialspoint.com/blockchain/index.htm

Activity Based Learning (Suggested Activities in Class)/ Practical Based learning

● Course Project: Covers the implementation of the major concepts outlined in the syllabus– 25
Marks

3
 TIME SERIES ANALYSIS Semester 6
Course Code BAI613D CIE Marks 50
Teaching Hours/Week (L: T:P: S) 3:0:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 03
Examination type (SEE) Theory

Course objectives:
● Learn the importance of time series analysis on the data.
● Identify approaches to handle linear stationary and non stationary models.
● Analyse ways of model building and parameter estimation.
● Recognize methods to handle multivariate time series data.
Teaching-Learning Process (General Instructions)

These are sample strategies; which teachers can use to accelerate the attainment of the various
course outcomes.
1. Lecturer method (L) does not mean only the traditional lecture method, but different
types of teaching methods may be adopted to achieve the outcomes.
2. Utilize video/animation films to illustrate the functioning of various concepts.
3. Promote collaborative learning (Group Learning) in the class.
4. Pose at least three HOT (Higher Order Thinking) questions in the class to stimulate
critical thinking.
5. Incorporate Problem-Based Learning (PBL) to foster students' analytical skills and
develop their ability to evaluate, generalize, and analyze information rather than
merely recalling it.
6. Introduce topics through multiple representations.
7. Demonstrate various ways to solve the same problem and encourage students to
devise their own creative solutions.
8. Discuss the real-world applications of every concept to enhance students'
comprehension.
9. Use any of these methods: Chalk and board, Active Learning, Case Studies.

Module-1
Introduction, Five Important Practical Problems, Autocorrelation Function and Spectrum
of Stationary Processes: Autocorrelation Properties of Stationary Models, Spectral
Properties of Stationary Models, Linear Stationary Models: General Linear Process,
Autoregressive Processes, Moving Average Processes, Mixed Autoregressive--Moving
Average Processes.
Ch. 1.1, Ch. 2.1,2.2 Ch. 3.1,3.2,3.3,3.4

Module-2
Linear Nonstationary Models: Autoregressive Integrated Moving Average Processes,
Three Explicit Forms for the ARIMA Model, Integrated Moving Average Processes.
Forecasting : Minimum Mean Square Error Forecasts and Their Properties, Calculating
Forecasts and Probability Limits, Examples of Forecast Functions and Their Updating, Use
of State-Space Model Formulation for Exact Forecasting
Ch. 4.1,4.2,4.3, Ch. 5.1,5.2,5.3,5.4,5.5.

1
TEMPLATE for AEC (if the course is a theory) Annexure-IV

MOBILE APPLICATION DEVELOPMENT Semester 6

Course Code BIS654C CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:0 SEE Marks 50
Total Hours of Pedagogy 40 Total Marks 100
Credits 03 Exam Hours 3
Examination type (SEE) Theory
Course objectives:
Create, test and debug Android application by setting up Android development
environment.
Implement adaptive, responsive user interfaces that work across a wide range of
devices.
Infer long running tasks and background work in Android applications
Demonstrate methods in storing, sharing and retrieving data in Android
applications
Analyze performance of android applications
Describe the steps involved in publishing Android application to share with the
world.
Teaching-Learning Process (General Instructions)
These are sample Strategies, which teachers can use to accelerate the attainment of the various course
outcomes.
1. Chalk and board, power point presentations
2. Online material (Tutorials) and video lectures.
3. Demonstration of setup Android application development environment &
programing examples.
4. Illustrate user interfaces for interacting with apps and triggering actions
Module-1
Introduction to Android OS: Android Description – Open Handset Alliance – Android.
Ecosystem – Android versions – Android Activity – Features of Android – Android
Architecture Stack Linux Kernel. Configuration of Android Environment: Operating
System – Java JDK Android SDK – Android Development Tools (ADT) – Android Virtual
Devices (AVDs) – Emulators Dalvik Virtual Machine – Differences between JVM and
DVM – Steps to Install and Configure Eclipse and SDK.

(Chapters 1 & 2)
Module-2
Create the first android application: Directory Structure. Android User Interface:
Understanding the Components of a screen– Linear Layout – Absolute Layout – Frame.
Layout Relative Layout – Table Layout.

(Chapters 3 & 4)
Module-3

1
TEMPLATE for AEC (if the course is a theory) Annexure-IV

Designing User Interface with View – Text View – Button – Image Button – Edit Text
Check Box – Toggle Button – Radio Button and Radio Group – Progress Bar – Auto
complete Text View – Spinner – List View – Grid View – Image View - Scroll View –
Custom Toast – Alert – Time and Date Picker.

(Chapter 5)
Module-4
Activity: Introduction – Intent – Intent filter – Activity life cycle – Broadcast life cycle
Service. Multimedia: Android System Architecture – Play Audio and Video – Text to
Speech.

(Chapters 6 & 7)
Module-5
SQLite Database in Android: SQLite Database – Creation and Connection of the database –
Transactions. Case Study: SMS Telephony and Location Based Services.

(Chapters 8, 9, & 10)

Course outcome (Course Skill Set)
At the end of the course the student will be able to:

1. Explain Mobile Application Ecosystem like concepts, architecture, and lifecycle of

mobile applications on Android
2. Identify the key components of mobile application frameworks and development
tools.
3. Apply design principles to create intuitive and responsive user interfaces using
appropriate UI/UX tools.
4. Develop Functional Mobile Applications -Integrate core functionalities such as
layouts, event handling, navigation, and multimedia support into applications.
5. Implement local data storage mechanisms (SQLite, Shared Preferences) and external
databases (Firebase, APIs) for mobile applications.

2
TEMPLATE for AEC (if the course is a theory) Annexure-IV

Assessment Details (both CIE and SEE)

The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam
(SEE) is 50%. The minimum passing mark for the CIE is 40% of the maximum marks (20
marks out of 50) and for the SEE minimum passing mark is 35% of the maximum marks (18
out of 50 marks). A student shall be deemed to have satisfied the academic requirements and
earned the credits allotted to each subject/ course if the student secures a minimum of 40%
(40 marks out of 100) in the sum total of the CIE (Continuous Internal Evaluation) and SEE
(Semester End Examination) taken together.

Continuous internal Examination (CIE)

● For the Assignment component of the CIE, there are 25 marks and for the Internal
Assessment Test component, there are 25 marks.
● The first test will be administered after 40-50% of the syllabus has been covered, and
the second test will be administered after 85-90% of the syllabus has been covered
● Any two assignment methods mentioned in the 22OB2.4, if an assignment is project-
based then only one assignment for the course shall be planned. The teacher should
not conduct two assignments at the end of the semester if two assignments are
planned.
● For the course, CIE marks will be based on a scaled-down sum of two tests and other
methods of assessment.
Internal Assessment Test question paper is designed to attain the different levels of Bloom’s
taxonomy as per the outcome defined for the course.

Semester End Examinations (SEE)

SEE paper shall be set for 50 questions, each of the 01 marks. The pattern of the question paper is
MCQ (multiple choice questions). The time allotted for SEE is 01 hour. The student has to secure a
minimum of 35% of the maximum marks meant for SEE.
OR
MCQ (Multiple Choice Questions) are preferred for 01 credit courses, however, if course content
demands the general question paper pattern that followed for 03 credit course, then
1. The question paper will have ten questions. Each question is set for 10 marks.
2. There will be 2 questions from each module. Each of the two questions under a module may or
may not have the sub-questions (with maximum sub-questions of 02, with marks distributions
5+5, 4+6, 3+7).
3. The students have to answer 5 full questions, selecting one full question from each module.
Suggested Learning Resources:
Books
1. TEXT BOOK 1. Prasanna Kumar Dixit, "Android", Vikas Publishing House Private Ltd.,
Noida, 2014.
2. REFERENCE BOOKS
1. Reto Meier and Wrox Wiley, “Professional Android 4 Application Development”, 2012.
2. ZiguradMednieks, LaridDornin, G.BlakeMeike, Masumi Nakamura, “Programming
Andriod”, O’Reilly,2013.
3. Robert Green, Mario Zechner, “Beginning Android 4 Games Development”, Apress Media
LLC, New York, 2011

Web links and Video Lectures (e-Resources):

3
TEMPLATE for AEC (if the course is a theory) Annexure-IV

● .https://www.geeksforgeeks.org/android-tutorial/
● https://developer.android.com/
● https://www.tutorialspoint.com/android
● https://www.w3schools.blog/android-tutorial

Activity Based Learning (Suggested Activities in Class)/Practical-Based

Learning:
1. Programming exercises, fostering the practical application of theoretical
concepts. [ 25 marks]