B.M.S.

College of Engineering, Bengaluru – 19

(Autonomous Institute, Affiliated to VTU | Approved by AICTE)
Scheme of Instructions Semester – V (With effect from the Academic Year 2021-22: admitted batches and onwards)
Teaching Hours
in Credits/Week Examination

Total Credits
Practical

Duration in
Tutorial
Lecture

Total Marks
Theory

CIE Marks

SEE Marks
Course Course Title

hours
Sl. # Course Code
Type

L T P
1. PC-9 23AM5PCSED Software Engineering & Design Patterns 3 0 0 3 03 50 50 100
2. PC-10 23AM5PCOOP Object Oriented Through Python 3 0 1 4 05 50 50 100
3. PC-11 23AM5PCIML Introduction to Machine Learning 2 0 1 3 04 50 50 100
4. PC-12 23AM5PCINN Introduction to Neural Networks 2 0 1 3 04 50 50 100
5. HS-6 23AM5HSCSM Calculus and Statistics for Machine Intelligence 2 0 1 3 04 50 50 100
23AM5PEABI AI in Business Intelligence
23AM5PEKDI Knowledge Discovery 3 0 0 3 03 50 50 100
6. PE-1
23AM5PEDIP Digital Image Processing
7. AE-6 23AM5AEDVA Data visualization and Analysis 2 0 1 3 04 50 50 100
8. NCMC-3 23AM5NCCSE Communication Skills Enhancement Non-credit mandatory Course 01 - - -
Total 17 0 5 22 28 350 350 700
Note: HS: Humanities and Social Sciences/Management Course, PC: Professional Core Course, PE: Professional Elective Course, AE: Ability Enhancement Course;
NC: Non-credit mandatory course
Course Title Software Engineering and Design Patterns
Course Code 23AM5PCSED Credits 3 L-T-P 3-0-0
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 3 Total Lecture Hours 36

UNIT – 1 7 Hours
Overview of Software Engineering: Nature of Software, Application Domains, Software
Engineering, Software Process & Principles.
Process Models: Waterfall, V-Model, Iterative, Spiral, Agile Development, Scrum. Modeling
Requirements: Requirements Engineering, Requirement Elicitation, SRS Document, Functional and
Non-Functional Requirements, Software Quality Assurance: Quality Standards Models ISO.
UNIT – 2 8 Hours
Software Metrics: Size-Oriented Metrics, Halsted Metrics, Cyclomatic Complexity Metrics.
Software Modelling: Unified Modeling Language, Use Cases, Class, Sequence, Activity, State Diagrams.
Software Design: Software Quality Guidelines and Design Principles, Design concepts and principles –
Abstraction – Modularity, Types of Cohesion and Coupling, Functional Independence,
Case study- Six-Sigma
UNIT – 3 6 Hours
Software Testing: Verification and Validation, Unit Testing, Integration Testing, Testing Strategies for
Web Apps. White Box-Testing: Basis Path Testing, Flow Graph Notation, Graph Matrices, Control Flow
Testing, Black Box Testing: Graph Based Testing, Equivalence Partitioning, Boundary Value Analysis.
UNIT – 4 8 Hours
Patterns: What is a Pattern? What Makes a Pattern? Relationships between Patterns.
Architectural Patterns: Introduction, From Mud to Structure, Layers, Pipes and Filters. Distributed
Systems: Broker.
Interactive Systems: Model-View-Controller, Presentation-Abstraction-Control. Adaptable Systems:
Microkernel.
UNIT – 5 7 Hours
Design Patterns: Introduction, Structural Patterns-Adapter, Bridge, Composite, Decorator, Facade,
Proxy
Text Books:
1. Software engineering: a practitioner’s approach, Roger S. Pressman, Palgrave macmillan, 7th
Edition, 2017.
2. Pattern-Oriented Software Architecture A System of Patterns, Frank Buschmann, Regine
Meunier, Hans Rohnert, Peter Sommerlad and Michael Stal, Volume 1, Wiley series in
Software Design Patterns, 1996.

Reference Books:
1. The Essentials of Modern Software Engineering: Free the Practices from the Method, Prisons, Ivar
Jacobson, Harold “Bud” Lawson, Pan-Wei Ng, Paul E. McMahon and Michael Goedicke, 1st Edition,
2019.
2. Software Engineering, Sommerville, I., Pearson Education Limited, 10th Edition, 2017.
3. 3. Design Patterns: Elements of Reusable Object-Oriented Software, Erich Gamma, Richard Helm,
Ralph Johnson, John Vlissides, Addison-Wesley, 1995.
Course Outcomes
To provide the idea of decomposing the given problem into Analysis using models,
CO1
Implementation, testing and Maintenance phases.
To gain the knowledge on design modelling, metrics and patterns of software design.
CO2
comprehending a design presented using this vocabulary.
Apply core design principles and be able to assess the quality of a design with respect to these
CO3 principles.
Course Title OBJECT ORIENTED PROGRAMMING
Course Code 23AM5PCOOP Credits 4 L-T-P 3-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 3 Total Lecture Hours 36

UNIT – 1 6 Hours
Introduction: The Concepts of Abstract Machine and Interpreter, Influences on language
design, Implementation methods, Programming environments, Language categories and
examples.
Modeling physical objects with object programming: Procedural Python examples,
OOP principles, classes, objects and instantiation.
UNIT – 2 7 Hours
Functions: Defining functions in classes, Calling functions in classes, Attributes, Passing
Arguments to a Method, Creating multiple instances, Initializing parameters.

Encapsulation: Encapsulations with functions, Encapsulations with objects, Making

Instance Variables More Private.
UNIT – 3 8 Hours
Abstraction: Abstract base classes, Creation of abstract base class.

Inheritance: Extending built-ins, overriding and super keyword, Multiple Inheritance,

Diamond problem, Real-World Examples of Inheritance.
UNIT – 4 7 Hours
Polymorphism: Sending messages to objects, Pygame shapes, Polymorphism in
pywidgets, Polymorphism for operators, Magic methods.

Better error handling with Exceptions in python: Try and except, Raise statement and
custom exceptions.
UNIT – 5 8 Hours
Managing Memory used by objects: Object lifetime, Reference count, Garbage
collection, Class variables and constants, Managing memory slots.

Concurrency: Threads, Multithreading, Multiprocessing.

Timers in python: Approaches for implementing timers, Displaying time.

Text Books:
1. Programming Languages: Principles and Paradigms, springer, Maurizio
Gabbrielli, Simone Martini, 2023.

2. Python 3 object-oriented programming, Second edition, Dusty Phillips, 2015.

Reference Books:
1. Object oriented python, Irv Kalb, 2022.
2. Concepts of programming languages, Tenth Edition, Robert W. Sebesta, 2012.
Course Outcomes
Design various methodology for organizing data and solving basic programming challenges
CO1
using Linear Data Structures.
Apply the concepts of Linear Data Structures and Recursive techniques to handle problems in
CO2
real time applications through programming.
CO3 Analyze and implement application based real time solutions using Non-linear Data structures.
 Course Title Introduction to Machine Learning
Course Code 23AM5PCIML Credits 3 L-T-P 2-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 2 Total Lecture Hours 26

UNIT – 1 5 Hours
Introduction: What Is Machine Learning (ML)? Uses and Applications with examples, Types
of Machine Learning, Main Challenges, Testing and Validating.
Well posed learning problems, Designing a Learning system, Perspectives and Issues in
Machine learning.
Concept Learning: Concept learning task, search, Find-S algorithm, Version space,
Candidate Elimination algorithm, Inductive Bias.
UNIT – 2 5 Hours
Supervised Machine Learning: Decision Trees: Introduction, Decision Tree
Representation, Appropriate Problems for decision Tree Algorithm, Hypothesis Space
Search, Inductive Bias in Decision Tree Learning, Issues.
Instance- Based Learning: Introduction, Support Vector Machines: Linear and Non-
Linear, Kernel Functions, k- Nearest Neighbor Learning, Locally Weighted Regression.
UNIT – 3 6 Hours
Supervised Learning Techniques: Bayesian Learning: Concept Learning – Maximum
Likelihood – Minimum Description Length Principle – Bayes Optimal Classifier – Naïve Bayes
Classifier– example-Bayesian Belief Network – EM Algorithm.
Ensemble and Probabilistic Learning Model: Voting classifiers, Bagging and pasting,
Random patches, Random forests, Boosting, stacking.
UNIT – 4 5 Hours
Unsupervised Machine Learning: Clustering – K means, Spectral, Hierarchical, Association
rule mining, Anomaly detection.
UNIT – 5 5 Hours
Unsupervised Learning Techniques: Dimensionality Reduction: The Curse of
Dimensionality, Main Approaches for Dimensionality, PCA, Kernel PCA, LLE, Linear Discriminant
Analysis (LDA).
Text Books:
1. Tom Mitchell, “Machine Learning”, McGraw Hill, 3rdEdition, 1997.
2. Introduction to Machine Learning with Python, A Guide for Data Scientists,
Andreas C. Miller and Sarah Guido, O’Reilly Media, 2017.
3. Ethem Alpaydın, Introduction to machine learning, third edition, MIT press.
Reference Books:
1. MACHINE LEARNING - An Algorithmic Perspective, Second Edition, Stephen
Marsland, 2015.
2. Hands-on machine learning with Scikit-Learn and TensorFlow: concepts, tools, and
techniques to build intelligent systems, Aurelien Geron, O'Reilly Media, 2019.
Course Outcomes
CO1 Identify the problems for machine learning and select either supervised or
unsupervised learning.
CO2 Illustrate the working of different ML Algorithms.
CO3 Demonstrate the applications of AI and ML.
Course Title INTRODUCTION TO NEURAL NETWORKS
Course Code 23AM5PCINN Credits 3 L-T-P 2-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours /Week 4 Total Lecture Hours 26

UNIT – 1 5Hours
Introduction: What is a Neural Network? , Models of a Neuron , Neural Networks Viewed
As Directed Graphs, Feedback, Network Architectures, Knowledge Representation.
Rosenblatt’s Perceptron: Introduction, Perceptron , The Perceptron Convergence
Theorem , Relation Between the Perceptron and Bayes Classifier for a Gaussian ,The Batch
Perceptron Algorithm, Filtering structure of the LMS Algorithm, Unconstrained
Optimization: a Review.
UNIT – 2 6 Hours
Multilayer Perceptron’s-1 : Introduction , Some Preliminaries , Batch Learning and On-
Line Learning, The Back-Propagation Algorithm , XOR Problem , Heuristics for Making the
Back-Propagation Algorithm Perform Better, Back Propagation and Differentiation, The
Hessian and Its Role in On-Line Learning, Optimal Annealing and Adaptive Control of the
Learning Rate.
UNIT – 3 5 Hours
Multilayer Perceptron’s-2 :Generalization Approximations of Functions, Cross-
Validation, Complexity Regularization and Network Pruning, Virtues and Limitations of
Back-Propagation Learning, Supervised Learning Viewed as an Optimization Problem.
UNIT – 4 5 Hours
Radial-Basis Function Networks: Introduction , Cover’s Theorem on the Separability of
Patterns , The Interpolation Problem , Radial-Basis-Function Networks, Recursive Least-
Squares Estimation of the Weight Vector, Hybrid Learning Procedure for RBF Networks.

UNIT – 5 5 Hours
Self-Organizing Maps : Introduction ,Two Basic Feature-Mapping Models , Self-
Organizing Map , Properties of the Feature Map, Contextual Maps ,Hierarchical Vector
Quantization, Kernel Self-Organizing Map, Relationship Between Kernel SOM and
Kullback–Leibler Divergence.
Text Books:
1. Neural Networks and Learning Machines, Simon Haykin, PHI, 3rd Edition, 2016.

Reference Books:
1. Neural Networks a Comprehensive Foundations, Simon Haykin, PHI, 2nd Edition.
2. Neural Networks - A Classroom Approach, Sathish Kumar, McGraw Hill Education
2nd Edition.
3. Introduction to Artificial Neural Systems, Jacek M. Zurada, JAICO Publishing House
Ed. 2006.

Course Outcomes
Understand and apply the basic principles of neural networks such as neurons, layers, activation
CO1 functions, and backpropagation to build and train neural networks models using various
frameworks.
Evaluate and improve the performance using metrics such as accuracy, precision, and recall, and
CO2 also to implement techniques such as regularization, dropout, and early stopping to improve
performance.
Apply and demonstrate neural networks to real-world problems in various domains, such as
CO3
computer vision, natural language processing, and speech recognition.
Course Title Calculus and Statistics for Machine Intelligence
Course Code 23AM5HSCSM Credits 3 L-T-P 2-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 2 Total Lecture Hours 26

UNIT – 1 5 Hours
Differential Calculus: Gradient of a Straight Line, and Curve, Derivatives of First
Principle, Second Derivative, partial derivatives, Differentiation by chain rule and product
rule.
Integral Calculus: Integral Calculus rules, indefinite and definite integrals.
UNIT – 2 5 Hours
Linear Model Selection: Subset Selection: Best-Subset Selection, Forward- and
Backward-Stepwise Selection, Forward-Stagewise Regression, Shrinkage Methods: Ridge
Regression, The Lasso, Selecting the Tuning Parameter.
UNIT – 3 5 Hours
Regularization: Logistic regression: Fitting Logistic Regression Models, Quadratic
Approximations and Inference, L1 Regularized Logistic Regression.
UNIT – 4 6 Hours
Optimization and Metrics: Introduction, Graphical approaches – Identification of
optimal solution, Influence of inequality and equality constraints.
Unconstrained Optimization: Single & Multivariable.
Constrained Optimization: Augmented Lagrangian, Sequential Quadratic Programming
Method. Metrics: MAE, MSE, RMSE, R2, Confusion Matrix, AU-ROC.
UNIT – 5 5 Hours
Similar Measures: Applications of Near-Neighbor Search, Jaccard Similarity of Sets,
Similarity of Documents, Collaborative Filtering as a Similar-Sets Problem, Distance
Measures: Definition of a Distance Measure, Euclidean Distances, Jaccard Distance, Cosine
Distance, Edit Distance, Hamming Distance.
Text Books:
1. Calculus for Machine Learning Understanding the Language of Mathematics, Jason Brownlee.
2. The Elements of Statistical Learning Data Mining, Inference, and Prediction, Trevor Hastie
Robert Tibshirani Jerome Friedman, 2nd Edition, Springer.
3. Optimization for machine learning Finding function Optima with Python, Jason Brownlee.
4. Mining of Massive Datasets, Jure Leskovec, Anand Rajaraman, Jeffrey D. Ullman.

Reference Books:
1. An Introduction to Statistical Learning with Applications in R, Gareth James, Daniela Witten,
Trevor Hastie, Robert Tibshiran.

Course Outcomes
Apply concepts of differential calculus, Integral calculus for functional optimization and
CO1 different types of linear model methods such as subset selection, shrinkage methods, logistic
regression for a given problem
Solve various constrained and unconstrained problems with single variable and
CO2
multivariable.
CO3 Assess the performance of different similarity measure methods and metrics.
Course Title AI IN BUSINESS INTELLIGENCE
Course Code 23AM5PEABI Credits 3 L-T-P 3-0-0
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 3 Total Lecture Hours 36

UNIT – 1 8 Hours
Business Intelligence, Data Analytics and Decision Support: Opening Vignette, Changing
Business Environments and Computerized Decision Support, Managerial Decision Making,
Information systems Support for Decision Making, An Early Framework for Computerized Decision
Support, The Concept of Decision Support Systems (DSS), A framework for Business Intelligence
(BI), A Work System View of Decision Support, Overview of Business Analytics, Introduction to Big
Data Analytics
UNIT – 2 7 Hours
Decision Making Technologies: Decision Making, Models, Phases of the Decision-Making Process, The
Intelligence Phase, The Design Phase, The Choice Phase, The Implementation Phase, How Decisions Are
Supported, DSS - Capabilities, Classifications and Components.
Modeling and Analysis: Structure of Mathematical Models for Decision Support, Certainty,
Uncertainty, and Risk, Management Support Systems.
UNIT – 3 6 Hours
Data Warehousing: Data Warehousing Definitions and Concepts, Data Warehousing Process Overview,
Data Warehousing Architectures, Data Integration and the Extraction, Transformation, and Load (ETL)
Processes, Data Warehouse - Development, Implementation Issues, Administration, Security Issues and
Future Trends.
UNIT – 4 7 Hours
Knowledge Management and Collaborative Systems: Introduction to Knowledge Management,
Organizational Learning and Transformation, Knowledge Management Activities, Approaches to
Knowledge Management, Information Technology (IT) In Knowledge Management, Knowledge
Management Systems Implementation, Making Decisions in Groups, Supporting Group work with
Computerized Systems, Tools for indirect support of Decision Making, Direct Computerized Support for
Decision Making
UNIT – 5 8 Hours
Business Analytics for Emerging Trends and Future Impacts: Location based Analytics for
Organizations, Analytics Applications for Consumers, Recommendation Engines, Web 2.0 and Online
Social Networking, Cloud computing and BI, Impact of Analytics in Organizations, Issues of - Legacy,
Privacy and Ethics; An Overview of Analytics Ecosystem.
Text Books:
1. Business Intelligence, A managerial Perspective on Analytics, Sharda, R, Delen D, Turban E, 10th
Edition, Pearson, 2015.

Reference Books:
1. Data Mining Techniques. For Marketing, Sales and Customer Relationship Management,
Berry M. & Linoff G, 2nd Edition, Wiley Publishing Inc., 2004.
2. Artificial Intelligence in Practice, Bernard Marr with Matt Ward, Wiley, 2019
3. Data Science for Business, Foster Provost and Tom Fawcett, O’Reilly Media, Inc., 2013.

Course Outcomes

CO1 Understand and implement the data warehousing concepts.

Apply strategic decision-making capabilities to analyze information to increase the potential of
CO2
AI applications for your business.
Analyze and implement AI technology in different areas of the economy, government and
CO3
society.
Course Title KNOWLEDGE DISCOVERY
Course Code 23AM5PEKDI Credits 3 L-T-P 3-0-0
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 3 Total Lecture Hours 36

UNIT – 1 6 Hours
Introduction and Data Preprocessing: Why data mining, what is data mining, What kinds of data
can be mined, What kinds of patterns can be mined, Which Technologies Are used, Which kinds of
Applications are targeted, Major issues in data mining.
Data Preprocessing: An overview, Data cleaning, Data integration, Data reduction, Data
transformation and data discretization.

UNIT – 2 6 Hours
Data warehousing and online analytical processing: Data warehousing: Basic concepts- What
Is a Data Warehouse, Differences between Operational Database Systems and Data Warehouses,
Why Have a Separate Data Warehouse? Data Warehousing: A Multitiered Architecture.
Data Warehouse Models: Enterprise Warehouse, Data Mart, and Virtual Warehouse Extraction,
Transformation, and Loading.
UNIT – 3 8 Hours
Data warehouse modeling: Data Cube: A Multidimensional Data Model Stars, Snowflakes, and Fact
Constellations: Schemas for Multidimensional Data Models,
Dimensions: The Role of Concept Hierarchies, Measures: Their Categorization and Computation,
Typical OLAP Operations. A Business Analysis Framework for Data Warehouse Design, Data Warehouse
Design Process.
UNIT – 4 8 Hours
Mining Frequent Patterns, Associations, and Correlations: Market Basket Analysis: A Motivating
Example, Frequent Itemsets, Closed Itemsets, and Association Rules,
Apriori Algorithm: Finding Frequent Itemsets by Confined Candidate Generation, Generating
Association Rules from Frequent Itemsets, Improving the Efficiency of Apriori, A Pattern Growth
Approach for Mining Frequent Itemsets, Mining Frequent Itemsets Using Vertical Data Format, Mining
Closed and Max Patterns, Which Patterns Are Interesting? —Pattern Evaluation Methods.
UNIT – 5 8 Hours
Cluster Analysis: What Is Cluster Analysis? Requirements for Cluster Analysis, Partitioning methods:
k-Means: A Centroid-Based Technique, k-Medoids.
Hierarchical Methods: Agglomerative versus Divisive Hierarchical Clustering, BIRCH, Chameleon,
Probabilistic Hierarchical Clustering,
Density-based methods: DBSCAN, OPTICS, DENCLUE
Text Books:
1. Data Mining Concepts and Techniques, Jiawei Han, MichelineKamber, Jian Pei, 3rd
Edition, Elsevier, 2012.

Reference Books:
1. Introduction to Data Mining, Pang-Ning Tan, Michael Steinbach, Anuj Karpatne and Vipin
Kumar, Pearson Education, 2016.

Course Outcomes
Analyze domain (problem, data and goals) to determine the key characteristics and their
CO1
influence on decision making on which data mining to use
Apply the knowledge discovery process stages and the major techniques of each stage in a
CO2
particular domain
CO3 Assess data mining techniques and know how to apply them to specific problems.
Course Title DIGITAL IMAGE PROCESSING
Course Code 23AM5PEDIP Credits 3 L-T-P 3-0-0
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours /Week 3 Total Lecture Hours 36

UNIT – 1 8 Hours
Introduction and Digital Image Fundamentals: The origins of Digital Image Processing,
Examples of Fields that Use Digital Image Processing, Fundamentals Steps in Image Processing.
Elements of Digital Image Processing Systems : Image Sampling and Quantization, Some
basic relationships like Neighbor’s, Connectivity, Distance Measures between pixels,
Translation, Scaling, Rotation and Perspective Projection of image, Linear and Non-Linear
Operations.
UNIT – 2 7 Hours
Image Enhancement in the Spatial Domain: Some basic Gray Level Transformations,
Histogram Processing, Enhancement Using Arithmetic and Logic operations, Combining
Spatial Enhancement Methods, Basics of Spatial Filters, Smoothening and Sharpening Spatial
Filters, Intensity Transformation Function, Histogram Processing and Function Plotting.
UNIT – 3 7 Hours
Image Enhancement in the Frequency Domain: Introduction to Fourier Transform and the
frequency Domain, Computing and Visualizing the 2D DFT, Smoothing Frequency Domain
Filters, Sharpening Frequency Domain Filters, Homomorphic Filtering.
UNIT – 4 8 Hours
Image Restoration: A model of The Image Degradation / Restoration Process, Noise Models,
Restoration in the presence of Noise Only- Spatial Filtering, Periodic Noise Reduction by
Frequency- Domain Filtering, Linear Position-Invariant Degradations, Estimation of
Degradation Function, Inverse filtering, Wiener filtering, Geometric Mean Filter, Geometric
Transformations.
Image Compression: Coding, Interpixel and Psychovisual Redundancy, Image Compression
models, Compression standards.
UNIT – 5 6 Hours
Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection,
Thresholding.
Object Recognition: Patterns and Pattern Classes, Decision-Theoretic Methods, Structural
Methods.
Text Books:
1. Digital Image Processing, Rafael C. Gonzalez and Richard E. Woods, 3rd Edition, Prentice
Hall, 2008.
Reference Books:
1. Fundamentals of Digital Image Processing, Anil K Jain, Pearson Education, 2015.

Course Outcomes
Understand the fundamentals of image processing and acquire knowledge of image acquisition,
CO1
storage, and display technologies.
Develop the ability to use digital image processing tools and techniques to enhance image quality,
CO2
reduce noise, and extract information from images.
Acquire knowledge of advanced image processing techniques such as segmentation, morphological
CO3 operations, and feature extraction to design and implement image processing algorithms using
software tools.
Course Title DATA VISUALIZATION AND ANALYSIS
Course Code 23AM5AEDVA Credits 3 L-T-P 2-0-1
CIE 50 Marks SEE 100 Marks (50% Weightage)
Contact Hours / Week 2 Total Lecture Hours 26

UNIT – 1 6 Hours
Introduction of visual perception, visual representation of data, Gestalt principles, information
overloads, Statistical charts (Bar Chart-stacked bar Chart -Line Chart-Histogram-pie chart- frequency
polygon-Box Plot-Scatter plot
UNIT – 2 5 Hours
Creating visual representations: visualization reference model, visual mapping, visual analytics,
Design of visualization applications

UNIT – 3 5 Hours
Classification of visualization systems: Interaction and visualization techniques misleading,
Visualization of one, two and multi-dimensional data, text and text documents.

UNIT – 4 5 Hours
Visualization: Groups, trees, graphs, clusters, networks, software, Metaphorical visualization
Case Study: Interactive Data Visualization in News Media
UNIT – 5 5 Hours
Visualization of volumetric data: vector fields, processes and simulations, Visualization of maps,
geographic information, GIS systems, collaborative visualizations, evaluating visualizations.
Text Books:
1. Ward, Grinstein Keim, Interactive Data Visualization: Foundations, Techniques, and
Applications. Natick: A K Peters, Ltd,1st Edition, 2010.
2. Kieran Healy, Data Visualization: A Practical Introduction, 1st Edition, 2018.
3. Corey Lanum, Visualizing Graph Data 1st Edition, 2016.

Reference Books:
1. E. Tufte, The Visual Display of Quantitative Information, Graphics Press.2nd Edition, 2001.
2. Andy Krik, Data Visualization: a successful design process 1st Edition, 2016.

Course Outcomes
To understand and interpret data plots core data visualization concepts such as correlation,
CO1
linear relationships, and log scales.
To explore the relationship between two continuous variables using scatter plots and line
CO2
plots.
To interpret and present data and data correlations in a simple way, data analysts use a wide
CO3
range of techniques — charts, diagrams, maps, etc.