Program Structure & Detailed Syllabus (VR-20)

II Year- II Semester

Department of Artificial Intelligence & Data Science Page 96

 Program Structure & Detailed Syllabus (VR-20)

II Year II Semester

S. No. Course Code Course Title L T P C

1 1005202101 Operating Systems 3 0 0 3
2 1054202200 Artificial Intelligence 3 0 0 3
3 1005202203 Design and Analysis of Algorithms 3 0 0 3
4 1005202204 Data Warehousing and Data Mining 3 0 0 3
1099202100 Managerial Economics and Financial
5 3 0 0 3
Analysis
6 1005202111 Operating Systems Lab 0 0 3 1.5
7 1005202212 Algorithms Lab 0 0 3 1.5
1054202210 Data Warehousing and Data Mining
8 0 0 3 1.5
Lab
9 1054202280 Multivariate Data Visualization with R 1 0 2 2
10 1054202260 Mini Project (EPICS) 0 0 0 1
11 1000202121 Environmental Science 2 0 0 0
Total Credits 22.5
MANDATORY SUMMER INTERNSHP
12 Honors/Minor Courses 4 0 0 4

Department of Artificial Intelligence & Data Science Page 97

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Operating Systems
1005202101 3 0 0 3

COURSE OBJECTIVES:
1. Study the basic concepts and functions of operating systems.
2. Understand the structure and functions of OS.
3. Learn about Processes, Threads and Scheduling algorithms.
4. Understand the principles of concurrency and Deadlocks.
5. Learn various memory management schemes.
6. Study I/O management and File systems.

COURSE OUTCOMES:

CO’s At the end of the course, the student will have the ability to:

CO1 Summarize various concepts of Operating Systems

CO2 Implement and Apply Process Scheduling Algorithms
Illustrate concepts of Paging, Segmentation and Apply
CO3
Concurrency, Deadlock Mechanisms in real world
CO4 Analyze the concepts of file systems in operating systems
UNIT- I
INTRODUCTION TO OPERATING SYSTEM CONCEPT
Types of operating systems, operating systems concepts, operating systems services, Introduction
to System call, System call types. [8 Hours]

UNIT-II
PROCESS MANAGEMENT
Process concept, the process, Process State Diagram, Process control block, Process Scheduling-
Scheduling Queues, Schedulers, Operations on Processes, Inter process Communication,
Threading Issues, Scheduling-Basic Concepts, Scheduling Criteria, Scheduling Algorithms.
[8 Hours]

UNIT-III
MEMORY MANAGEMENT
Swapping, Contiguous Memory Allocation, Paging, structure of the Page Table,
Segmentation.

VIRTUAL MEMORY MANAGEMENT

Virtual Memory, Demand Paging, Page-Replacement Algorithms, Thrashing [10 Hours]
UNIT-IV

Department of Artificial Intelligence & Data Science Page 98

 Program Structure & Detailed Syllabus (VR-20)

CONCURRENCY
Process Synchronization, The Critical- Section Problem, Synchronization Hardware,
Semaphores, Classic Problems of Synchronization, Monitors, Synchronization Examples.

PRINCIPLES OF DEADLOCK
System Model, Deadlock Characterization, Deadlock Prevention, Detection and Avoidance,
Recovery form Deadlock [8 Hours]

UNIT-V
FILE SYSTEM INTERFACE
The concept of a file, Access Methods, Directory structure, File system mounting, files
sharing, protection. File System implementation- File system structure, allocation methods,
free-space management Mass-storage structure overview of Mass-storage structure, Disk
scheduling, Device drivers. Introduction to Dockers. [10 Hours]
Text Books:
1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin and
Greg Gagne 9th Edition, John Wiley and Sons Inc., 2012.
2. Operating Systems – Internals and Design Principles, William Stallings, 7th Edition,
Prentice Hall, 2011.
3. Operating Systems-S Halder, Alex A Aravind Pearson Education Second 2016.

Reference Books:
1. Modern Operating Systems, Andrew S. Tanenbaum, Second Edition, Addison
Wesley, 2001.
2. Operating Systems: A Design-Oriented Approach, Charles Crowley, Tata Mc Graw
Hill Education‖, 1996.
3. Operating Systems: A Concept-Based Approach, D M Dhamdhere, Second Edition,
TataMc Graw-Hill Education, 2007.

Department of Artificial Intelligence & Data Science Page 99

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Artificial Intelligence
1054202200 3 0 0 3

COURSE OBJECTIVES:
Artificial intelligence (AI) is a research field that studies how to realize the intelligent
human behaviors on a computer. The ultimate goal of AI is to make a computer that can
learn, plan, and solve problems autonomously. The main purpose of this course is to provide
the most fundamental knowledge to the students so that they can understand what the AI is.
And this course will introduce some basic search algorithms for problem solving. In this
course students will learn about knowledge representation and reasoning and about the Expert
Systems.
COURSE OUTCOMES:

CO’s At the end of the course, the student will have the ability to:
The student should be able to identify problems that are amenable
CO1
to solution by AI methods.
The student should be able to identify appropriate AI methods to
CO2
solve a given problem.
Implement basic AI algorithms ( e.g., standard search
CO3
algorithms or dynamic programming).
CO4 The student should have knowledge in expert system

UNIT- I
INTRODUCTION TO ARTIFICIAL INTELLIGENCE: Introduction, history, intelligent
systems, foundations of AI, Applications of AI, current trends in AI.
PROBLEM SOLVING: Definition, characteristics of problem, types of Problem-solving
techniques, General Problem Solver (GPS), Water Jug Problem, Missionaries and Cannibals
Problem. [10 Hours]

UNIT- II
STATE-SPACE SEARCH: Definition, Examples, Exhaustive search techniques: BFS,
DFS, IDDFS, Heuristic search techniques: Uniform Cost Search, Best First Search, A*
algorithm & Constraint satisfaction Problem.

GAME PLAYING: Introduction about game playing, Mini-Max Algorithm, Alpha-Beta

pruning algorithm. [14 Hours]

UNIT- III
LOGIC CONCEPTS: Introduction, proportional logic, natural deduction system, axiomatic
system, semantic tableau system in proportional logic, resolution refutation in proportional
logic.

Department of Artificial Intelligence & Data Science Page 100

 Program Structure & Detailed Syllabus (VR-20)

PREDICATE LOGIC: Introduction, PNX Normal form, Skolemization, Resolution in

Predicate Logic. [12 Hours]

UNIT- IV
KNOWLEDGE REPRESENTATION: Introduction, approaches to knowledge
representation, knowledge representation using semantic network, knowledge representation
using frames.
UNCERTAINTY MEASURE: PROBABILITY THEORY: Introduction, probability
theory, Bayesian belief networks, Certainty factor theory, Dempster- shafer theory.
[12 Hours]

UNIT- V
EXPERT SYSTEM: Expert system and applications: Introduction phases in building expert
systems, expert system versus traditional systems, rule-based expert systems, application of
expert systems.
FUZZY LOGIC: Introduction, Fuzzy sets, Fuzzyset operations, Types of Menmbership
functions, Multi valued logic, Linguistic variables, Hedges. [12 Hours]

Text Books:
1. Artificial Intelligence- Saroj Kaushik, CENGAGE Learning,
2. Artificial intelligence, A modern Approach , 2nd ed, Stuart Russel, Peter Norvig, PEA
3. Artificial Intelligence- Rich, Kevin Knight, Shiv Shankar B Nair, 3rd ed, TMH
4. Introduction to Artificial Intelligence, Patterson, PHI

Reference Books:
1. Atificial intelligence, structures and Strategies for Complex problem solving, -George
F.Lugar,5thed, PEA
2. Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
3. Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier

Department of Artificial Intelligence & Data Science Page 101

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Design and Analysis of Algorithms
1005202203 3 0 0 3

COURSE OBJECTIVES:
This course introduces different techniques to design algorithms using Divide and Conquer,
Greedy Approach, Dynamic Programming, Randomized techniques, Multi-Threading,
Backtracking and Branch and Bound. It also focuses on how to measure the time and space
complexities of algorithms.

COURSE OUTCOMES:

CO’s At the end of the course, the student will have the ability to:
Able to analyze the performance of an algorithm in terms of time and
CO1
space.
CO2 Give an intuition on how to find a solution to large problems by
dividing them into smaller sub problems.
Identifying which designing technique can be used to solve a
CO3
particular problem.
Able to analyse the complexities between naïve and parallel
CO4
algorithms.

UNIT- I
Foundations of Algorithm: Algorithm, Algorithm Specification, Recursive Algorithm,
Analysis: Space Complexity and Time Complexity, Asymptotic Notations, Amortized
Analysis, Sorting in linear time: Counting sort. [8 Hours]

UNIT-II
Divide and Conquer: General method, Masters Theorem with proof, Applications: Binary
search, Defective Chessboard, Finding the Maximum and Minimum, Quick sort, Merge sort,
Matrix multiplication: Block and Strassen‘s matrix multiplication, Randomized Quicksort.
[10 Hours]

UNIT-III
Greedy method: General method, Applications: Job sequencing with deadlines, knapsack
problem, Single source shortest path problem, Optimal Merge Patterns.
Multithreaded Algorithms: Basics of dynamic multithreading, multithreaded matrix
multiplication, multithreaded merge sort. [8 Hours]

UNIT-IV
Dynamic Programming: General method, Applications: Matrix chain multiplication, 0/1
knapsack problem, All pairs shortest path problem, Travelling salesperson problem, String
Editing, Reliability design. [12 Hours]

Department of Artificial Intelligence & Data Science Page 102

 Program Structure & Detailed Syllabus (VR-20)

UNIT-V
Backtracking: General method, Applications: n-queen problem, sum of subsets problem.
Branch and Bound: Control Abstraction for LC-Search, FIFO & LIFO Branch-and-Bound
techniques, 15-Puzzle Problem.
Introduction to NP-Hard and NP- Completeness. [10 Hours]
Text Books:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and
Rajasekharam, Universities Press.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest
and C.Stein, PHI Pvt. Ltd.
3. The Algorithm Design Manual, 2nd edition, Steven S. Skiena, Springer.
4. Design and Analysis of Algorithms, S. Sridhar, OXFORD UNIVERSITY PRESS.
5. Introduction to the Design and Analysis of Algorithms, Anany Levi, PEA

Reference Books:
1. Design and Analysis of Computer Algorithms, First Edition, V. AHO, Pearson
2. Design and Analysis of Algorithms, ParagHimanshu Dave, HimansuBalachandra
Dave, Pearson Education.
3. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T. Lee,
S.S.Tseng, R.C.Chang and T.Tsai, McGrawHill.
4. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
5. Algorithms: Fourth Edition, Robert Sedgewick, Addison-Wesley, 2008

E-Books:
1. https://kailash392.files.wordpress.com/2019/02/fundamentalsof-computer-algorithms-
by-ellis-horowitz.pdf
2. https://web.ist.utl.pt/~fabio.ferreira/material/asa/clrs.pdf

NPTEL/MOOC:
1. https://nptel.ac.in/courses/106/106/106106131/

2. https://nptel.ac.in/courses/106/101/106101060/

Department of Artificial Intelligence & Data Science Page 103

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
1005202204 Data Warehousing and Data Mining 3 0 0 3

COURSE OBJECTIVES:
This course discusses techniques for pre-processing data before mining and presents the
concepts related to data warehousing, online analytical processing (OLAP), and data
generalization. It presents methods for mining frequent patterns, associations, and
correlations. It also presents methods for data classification and prediction, data-clustering
approaches, and outlier analysis.
COURSE OUTCOMES:
At the end of the course, the student will have the ability
CO’s
to:
CO1 Understand the concepts of data warehouse and data mining
CO2 Use data pre-processing techniques to build data warehouse
CO3 Analyse transaction databases for association rules
Understand the details of different algorithms made available by
CO4 popular commercial data mining software and solve real data
mining problems by using the right tools to find interesting patterns
**Strength of mapping (Intensity Scale) – 1(Lightly mapped), 2(Moderately mapped), 3(Heavily
mapped)

UNIT- I
Introduction: What Motivated Data Mining? Why Is It Important? Knowledge Discovery
Process, Data Mining—On What Kind of Data, Data Mining Functionalities—What Kinds of
Patterns Can Be Mined? Classification of Data Mining Systems, Data Mining Task
Primitives, Major Issues in Data Mining
Data Pre-processing: Why Pre-process the Data? Data Cleaning, Data Integration, Data
Transformation, Data Reduction and Data Discretization. [10 Hours]
UNIT-II
Data Warehouse and OLAP Technology: An Overview: What Is a Data Warehouse? OLAP
versus OLTP, A Multidimensional Data Model- Data Warehouse Schemas, Concept
Hierarchies, Typical OLAP Operations, Data Warehouse Architecture, Data Warehouse
Implementation. [8 Hours]
UNIT-III
Classification: Basic Concepts, General Approach to solving a classification problem,
Decision Tree Induction: Working of Decision Tree, building a decision tree, Methods for
expressing an attribute test conditions, Measures for selecting the best split, Algorithm for
decision tree induction. Model Over fitting: Due to presence of noise, Due to lack of

Department of Artificial Intelligence & Data Science Page 104

 Program Structure & Detailed Syllabus (VR-20)

representation samples, Evaluating the performance of classifier: holdout method, random

sub sampling, and cross-validation, bootstrap. [10 Hours]
UNIT-IV
Association Analysis: Basic Concepts, Frequent Itemset Mining Methods - Apriori
Algorithm, Frequent-Pattern Growth Approach, Generating Association Rules from Frequent
Itemsets. Mining various kinds of Association rules. [9 Hours]
UNIT-V
Cluster Analysis: What Is Cluster Analysis? Different Types of Clustering‘s, Different Types
of Clusters, K-means: The Basic K-means Algorithm, K-means additional Issues, Bisecting
K-means, K-means and Different Types of Clusters, Strengths and Weaknesses. Hierarchical
Clustering: Agglomerative and Divisive Hierarchical Clustering algorithms, Strengths and
Weaknesses of Hierarchical Clustering. DBSCAN: Traditional Density Center-Based
Approach, DBSCAN Algorithm, Strengths and Weaknesses. [8 Hours]
TEXT BOOKS
1. Data Mining concepts and Techniques, 3/e, Jiawei Han, Michel Kamber, Elsevier.
2. Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin Kumar,
Pearson.

REFERENCE BOOKS
1. Data Mining Techniques and Applications: An Introduction, Hongbo Du, Cengage
Learning.
2. Data Mining : Introductory and Advanced topics : Dunham, Pearson.
3. Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH.

E-Books:
1. https://www.academia.edu/6489220/Data_Mining_ebook
2. http://myweb.sabanciuniv.edu/rdehkharghani/files/2016/02/The-Morgan-Kaufmann-
Series-in-Data-Management-Systems-Jiawei-Han-Micheline-Kamber-Jian-Pei-Data-
Mining.-Concepts-and-Techniques-3rd-Edition-Morgan-Kaufmann-2011.pdf

Department of Artificial Intelligence & Data Science Page 105

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester Managerial Economics And Financial Analysis L T P C

1099202100 3 0 0 3

Course Overview: The present course is designed in such a way that it gives an overview of
concepts of Economics. Managerial Economics enables students to understand micro
environment in which markets operate how price determination is done under different kinds
of competitions. Financial Analysis gives clear idea about concepts, conventions and
accounting procedures along with introducing students to fundamentals financial statements.
Break Even Analysis is very helpful to the Business Concern for Decision Making,
controlling and forward Strategic Planning.
Course Objectives:
1. Understand the concepts of managerial economics and the market dynamics
namely Demand, Elasticity of demand and pricing in different market structures.
2. Acquire the knowledge about production theories and cost analysis besides
dealing with the production and factors of production.
3. Analyze the different market structures and understand various pricing methods
which are adopted in attracting the customers under different markets.
4. To provide the basic knowledge on financial accounting
5. To understanding Capital budgeting decisions.

COURSE OUTCOMES:
At the end of the course, the student will have the ability
CO’s
to:
CO1 Analyze the Demand, Price and Cost.
CO2 Identify the Nature of different markets
CO3 Understand Various Business Forms
CO4 Evaluate investment project proposals

Unit-I
Introduction to Managerial Economics and demand Analysis: Definition of Managerial
Economics –Scope of Managerial Economics and its relationship with other subjects –
Concept of Demand, Types of Demand, Determinants of Demand, Demand schedule,
Demand curve - Law of Demand and its Exceptions- Elasticity of Demand & Its types -
Demand forecasting and Methods of forecasting.
Unit-II
Production and Cost Analysis: Concept of Production function- Cobb-Douglas Production
function – Leontief production function, Production Function with One variable Input, Two
Variable Inputs and Concept of Returns to scale -economies of scale,Different cost concepts
– Cost –Volume-Profit (CVP) analysis (simple problems)

Department of Artificial Intelligence & Data Science Page 106

 Program Structure & Detailed Syllabus (VR-20)

Unit-III
Part-I: Introduction to Market Structures and pricing methods: Perfect Competition,
Monopoly, Monopolistic competition and Oligopoly- Features – Price and Output
Determination, Significance of Pricing and various methods of pricing with contemporary
examples
Part-II: Introduction to Business: Features, Merits and Demerits - Sole Trader, Partnership,
Joint Stock Company – Public Enterprises – Business Cycles: Meaning and Features – Phases
of Business Cycle.
Unit-IV
Introduction to Financial Accounting: Systems of Book-keeping, Golden rules of Accounting,
Accounting Principles, Accounting Cycle- Journal, Ledger, Trail Balance, Preparation of Trading-
Account, P&L Account and Balance Sheet (Simple Problems)

Unit-V
Capital and Capital Budgeting Decisions:Introduction to Capital, Classification of Capital,
Time value of money. Types of Capital Budgeting Decisions: Traditional Methods (Payback
period, Accounting rate of return) and Modern methods (Net Present Value method, Internal
Rate of Return Method and Profitability Index Method) (Simple Problems)
Text Books:
1. M.Kasi Reddy & Saraswathi, ―Managerial Economics and Financial Analysis‖, PHI
Publications, New Delhi, 10th Revised Edition, 2012.
2.Varshney& Maheswari, ―Managerial Economics‖, Sulthan Chand Publishers, 1st Revised
Edition, 2009.
3.S.N. Maheshwari & S.K.Maheshwari, ―Financial Accounting‖, Vikas Publication House
Pvt.Ltd, 4th Edition, 2012.
Reference Books:
1. D.N. Dwivedi, ―Managerial Economics‖, Vikas Publication House Pvt.Ltd, 2nd Edition,
2012.
2.R.Narayana Swamy, ―Financial Accounting- A managerial Perspective‖, Pearson
publications, 1st Indian Reprint Edition, 2012.
3.J.V.Prabhakar Rao & P.V.Rao, ―Managerial Economics & Financial Analysis‖, Maruthi
Publishers, 1st Revised Editon, 2011
NPTEL/SWAYAMMOOCS:
1.https://onlinecourses.swayam2.ac.in/imb19_mg08/preview
2.https://www.coursera.org/learn/strategic-management

Department of Artificial Intelligence & Data Science Page 107

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Operating Systems Lab
1005202111 0 0 3 1.5

COURSE OBJECTIVES:
1. To provide an understanding of the design aspects of operating system.
2. To provide practical knowledge on the different concepts of operating systems.
3. To familiarize students with the Linux environment.

COURSE OUTCOMES:
At the end of the course, the student will have the ability
CO’s
to:
CO1 Stimulate CPU scheduling algorithms in operating system.
Evaluate memory management techniques in operating
CO2
system.
Implement page replacement algorithms in operating
CO3
system
Implement file allocation strategies used in operating
CO4
system.

LIST OF EXPERIMENTS

S.No. Name of the experiment Skill

Exercise -1
Study of Unix/Linux general purpose utility command list
Unix/Linux
1. man,who,cat, cd, cp, ps, ls, mv, rm, mkdir, rmdir, echo,
Commands
more, date, time, kill, history, chmod, chown, finger, pwd,
cal, logout, shutdown.
Exercise – 2
Simulate the following CPU scheduling algorithms
a) Round Robin CPU
2.
b) SJF Scheduling
c) FCFS
d) Priority
Exercise – 3 Multi
3.
Simulate MVT and MFT Programming
Exercise – 4 Dead Lock
4.
Simulate Bankers Algorithm for Dead Lock Avoidance Avoidance
Exercises –5 Dead Lock
5.
Simulate Bankers Algorithm for Dead Lock Prevention Prevention
Exercise -6
Simulate all page replacement algorithms. Page
6.
a) FIFO Replacement
b) LRU

Department of Artificial Intelligence & Data Science Page 108

 Program Structure & Detailed Syllabus (VR-20)

c) LFU
Exercise -7
Simulate all File allocation strategies
7. a) Sequenced File Allocation
b) Indexed
c) Linked
Exercise -8
8. ls –l command
C program to emulate the UNIX ls –l command.
Exercise -9
9. C program that illustrates how to execute two commands Command Pipe
concurrently with a command pipe.
Exercise -10
10. C program that illustrates two processes communicating Shared Memory
using shared memory

Text Books:
1. Operating System Concepts, Abraham Silberschatz, Peter Baer Galvin and
Greg Gagne 9th Edition, John Wiley and Sons Inc., 2012.
2. Operating Systems – Internals and Design Principles, William Stallings, 7th Edition,
Prentice Hall, 2011.
3. Operating Systems-S Halder, Alex A Aravind Pearson Education Second 2016.

Reference Books:
1. Modern Operating Systems, Andrew S. Tanenbaum, Second Edition, Addison
Wesley, 2001.
2. Operating Systems: A Design-Oriented Approach, Charles Crowley, Tata Mc Graw
Hill Education‖, 1996.
3. Operating Systems: A Concept-Based Approach, D M Dhamdhere, Second Edition,
TataMc Graw-Hill Education, 2007.

Department of Artificial Intelligence & Data Science Page 109

 Program Structure & Detailed Syllabus (VR-20)

II Year – I Semester L T P C
Algorithms Lab
1005202212 0 0 3 1.5

COURSE OBJECTIVES:
1. Analyze the asymptotic performance of algorithms.
2. Write rigorous correctness proofs for algorithms.
3. Demonstrate a familiarity with major algorithms and data structures.
4. Apply important algorithmic design paradigms and methods of analysis.
5. Synthesize efficient algorithms in common engineering design situations.

COURSE OUTCOMES:

CO’s At the end of the course, the student will have the ability to:
The ability to understand, analyze and develop computer programs in
CO1
the areas related to algorithms.
CO2 To find an algorithm to solve the problem and prove that the algorithm
solves the problem correctly.
To understand the mathematical criterion for deciding whether an
CO3
algorithm is efficient.
LIST OF EXPERIMENTS
S.No. Name of the experiment Skill
Exercise – 1
1 Divide and Conquer technique
Implement recursive binary search algorithm
Exercise – 2
2 Divide and Conquer technique
Implement recursive quick sort algorithm
Exercise – 3
3 Divide and Conquer technique
Implement recursive merge sort algorithm
Exercise – 4
4 Divide and Conquer technique
Implement Randomized quick sort algorithm
Exercise – 5
5 Find Optimal solution for a Knap Sack Greedy method
Problem
Exercise – 6
6 Find the shortest path using single source Greedy method
shortest path algorithm
Exercise – 7
7 Greedy method
Implement Huffman coding technique
Exercise – 8
8 Dynamic programming technique
Implement 0/1 knapsack problem
Exercise – 9
9 Find the shortest path using All pairs shortest Dynamic programming technique
path algorithm
Exercise – 10
10 Dynamic programming technique
Implement traveling sales person problem

Department of Artificial Intelligence & Data Science Page 110

 Program Structure & Detailed Syllabus (VR-20)

Exercise – 11
11 Backtracking technique
Implement sum of subsets problem
Exercise – 12
12 Backtracking technique
Implement N-Queen‘s problem

Text Books:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and
Rajasekharam, Universities Press.
2. Introduction to Algorithms, second edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest
and C.Stein, PHI Pvt. Ltd.

Reference Books:
1. Design and Analysis of Computer Algorithms, First Edition, V. AHO, Pearson
2. Design and Analysis of Algorithms, ParagHimanshu Dave, HimansuBalachandra
Dave, Pearson Education.

Department of Artificial Intelligence & Data Science Page 111

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Data Warehousing and Data Mining Lab
1054202210 0 0 3 1.5

COURSE OBJECTIVES:
 Introduce to methods and theory for development of data warehouses and
data analysis using data mining.
 Data quality and methods and techniques for pre-processing of data.
 Modelling and design of data warehouses.
 Algorithms for classification, clustering and association rule analysis.

COURSE OUTCOMES:

Co‘s Course outcome

Understand data warehouse concepts, architecture, business
CO1
analysis and tools
Understand data pre-processing and data visualization
CO2
techniques
Study algorithms for finding hidden and interesting patterns
CO3
in data
Understand and apply various classification and clustering
CO4
techniques using tools.
**Strength of mapping (Intensity Scale) – 1(Lightly mapped), 2(Moderately mapped),
3(Heavily mapped)

LIST OF EXPERIMENTS
S.No. Name of the experiment Skill
Understand
1. Implementation of OLAP operations OLAP
operations
Implementation of Data pre-processing techniques: Understand data
2. 1. Splitting of the data set in Training and Validation sets. pre-processing
2. Taking care of Missing values. techniques
Implementation of Data pre-processing techniques: Understand data
3. 1. Taking care of Categorical Features. pre-processing
2. Normalization of data set. techniques
Understand
4. Implementation of finding Association Rules for Employee data
Association rules
Apply
5. Write a program for FPGROWTH algorithm and also test it. FPGROWTH
algorithm
Write a program to construct an optimized DECISION TREE for a Apply Decision
6.
given training data and by using any attribute selection measure tree algorithm
Write a program for NAÏVE BAYESIAN algorithm for classifying Apply
7.
NavieBayesian

Department of Artificial Intelligence & Data Science Page 112

 Program Structure & Detailed Syllabus (VR-20)

the data. algorithm

Write a program to implement K-means clustering algorithm for Apply K-,means
8.
clustering data algorithm

Department of Artificial Intelligence & Data Science Page 113

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
Multivariate Data Visualization with R
1054202280 1 0 2 2

COURSE OBJECTIVES:
1. Conduct exploratory data analysis using visualization.
2. Craft visual presentations of data for effective communication.
3. Design and evaluate colour palettes for visualization based on principles of
perception.
4. Critique existing visualizations based on data visualization theory and principles.

COURSE OUTCOMES:

CO’s At the end of the course, the student will have the ability to:
Graphically depict visual 2D, 3D, 4D (and so on) relationships that
CO1
exist in multivariate data sets.
Understand how to apply the techniques of conditioning and paneling
CO2
to present multivariate data relationships
Have a powerful visual toolset to visually present the results of multi-
CO3 variable statistical model fitting.

Understand the nature of lattice panel functions and know how to

CO4 create and modify them for brilliant multivariate graphics displays.

UNIT- I

Introduction to Lattice and to “Trellis” Graphics

Introduction to Lattice, The Trellis Object, Dimension and Physical Layout, Scales and Axes,
Visualizing Univariate Distributions, Two Sample QQ Plots, Strip Plots. [9 Hours]
UNIT-II

Multiway Tables and Scatter Plots

Multiway Tables, Multipanel Dot Plots, Scatter Plots and Extensions, Shingles and Advanced
Indexing, More Scatter Plots, Parallel Co-ordinates Plot. [10 Hours]

UNIT-III
Trivariate, 3D, and Other Complex Displays
Trivariate Displays, 3D Scatter Plots, 3D Panel Functions, Visualizing Theoretical 3D
Surfaces. [10 Hours]

UNIT-IV
Finer Control Graphical Parameters and Other Settings

Department of Artificial Intelligence & Data Science Page 114

 Program Structure & Detailed Syllabus (VR-20)

Graphical Parameters and Other Settings, Plot Coordinates and Axis Annotation, Labels and
Legends, Data Manipulation, Shingles and Related Utilities, Ordering Categorical Variables.
[9 Hours]
UNIT-V

The Shapes of Data, Marks and Channels

Introduction to Viz Hub, making a Face with D3.js, Input for Visualization: Data and Tasks,
Loading and Parsing Data with D3.js, Encoding Data with Marks and Channels Rendering
Marks and Channels with D3.js and SVG, Introduction to D3 Scales, Creating a Scatter Plot
with D3.js [10 Hours]

Text Books:
1. Lattice: Multivariate Data Visualization with R (Use R!) Paperback – Illustrated, 27
November 2008
2. Visualization Analysis and Design (AK Peters Visualization Series) 1st Edition
3. Data Visualization with R,Rob Kabacoff,2020-12-01

Reference Books:
1. Interactive Data Visualization for the Web: An Introduction to Designing with D3 2nd
Edition
2. Better Data Visualizations: A Guide for Scholars, Researchers, and Wonks
3. Fundamentals of Data Visualization: A Primer on Making Informative and
Compelling Figures 1st Edition
E-Books:
https://visualr.io/library/e-books/
NPTEL/MOOC:
1. https://www.udemy.com/course/multivariate-data-visualization-with-r/

Department of Artificial Intelligence & Data Science Page 115

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester L T P C
MINI PROJECT (EPICS)
1005202260 0 0 2 1

INTRODUCTION
1. Community Service Project is an experiential learning strategy that integrates meaningful
community service with instruction, participation, learning and community development

2. Community Service Project involves students in community development and service

activities and applies the experience to personal and academic development.
3. Community Service Project is meant to link the community with the college for mutual
benefit. The community will be benefited with the focused contribution of the college
students for the village/ local development. The college finds an opportunity to develop social
sensibility and responsibility among students and also emerge as a socially responsible
institution.

OBJECTIVE
1. To sensitize the students to the living conditions of the people who are around them,
2. To help students to realize the stark realities of the society.
3. To bring about an attitudinal change in the students and help them to develop societal
consciousness, sensibility, responsibility and accountability

4. To make students aware of their inner strength and help them to find new /out of box
solutions to the social problems.
5. To make students socially responsible citizens who are sensitive to the needs of the
disadvantaged sections.
6. To help students to initiate developmental activities in the community in coordination with
public and government authorities.

7. To develop a holistic life perspective among the students by making them study culture,
traditions, habits, lifestyles, resource utilization, wastages and its management, social
problems, public administration system and the roles and responsibilities of different persons
across different social systems.
EXPECTED OUTCOMES
BENEFITS OF COMMUNITY SERVICE PROJECT TO STUDENTS

Learning Outcomes
1. Positive impact on students‘ academic learning
2. Improves students‘ ability to apply what they have learned in ―the real world‖
3. Positive impact on academic outcomes such as demonstrated complexity of understanding,
problem analysis, problem-solving, critical thinking, and cognitive development
4. Improved ability to understand complexity and ambiguity

Department of Artificial Intelligence & Data Science Page 116

 Program Structure & Detailed Syllabus (VR-20)

Personal Outcomes
1. Greater sense of personal efficacy, personal identity, spiritual growth, and moral
development
2. Greater interpersonal development, particularly the ability to work well with others, and
build leadership and communication skills

Social Outcomes
1. Reduced stereotypes and greater inter-cultural understanding
2. Improved social responsibility and citizenship skills
3. Greater involvement in community service after graduation

Career Development
1. Connections with professionals and community members for learning and career
opportunities
2. Greater academic learning, leadership skills, and personal efficacy can lead to greater
opportunity

Relationship with the Institution

1. Stronger relationships with faculty
2. Greater satisfaction with college
3. Improved graduation rates

SUGGESTIVE LIST OF PROGRAMMES UNDER COMMUNITY SERVICE

PROJECT
The following the recommended list of projects for students. It is highly expected to focus on
specific local issues for this kind of projects. The students are expected to carry out these
projects with involvement, commitment, responsibility and accountability. The mentors of a
group of students should take the responsibility of motivating, facilitating, and guiding the
students. They have to interact with local leadership and people and appraise the objectives
and benefits of this kind of projects. The project reports shall be placed in the college website
for reference. Systematic, Factual, methodical and honest reporting shall be ensured.

Implementation Procedure:
1. A group of students or even a single student could be assigned for a particular habitation or
village or municipal ward, as far as possible, in the near vicinity of their place of stay, so as to
enable them to commute from their residence and return back by evening or so.

2. The Community Service Project is a twofold one –

a) First, the student/s could conduct a survey of the habitation, if necessary, in terms of their
own domain or subject area. Or it can even be a general survey, incorporating all the different
areas. A common survey format could be designed. This should not be viewed as a
duplication of work by the Village or Ward volunteers; rather, it could be another primary
source of data.

Department of Artificial Intelligence & Data Science Page 117

 Program Structure & Detailed Syllabus (VR-20)

b) Secondly, the student/s could take up a social activity, concerning their domain or subject
area. The different areas, could be like –

1. Water facilities and drinking water availability

2. Health and hygiene
3. Stress levels and coping mechanisms
4. Horticulture
5. Herbal plants
6. Marine products
7. Aqua culture
8. Nutrition
9. Traditional health care methods
10. Air pollution
11. Water pollution
12. Soil protection
13. Renewable energy
14. Organic farming
15. Access to safe drinking water
16. Blood groups and blood levels
17. Internet Usage in Villages
18. Android Phone usage by different people
19. Utilization of free electricity to farmers and related issues
20. Natural disaster management
EVALUATION PROCEDURE:
1. Preliminary survey report - 20 M
2. Final Presentation – 10M
3. Final report submission & Final demo module – 20 M
For each student's batch, a separate attendance record should be kept in the preliminary
survey report and final report, which should be counter signed by the teacher-mentor, HOD,
and Principal.
Reports should include photographs that have a geotag.

Department of Artificial Intelligence & Data Science Page 118

 Program Structure & Detailed Syllabus (VR-20)

II Year – II Semester AUDIT COURSE - II L T P C

1000202121 Environmental Science 2 0 0 0

COURSE OBJECTIVES:
1. Classify, describe and explain the concepts of Ecosystems and environmental Studies.
2. Overall understanding of different types of natural resources and its conservation.
3. Acquaintance on various environmental challenges induced due to unplanned
anthropogenic activities.
4. An understanding of the environmental impacts of developmental activities and the
importance of environmental management.
5. Awareness on the social issues, environmental legislations and global treats.
COURSE OUTCOMES:
CO’s At the end of the course, the student will have the ability to:
CO1 Gain a higher level of personal involvement and interest in understanding
and solving environmental problems.

CO2 Comprehend environmental problems from multiple perspectives with

emphasis on human modern lifestyles and developmental activities.

CO3 Learn the management of environmental hazards and to mitigate disasters

and have a clear understanding of environmental concerns and follow
sustainable development practices.

**Strength of mapping (Intensity Scale) – 1(Lightly mapped), 2(Moderately mapped), 3(Heavily

mapped)

UNIT I (8 hrs)

Multidisciplinary nature of Environmental Studies:

Definition Scope and its importance, Multidisciplinary nature of Environmental
science.

Ecosystems: Concept of an ecosystem. – Structure and function of an ecosystem –

Energy flow in the ecosystem – Ecological pyramids - Ecological succession.

Social Issues and the Environment: Impacts of microbial toxins on human health.
Urban problems related to energy- Water conservation, rain water harvesting and
watershed management – Resettlement and rehabilitation of people; its problems and
concerns. Case studies – Environmental ethics: Issues and possible solutions.
Climate change, Global warming, Acid rain, Ozone layer depletion.

UNIT II - (3 hrs)

Department of Artificial Intelligence & Data Science Page 119

 Program Structure & Detailed Syllabus (VR-20)

BIODIVERSITY AND ITS CONSERVATION: Definition: genetic, species and

ecosystem diversity –Value of biodiversity, Hot-spots of biodiversity, Threats to
biodiversity, Endangered and endemic species of India – Conservation of biodiversity.

UNIT III: (8 hrs)

Natural Resources: Renewable and non-renewable resources – Natural resources and

associated problems – Forest resources – Use and over – exploitation, deforestation,
case studies – Timber extraction – Mining, dams and other effects on forest and tribal
people – Water resources – Use and over utilization of surface and ground water –
Floods, drought, dams – benefits and problems – Mineral resources: Use and
exploitation, environmental effects of extracting and using mineral resources, case
studies – Food resources: World food problems, changes caused by agriculture and
overgrazing, effects of modern agriculture, fertilizer-pesticide problems, water
logging, salinity, case studies – Energy resources

UNIT IV – (9 hrs)
ENVIRONMENTAL POLLUTION: Definition, Cause, effects and control
measures of:
a. Air Pollution.
b. Water pollution
c. Soil pollution
d. Noise pollution
e. Nuclear hazards

Role of an individual in prevention of pollution – Pollution case studies

Environmental Laws: Wildlife Protection Act 1972 –Water pollution prevention and
control Act 1974 - Forest Conservation Act 1980n –Air pollution prevention and
control Act 1981. Environmental Protection Act 1986 and 2006 - – Public awareness
SOLID WASTE MANAGEMENT: Causes, effects and control measures of urban
and industrial wastes.
Sustainable Development: Goals of Sustainability, Conferences, Carbon credits and
carbon footprints.
UNIT V – ( 4 hrs)
Environmental Management:
EIA and EA: Introduction, definition, scope, objectives and methodology.
Disaster management: Definition, floods, earthquake, cyclone and landslides.
Ecotourism: Definition, principles, advantages and disadvantages
Environmental Diary

Field Trip
Field work/Environmental Visit: Visit to a local area to document environmental assets –
reserve forest/ eco-tourist spot : Visit to a local polluted site - Study of local environment -

Department of Artificial Intelligence & Data Science Page 120

 Program Structure & Detailed Syllabus (VR-20)

common plants, insects, birds - Study of simple ecosystems –pond, river, hill slopes etc -
Visit to industries/water treatment plants/effluent treatment plants.
Text Books:
1. Text book of Environmental Studies for Undergraduate courses by ErachBharuncha for
University Grants Commission, Universities Press.
2. Environmental Studies by Palaniswamy – Pearson Education.
3. Environmental Studies by Dr. S. Azeem Unnisa, Academic Publishing Company
Reference Books:
1. Textbook of Environmental Science by Deeksha Dave and E. Sai Baba Reddy, Cengage
Publications.
2. Text of Environmental Sciences and Technology by M. Anji Reddy, BS Publications.
3. Comprehensive Environmental studies by J.P Sharma, Laxmi Publications.
4. Environmental sciences and Engineering – J Glynn Henry and Gary W Heinke – Prentice
hall of India Private Limited.
5. A textbook of Environmental Studies by G.R Chatwal, Himalaya Publishing house.
6. Introduction to Environmental engineering and science by Gilbert M Masters and Wendell
P Ela – Prentice hall of India private limited.
E-Books: (Specify links)
NPTEL/MOOC: (Specify Links)

Department of Artificial Intelligence & Data Science Page 121