Big Data Optimization Course Handout
Big Data Optimization Course Handout
K L Deemed to be University
Department of CSE -- KLVZA
Course Handout
2020-2021, Even Sem
Course Title :BDO
Course Code :18CS3064
L-T-P-S Structure : 2-0-2-0
Pre-requisite :
Credits :3
Course Coordinator :SANTHI Munnangi Velamgini Bala Teresa
Team of Instructors :
Teaching Associates :
Syllabus :Introduction: Motivation, Why R, Representation of a Solution , Evaluation Function , Constraints ,
Optimization Methods , Demonstrative Problems Foundation of r -R Basics: Introduction Basic Objects and
Functions, data structures, about usage, understanding data structures, functions, list, arrays, control structures,
data manipulations, date and string manipulations Blind Search: Introduction, Full Blind Search, Grid Search ,
Monte Carlo Search , Local Search: Introduction , Hill Climbing, Simulated Annealing Tabu Search,
Comparison of Local Search Methods, Population Based Search: Introduction, Genetic and Evolutionary
Algorithms ,Differential Evolution ,Particle Swarm Optimization, Estimation of Distribution Algorithm
,Comparison of Population Based Methods, Bag Prices with Constraint Genetic Programming Applications:
Introduction, Travelling Salesman Problem , Time Series Forecasting , Wine Quality Classification
Implementing R programming on various problems.
Text Books :1. Paulo Cortez, “Modern Optimization with R “ Springer, (2014). 2. Nicholas J. Horton & Ken
Klein man, “ Using R and R Studio for Data Management, Statistical Analysis, and Graphics”, Second Edition
, CRC Press, (2015).
Reference Books :1. Carlo Zaniolo, “Advanced database systems”, Morgan Kaufmann, Elsevier, (1997). 2. Jan
L. Harrington, “Relational Database Design”, Morgan Kaufmann, Elsevier, (2009)
Web Links :1. https://youtube.videoken.com/embed/ahXszIXr1NE?
rel=1&color1=0xcbba9f&color2=0xcbba9f&border=0&fs=1 2. https://nptel.ac.in/courses/106/102/106102064/
MOOCS :1. www.coursera.org/learn/solving-algorithms-discrete-optimization 2.
www.coursera.org/learn/discrete-optimization
Course Rationale :Current1y, we are in the Information Age, where more organizational and individual
activities and processes are based on Information Technology. We are also in a fast changing world. Due to
several factors, such as globalization, technological improvements, and recent financial crisis, both
organizations and individuals are pressured for improving their efficiency, reducing costs, and making better-
informed decisions. This is where optimization methods, supported by computational tools, can play a key role.
Nowadays and with the increasing number of real world applications, many tasks can be viewed as an
optimization problem. Sometimes, we are required to maximize or to minimize an objective function. The field
of optimization can be used in different application domains. Optimization is part of the field of operations
research which was developed with many classical techniques such as linear programming. In the recent years,
there have been new optimization algorithms, all of which are part of this course big data and optimization.
This course includes modem optimization methods combined with real applications.
Course Objectives :The objective of the course is to expose the students to the most relevant concepts related
with modern optimization methods, showing how such concepts and methods can be addressed using the R
tool.
1/25
12/24/2020
COURSE OUTCOMES (COs):
Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
Understand optimization methods and analytics using R
CO1 PSO1,PO2 2
programming
Apply blind search and local search methods for solving
CO2 PO2,PSO1 3
optimization problems
Analyze and compare population-based search methods for solving
CO3 PSO2,PO4 4
real world problems
Analyze applications of genetic programming to solve problems
CO4 PSO1,PO4 4
like Travelling Salesman Problem
CO5 Implement optimization algorithms using R Programming PSO2,PO5 5
Outcome Highest
COI-1 COI-2 COI-3 COI-4
No. BTL
Btl-1 Btl-2
Knowledge on Understanding the
CO1 2 Optimization basics of R, Basic
techniques , problem objects and functions,
representation Controlling execution
Btl-1 Btl-2 Btl-3
Knowledge on Blind Understanding the Apply the concepts of
CO2 3 Search, Full Blind, Local Search, Hill Tabu search,
Grid, Monte Carlo Climbing, Simulated Comparison of Local
Search Annealing. Search Methods
Btl-3
Btl-1 Estimation of
Btl-2 Btl-4
Introduction to distribution
Interpret the Compare the
Population Based Algorithm,
CO3 4 Differential performance of
Search , Genetic and Comparison of
Evolution, Particle different population
Evolutionary Population Based
Swarm Optimization based algorithms
Algorithms methods. Bag Prices
with Constraint
Btl-2 Btl-4
Btl-1 Btl-3
Infer the Travelling Analyse the
Introduction to Solve the Wine
CO4 4 Salesman Problem. performance of TSP
Genetic programming Quality classification
Time Series and wine quality
and applications problem
Forecasting qualification
Btl-3
Btl-2
Btl-1 Apply advanced
Apply Local Search
Apply analytics using optimization
method and
CO5 5 R and Blind search techniques for
population based
Methods to real time applications like
search for real world
problems Travelling Salesman
problems
Problem.
2/25
12/24/2020
Po
Program Outcome
No.
Engineering Knowledge :An ability to apply knowledge of mathematics, science, engineering
PO1 fundamentals and an engineering specialization for the solution of complex engineering problems in
engineering
Problem Analysis :An ability to identify, formulate, research literature, analyze complex engineering
PO2 problems in mechanical engineering using first principles of mathematics, natural sciences and
engineering sciences
Design/ development of solutions :An ability to design solutions for complex engineering problems and
PO3 system component or processes that meet the specified needs considering public health & safety and
cultural, societal & environment
Conduct investigations of complex problems :An ability to use research-based knowledge and research
PO4 methods including design of experiments, analysis and interpretation of data and synthesis of the
information to obtain solutions to engineering problems
Modern tool usage :Ability to create, select and apply appropriate techniques, resources and modern
PO5
engineering activities, with an understanding of the limitations
The engineer and society :Ability to apply reasoning informed by the contextual knowledge to assess
PO6 societal, health, safety, legal and cultural issues and the consequent responsibilities relevant to the
professional engineering practice
Environment and sustainability Ability to demonstrate the knowledge of engineering solutions,
PO7 contemporary issues understanding their impacts on societal and environmental contexts, leading
towards sustainable development
Ethics : An ability to apply ethical principles and commit to professional ethics and responsibilities and
PO8
norms of engineering practice
Individual and team work :An ability to function effectively as an individual, and as a member or leader
PO9
in diverse teams and in multi-disciplinary settings
Communication :Ability to communicate effectively oral, written reports and graphical forms on
PO10
complex engineering activities
Project management and finance :Ability to demonstrate knowledge and understanding of the
PO11 engineering and management principles and apply those one’s own work, as a member and leader in
team, to manage projects and in multi-disciplinary environments
Lifelong learning An ability to recognize the need for and having the preparation and ability to engage
PO12
independent and life-long learning in broadest context of technological change
PSO1 An ability to design and develop software projects as well as Analyze and test user requirements.
PSO2 An Ability to gain working Knowledge on emerging software tools and technologies.
R BOOK
COI- Understanding the course [1], CH 1.1- End Semester
1 CO1 Chalk,PPT,Talk
1 handout, R Introduction 1.2, Page Exam,SEM-EXAM1
No. 1-2
3/25
12/24/2020
Book
Teaching-Learning
Sess.No. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]
R BOOK
Representation of a
COI- [1],CH 1.3- ATTN,End Semester
2 CO1 Solution, Evaluation Chalk,PPT,Talk
1 1.5,Page No. Exam,SEM-EXAM1
Function, Constraints
3-5
R BOOK
COI- Optimization Methods, [1], CH 1.6- End Semester
3 CO1 Chalk,PPT,Talk
1 Demonstrative Problems 1.7, Page Exam,SEM-EXAM1
No. 5-9
R BOOK
Importing & Exporting End Semester
COI- (1),CH 2.4-
5 CO1 Data, arrays, control Chalk,PPT,Talk Exam,MOOCs
2 2.6,Page No.
structures Review,SEM-EXAM1
24- 26
R BOOK
COI- data manipulations, date (1), CH 2.4- End Semester
6 CO1 Chalk,LTC,PPT,Talk
2 and string manipulations 2.6, Page Exam,SEM-EXAM1
No. 26- 29
R BOOK
COI- Introduction to Blind [l), CH 3. l- End Semester
7 CO2 Chalk,LTC,PPT,Talk
1 Search, Full Blind Search 3.2, Page Exam,SEM-EXAM1
No. 31-36
R BOOK
COI- Grid Search. Monte Carlo [I],CH 3.3- ATTN,End Semester
8 CO2 Chalk,LTC,PPT,Talk
1 Search 3.5,Page No. Exam,SEM-EXAM1
36-42
R BOOK
COI- Introduction to Local [l], CH 4.1- End Semester
9 CO2 Chalk,LTC,PPT,Talk
2 Search, Hill Climbing, 4.2, Page Exam,SEM-EXAM1
No. 45-49
4/25
12/24/2020
Book
Teaching-Learning
Sess.No. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]
R BOOK
Introduction to Tabu End Semester
COI- [l),CH 4.4-
11 CO2 Search, Tabu Search for Chalk,LTC,PPT,Talk Exam,MOOCs
3 4.5,Page No.
bag prices Review,SEM-EXAM1
53-56
R BOOK
COI- Comparison of Local [l), CH 4.4- End Semester
12 CO2 Chalk,LTC,PPT,Talk
3 Search Methods 4.5, Page Exam,SEM-EXAM1
No. 57- 60
R BOOK
Introduction to Population
COI- [I],CH 5.1- End Semester
13 CO3 Based Search, Genetic and Chalk,LTC,PPT,Talk
1 5.2,Page No. Exam,SEM-EXAM2
Evolutionary Algorithms
63-67
R BOOK [J
Genetic algorithm for bag
COI- ],CH S.2- ATTN,End Semester
14 CO3 prices. Genetic Algorithm Chalk,LTC,PPT,Talk
1 5.2,Page No. Exam,SEM-EXAM2
for sphere
67-70
R BOOK
Differential Evolution
COI- (l),CH 5.3- End Semester
15 CO3 algorithm, Differential Chalk,LTC,PPT,Talk
2 5.3,Page No. Exam,SEM-EXAM2
Evolution for sphere.
70-73
R BOOK
COI- Particle Swarm (l),CH 5.3- End Semester
16 CO3 Chalk,LTC,PPT,Talk
2 Optimization for sphere 5.3,Page No. Exam,SEM-EXAM2
73-78
R BOOK
End Semester
COI- Estimation of Distribution (l),CH 5.3-
17 CO3 Chalk,LTC,PPT,Talk Exam,MOOCs
3 Algorithm 5.3,Page No.
Review,SEM-EXAM2
78-83
R BOOK
Comparison of Population
COI- (l),CH 5.3- End Semester
18 CO3 Based Methods, Bag Chalk,LTC,PPT,Talk
4 5.3,Page No. Exam,SEM-EXAM2
Prices with Constraint
84-91
R BOOK
Introduction to Genetic
COI- (l),CH 5.8- End Semester
19 CO4 Programming Chalk,LTC,PPT,Talk
1 5.9,Page No. Exam,SEM-EXAM2
Applications
91-98
5/25
12/24/2020
Book
Teaching-Learning
Sess.No. CO COI Topic No[CH No] EvaluationComponents
Methods
[Page No]
R BOOK
COI- Travelling Salesman (l),CH 7.2- ATTN,End Semester
20 CO4 Chalk,LTC,PPT,Talk
1 Problem 7.2,Page No. Exam,SEM-EXAM2
119-125
R BOOK
Travelling Salesman
COI- (l),CH 7.2- End Semester
21 CO4 Problem using simulated Chalk,LTC,PPT,Talk
2 7.2,Page No. Exam,SEM-EXAM2
annealing
125-133
R BOOK
COI- (l),CH 7.3- End Semester
22 CO4 Time Series Forecasting Chalk,LTC,PPT,Talk
2 7.3,Page No. Exam,SEM-EXAM2
133-134
R BOOK
End Semester
COI- Wine Quality (l),CH 7.4-
23 CO4 Chalk,LTC,PPT,Talk Exam,MOOCs
3 Classification 7.4,Page No.
Review,SEM-EXAM2
138-145
R BOOK
(l), CH 7.4-
COI- Classifying Wine Quality End Semester
24 CO4 7.4, Page Chalk,LTC,PPT,Talk
4 using SVM Exam,SEM-EXAM2
No. 138-
145
SESSION NUMBER : 1
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 course handout explanation 1 PPT APPLICABLE
---
--- NOT
20 Introduction to R Programming 2 PPT APPLICABLE
---
5 Summary 1 Talk --- NOT
APPLICABLE
6/25
12/24/2020
---
SESSION NUMBER : 2
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Representation of a Solution 2 PPT APPLICABLE
---
--- NOT
20 Evaluation Function 2 PPT APPLICABLE
---
--- NOT
5 Summary 1 Talk APPLICABLE
---
SESSION NUMBER : 3
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Optimization Methods 2 PPT APPLICABLE
---
--- NOT
20 Demonstrative Problems 2 PPT APPLICABLE
---
--- NOT
5 Summary 1 Talk APPLICABLE
---
SESSION NUMBER : 4
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
5 Attendance/Popup/Recap 1 Talk --- NOT
APPLICABLE
7/25
12/24/2020
---
--- NOT
10 R Basic Objects 2 PPT APPLICABLE
---
--- NOT
20 Functions 2 PPT APPLICABLE
---
--- NOT
10 Controlling Execution, Writing Functions 2 PPT APPLICABLE
---
--- NOT
5 summery 1 Talk APPLICABLE
---
SESSION NUMBER : 5
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
10 Importing & Exporting Data 2 PPT APPLICABLE
---
--- NOT
20 Arrays 2 PPT APPLICABLE
---
--- NOT
10 control structures 2 PPT APPLICABLE
---
--- NOT
5 Summary 1 Talk APPLICABLE
---
SESSION NUMBER : 6
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 data manipulations 2 PPT APPLICABLE
---
20 date and string manipulations 2 PPT --- NOT
8/25
12/24/2020
APPLICABLE
---
--- NOT
5 Summary 1 Chalk APPLICABLE
---
SESSION NUMBER : 7
Session Outcome: 1 understand the concept of blind search and full blind search
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Introduction lo Blind Search 1 PPT APPLICABLE
---
--- NOT
20 Full Blind Search 1 PPT APPLICABLE
---
--- NOT
5 summary 1 Talk APPLICABLE
---
SESSION NUMBER : 8
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Grid Search. 2 PPT APPLICABLE
---
--- NOT
20 Monte Carlo Search 2 PPT APPLICABLE
---
--- NOT
5 summary 1 Talk APPLICABLE
---
SESSION NUMBER : 9
9/25
12/24/2020
Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Introduction to Local Search 2 PPT APPLICABLE
---
--- NOT
20 Hill Climbing 2 PPT APPLICABLE
---
--- NOT
5 summary 1 Talk APPLICABLE
---
SESSION NUMBER : 10
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Simulated Annealing algorithm 3 PPT APPLICABLE
---
--- NOT
20 Simulated Annealing for bag prices and sphere 3 PPT APPLICABLE
---
--- NOT
5 summary 1 Talk APPLICABLE
---
SESSION NUMBER : 11
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Introduction lo Tabu Search 3 PPT APPLICABLE
---
--- NOT
20 Tabu Search for bag prices 3 PPT APPLICABLE
---
10/25
12/24/2020
SESSION NUMBER : 12
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup/Recap 1 Talk APPLICABLE
---
--- NOT
20 Introduction to Local Search Methods 3 PPT APPLICABLE
---
--- NOT
20 Comparison of Local Search Methods 3 PPT APPLICABLE
---
--- NOT
5 summary 1 Talk APPLICABLE
---
SESSION NUMBER : 13
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 1 Talk APPLICABLE
---
--- NOT
20 Introduction to Population Based Search 1 PPT APPLICABLE
---
--- NOT
20 Genetic and Evolutionary Algorithms 1 PPT APPLICABLE
---
--- NOT
5 Summary 1 PPT APPLICABLE
---
SESSION NUMBER : 14
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
11/25
12/24/2020
SESSION NUMBER : 15
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Differential Evolution algorithm 2 PPT APPLICABLE
---
--- NOT
20 Differential Evolution for sphere 2 PPT APPLICABLE
---
--- NOT
5 Summary 2 PPT APPLICABLE
---
SESSION NUMBER : 16
Session Outcome: 1 Apply population based search method for particle swam optimization
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Particle Swarm Optimization algorithm 3 PPT APPLICABLE
---
--- NOT
20 Particle Swarm Optimization for sphere 3 PPT APPLICABLE
---
5 Summary 3 PPT --- NOT
APPLICABLE
12/25
12/24/2020
---
SESSION NUMBER : 17
Session Outcome: 1 Apply population based search method for distribution algorithm
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Estimation of Distribution Algorithm 3 PPT APPLICABLE
---
--- NOT
20 Distribution Algorithm for sphere 3 PPT APPLICABLE
---
--- NOT
5 Summary 3 PPT APPLICABLE
---
SESSION NUMBER : 18
Session Outcome: 1 Analyze constraints for bag prices method using population based techniques
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Comparison of Population Based Methods 4 PPT APPLICABLE
---
--- NOT
20 Bag Prices with Constraint 4 PPT APPLICABLE
---
--- NOT
5 Summary 4 PPT APPLICABLE
---
SESSION NUMBER : 19
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
5 Attendance/Recap/Poll/Popup Question 1 Talk --- NOT
APPLICABLE
13/25
12/24/2020
---
--- NOT
20 Introduction to Genetic Programming Applications 1 PPT APPLICABLE
---
--- NOT
20 Understand various applications of genetic programming 1 PPT APPLICABLE
---
--- NOT
5 Summary 1 PPT APPLICABLE
---
SESSION NUMBER : 20
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Travelling Salesman Problem 2 PPT APPLICABLE
---
--- NOT
20 TSP using evolutionary algorithm 2 PPT APPLICABLE
---
--- NOT
5 Summary 2 PPT APPLICABLE
---
SESSION NUMBER : 21
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 1 Talk APPLICABLE
---
--- NOT
20 Simulated annealing 3 PPT APPLICABLE
---
--- NOT
20 Travelling Salesman Problem using simulated annealing 3 PPT APPLICABLE
---
--- NOT
5 Summary 3 PPT APPLICABLE
---
14/25
12/24/2020
SESSION NUMBER : 22
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Time Series Forecasting 3 PPT APPLICABLE
---
--- NOT
20 ARIMA Methodology 3 PPT APPLICABLE
---
--- NOT
5 Summary 3 PPT APPLICABLE
---
SESSION NUMBER : 23
Session Outcome: 1 Analyze how classification can be done using wine quality
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 2 Talk APPLICABLE
---
--- NOT
20 Analyze different Classification methods 4 PPT APPLICABLE
---
--- NOT
20 Wine Quality Classification 4 PPT APPLICABLE
---
--- NOT
5 Summary 4 PPT APPLICABLE
---
SESSION NUMBER : 24
Session Outcome: 1 Understand the concept of SVM and classify Wine quality
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Recap/Poll/Popup Question 1 Talk APPLICABLE
---
20 introduction to SVM 4 PPT --- NOT
15/25
12/24/2020
APPLICABLE
---
--- NOT
20 Classifying Wine Quality using SVM 4 PPT APPLICABLE
---
--- NOT
5 Summary 1 PPT APPLICABLE
---
SESSION NUMBER : 1
16/25
12/24/2020
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to solve vectors and lists 3 PPT APPLICABLE
---
--- NOT
50 Apply R Programming to solve functions 3 PPT APPLICABLE
---
SESSION NUMBER : 2
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to solve matrices 3 PPT APPLICABLE
---
--- NOT
Apply R programming to plot various visualization
50 3 PPT APPLICABLE
methods.
---
SESSION NUMBER : 3
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R programming to solve Blind Search method 3 PPT APPLICABLE
---
--- NOT
50 Apply R programming to solve Full Blind Search method 3 PPT APPLICABLE
---
SESSION NUMBER : 4
17/25
12/24/2020
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to GRID SEARCH methods 3 PPT APPLICABLE
---
--- NOT
50 Apply R Programming to GRID SEARCH methods 3 PPT APPLICABLE
---
SESSION NUMBER : 5
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
Apply R Programming to solve MONTE CARLO
45 3 PPT APPLICABLE
SEARCH methods
---
--- NOT
Apply R Programming to solve MONTE CARLO
50 3 PPT APPLICABLE
SEARCH methods
---
SESSION NUMBER : 6
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
Apply R Programming to solve LOCAL SEARCHING
45 3 PPT APPLICABLE
METHOD HILL CLIMBING
---
--- NOT
Apply R Programming to solve LOCAL SEARCHING
50 3 PPT APPLICABLE
METHOD HILL CLIMBING
---
SESSION NUMBER : 7
18/25
12/24/2020
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to solve Tabu Search 3 PPT APPLICABLE
---
--- NOT
50 Apply R Programming to solve Tabu Search 3 PPT APPLICABLE
---
SESSION NUMBER : 8
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to solve Simulated Annealing 3 PPT APPLICABLE
---
--- NOT
50 Apply R Programming to solve Simulated Annealing 3 PPT APPLICABLE
---
SESSION NUMBER : 9
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
45 Apply R Programming to solve Genetic Algorithms 3 PPT APPLICABLE
---
--- NOT
50 Apply R Programming to solve Genetic Algorithms 3 PPT APPLICABLE
---
SESSION NUMBER : 10
19/25
12/24/2020
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Poll/Recap 1 Talk APPLICABLE
---
--- NOT
Apply R Programming to solve DIFFERENTIA L
45 3 PPT APPLICABLE
EVOLUTIONARY OPTIMIZATION ALGORITHM
---
--- NOT
Apply R Programming to solve DIFFERENTIA L
50 3 PPT APPLICABLE
EVOLUTIONARY OPTIMIZATION ALGORITHM
---
SESSION NUMBER : 11
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup 1 Talk APPLICABLE
---
--- NOT
apply R programming to solve PARTICLE SWARM
45 3 PPT APPLICABLE
OPTIMIZATION
---
--- NOT
apply R programming to solve PARTICLE SWARM
50 3 PPT APPLICABLE
OPTIMIZATION
---
SESSION NUMBER : 12
Teaching- Active
Time(min) Topic BTL Learning Learning
Methods Methods
--- NOT
5 Attendance/Popup 1 Talk APPLICABLE
---
--- NOT
apply R programming to solve 12. ESTIMATION OF
45 3 PPT APPLICABLE
DISTRIBUTION ALGORITHMS
---
--- NOT
apply R programming to solve 12. ESTIMATION OF
50 3 PPT APPLICABLE
DISTRIBUTION ALGORITHMS
---
Assignment Assignment
Week Topic Details co
Type No
Hour 1 2 3 4 5 6 7 8 9
Day Component
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Mon
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Tue
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Wed
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Thu
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
Fri Theory - - V-S1,V- V-S1,V- -- -- - - -
- - S2,V-S3,V- S2,V-S3,V- - - -
21/25
12/24/2020
- - S4 S4 - - -
- - - - -
Tutorial - - -- -- -- -- - - -
- - - - -
- - - - -
V-S1,V-S1,V-S2,V-S2,V- V-S1,V-S1,V-S2,V-S2,V-
Lab - - -- -- - - -
S3,V-S3,V-S4,V-S4 S3,V-S3,V-S4,V-S4
- - - - -
- - - - -
Skilling - - -- -- -- -- - - -
- - - - -
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Sat
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
- - - - -
Theory -- -- -- --
- - - - -
- - - - -
Tutorial -- -- -- --
- - - - -
Sun
- - - - -
Lab -- -- -- --
- - - - -
- - - - -
Skilling -- -- -- --
- - - - -
REMEDIAL CLASSES:
Supplement course handout, which may perhaps include special lectures and discussions that would be planned,
and schedule notified according
SELF-LEARNING:
Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule
notified accordingly.
Advanced Topics, Additional Reading, Research
S.no CO ALM References/MOOCS
papers and any
EVALUATION PLAN:
22/25
12/24/2020
ATTENDANCE POLICY:
Every student is expected to be responsible for regularity of his/her attendance in class rooms and laboratories,
to appear in scheduled tests and examinations and fulfill all other tasks assigned to him/her in every course
In every course, student has to maintain a minimum of 85% attendance to be eligible for appearing in Semester
end examination of the course, for cases of medical issues and other unavoidable circumstances the students will
be condoned if their attendance is between 75% to 85% in every course, subjected to submission of medical
certificates, medical case file and other needful documental proof to the concerned departments
DETENTION POLICY :
In any course, a student has to maintain a minimum of 85% attendance and In-Semester Examinations to be
eligible for appearing to the Semester End Examination, failing to fulfill these conditions will deem such student
to have been detained in that course.
PLAGIARISM POLICY :
Supplement course handout, which may perhaps include special lectures and discussions
COURSE TEAM MEMBERS, CHAMBER CONSULTATION HOURS AND CHAMBER VENUE DETAILS:
Supplement course handout, which may perhaps include special lectures and discussions
Chamber
Delivery Sections Chamber Chamber Signature of
Consultation
Name of Faculty Component of Consultation Consultation Course
Timings for each
of Faculty Faculty Day (s) Room No: faculty:
day
SANTHI L 1-MA - - - -
Munnangi
23/25
12/24/2020
Velamgini Bala
Teresa
SANTHI
Munnangi
P 1-A - - - -
Velamgini Bala
Teresa
LAKSHMI
P 1-B - - - -
PASUPULETI
VIJAYA BABU
L 3-MA - - - -
BURRA
VIJAYA BABU
P 3-A - - - -
BURRA
Sajana
P 2-B - - - -
Tiruveedhula
VIJAYA
L 2-MA - - - -
KOMPALLI
VIJAYA
P 2-A - - - -
KOMPALLI
Raju Anitha P 4-B - - - -
VIDYULLATHA
P 3-B - - - -
PELLAKURI
CHJ
L 4-MA - - - -
PASUPULETI
CHJ
P 4-A - - - -
PASUPULETI
GENERAL INSTRUCTIONS
Students should come prepared for classes and carry the text book(s) or material(s) as prescribed by the Course
Faculty to the class.
NOTICES
All notices concerning the course will be displayed on the respective Notice Boards.
Department Of CSE
24/25
12/24/2020
HEAD OF DEPARTMENT:
25/25