10/12/2023, 07:43 about:blank

K L Deemed to be University
Department of Computer Science and Engineering-Honors -- KLVZA
Course Handout
2023-2024, Even Sem
Course Title :MATHEMATICAL PROGRAMMING
Course Code :22MT2004
L-T-P-S Structure : 2-2-0-0
Pre-requisite :
Credits :4
Course Coordinator :vuda sreenivasa rao
Team of Instructors :
Teaching Associates :
Syllabus :CO1: Linear Programming: Formulation of LP Problem (LPP), Graphical method, Simplex method, Transportation problem, Duality concept in LPP,
Feasibility of solution using Farka’s Lemma, Ellipsoid method, Karmarkar’s Algorithm . CO2: Combinatorial Optimization , Integer Programming, Branch &
bound algorithms, valid inequalities & cuts. Fractional Programming. Combinatorial Optimization: Approximation Algorithms, Submodular functions, Matroids,
Continuous approximation algorithms. Dynamic programming: Knapsack problem, Travelling salesman problem CO3: Non-Linear Programming : Quadratic
programs – Constrained quadratic programming problems, Beale’s method, Wolfe method, Karush-Kuhn Tucker (KKT) Conditions. Geometric Programming:
Problems with one-degree of difficulty with positive coefficients, Geometric programming with constraints, Problems with positive and negative coefficients. CO4:
Infinite Dimensional Optimization : Heuristic and Meta heuristics, Single solution vs. population-based, Parallel meta heuristics, Evolutionary algorithms, Nature-
inspired metaheuristics, Genetic Algorithm, Ant-colony optimization, Particle swarm optimization, Simulated annealing
Text Books :T1. Applied Mathematical Programming by Bradley, Hax, and Magnanti (Addison-Wesley, 1977) T2. Non Linear Programming Theory and
Algorithms by MOKHTAR S. BAZARAA, HANIF D. SHERALI and C.M. SHETTY T3. Michael Kearns and Umesh Vazirani. An Introduction to Computational
Leaning Theory. MIT Press, 1994. T4. Ant Colony Optimization by Marco Dorigo and Thomas Stutzle A Bradford book, The MIT Press. T5. Evolutionary
Optimization Algorithm by Dan Simon, Willey Edition.
Reference Books :R1 - Linear and Non Linear Programming Theory and Algorithms by MOKHTAR S. BAZARAA, HANIF D. SHERALI and C.M. SHETTY R2
- Michael Kearns and Umesh Vazirani. An Introduction to Computational Leaning Theory. MIT Press, 1994.
Web Links :W1.https://coral.ise.lehigh.edu/~ted/teaching/ie406/ W2.https://statweb.stanford.edu/~candes/teaching/math301/ W3. https://ming-
zhao.github.io/Optimization-and-earning/html/docs/conic_programming.html W4. https://epubs.siam.org/doi/book/10.1137/1.9780898718799?mobileUi=0& W5.
https://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-251j-introduction-to mathematical-programming-fall-2009/ W6.
https://nptel.ac.in/courses/111/105/111105039/ W7. https://nptel.ac.in/courses/110105096
MOOCS :Guided Regular : M1. https://www.coursera.org/learn/operations-research-modeling M2. https://www.coursera.org/learn/operations-research-
algorithms#syllabus M3. https://www.coursera.org/learn/operations-research-theory#syllabus M4. https://www.coursera.org/learn/approximation-algorithms-part-2
Self-learning Regular: M3.https://www.coursera.org/learn/linear-algebra-machine-learning M4. https://www.linkedin.com/learning/applied-machine-learning-
algorithms/ M5. https://www.coursera.org/learn/approximation-algorithms-part-2
Course Rationale :This course will cover a range of topics in Convex Optimization Programming, Geometric Programming, Stochastic Programming, and Infinite
Dimensional Optimization Problems with the objective of providing exposure to formulate the problems and find the solution to the Nonlinear optimization
problems. The rationale behind studying this subject is to give the student a working knowledge of optimization theory, techniques and methods. The emphasis is on
studying and analyzing fundamental issues in Nonlinear Programming. Apply various computational methods and tools to solve the real world problems for finding
the optimal solution.
Course Objectives :The objective of this course is to build a mathematical model as a Linear and Nonlinear programming problem for finding optimal solutions.
The methods or techniques include second order conic programming, semidefinite programming, conic duality theorem, Wolfe’s method for quadratic
programming, geometric programming with constraints, stochastic programming using Monte Carlo sampling, infinite dimensional optimization, case studies of
convex and geometric programming, and finally leading to Applications of Nonlinear programming techniques in Machine Learning to find optimal solutions for
real world problems. Use a computer package to solve a mathematical programming problem that arises in practice.

COURSE OUTCOMES (COs):

Blooms
CO Taxonomy
Course Outcome (CO) PO/PSO
NO Level
(BTL)
CO1 Apply various methods for finding the optimal solution of Linear Programming Problem. PO1,PO2 3
CO2 Apply Integer and Fractional programming approaches for solving optimization problems. PO1,PO2,PSO1 3
To express a practical problem, such as an engineering analysis or design problem and to optimize a
CO3 PSO1,PO2,PO3 3
multivariate quadratic function subject to linear constraints on the variables.
To apply and understand the search and optimization methodologies applicable to the resolution of
CO4 PSO1,PO2,PO3 3
multi-disciplinary decision problems, under a decision support framework.

COURSE OUTCOME INDICATORS (COIs)::

Outcome Highest
COI-2 COI-3
No. BTL
Btl-2 Btl-3
CO1 3 Explain LPP and Solving LPP using graphical and simplex methods, Apply Transportation problem. Make use of Ellipsoid method,
Duality problem and Problems related to Farka’s Lemma. Karmarkar’s Algorithm.
Btl-3
Btl-2
CO2 3 Solving problems related to Approximation Algorithms, Make use of
Solving Problems by Branch & Bound Techniques
Knapsack problem, Travelling salesman problem
Btl-2 Btl-3
CO3 3 Explain Geometric Programming problems with one-degree of Apply Geometric Programming for Quadratic optimization, make use
difficulty, positive coefficients, of quadratic programming.
CO4 3 Btl-2 Btl-3
Explain Ant-colony optimization, Particle swarm optimization, Apply Heuristic and Meta heuristics, Single solution vs. population-

about:blank 1/15
10/12/2023, 07:43 about:blank
Simulated annealing, Evolutionary algorithms, Workforce modeling, based, Parallel meta heuristics Nature-inspired metaheuristics. Make
Hybridization and memetic algorithms. use of Ant-colony

PROGRAM OUTCOMES & PROGRAM SPECIFIC OUTCOMES (POs/PSOs)

Po No. Program Outcome

Engineering Knowledge:Apply the knowledge of mathematics, science, engineering fundamentals, and an engineering specialization to the solution of
PO1
complex engineering problems.
Problem Analysis: Identify, formulate, review research literature, and analyse complex engineering problems reaching substantiated conclusions using first
PO2
principles of mathematics, natural sciences and engineering sciences
Design/Development of Solutions: Design solutions for complex engineering problems and design system components or processes that meet the specified
PO3
needs with appropriate consideration for the public health and safety, and the cultural, societal, and environmental considerations
Conduct Investigations of Complex Problems:Use research-based knowledge and research methods including design of experiments, analysis and
PO4 interpretation of data, and synthesis of the information to provide valid conclusions for complex problems that cannot be solved by straightforward
application of knowledge, theories and techniques applicable to the engineering discipline.
Modern Tool Usage:Create, select, and apply appropriate techniques, resources, and modern engineering and IT tools including prediction and modelling to
PO5
complex engineering activities with an understanding of the limitations.
The Engineer and Society:Apply reasoning informed by the contextual knowledge to assess societal, health, safety, legal and cultural issues and the
PO6
consequent responsibilities relevant to the professional engineering practice.
Environment and Sustainability:Understand the impact of the professional engineering solutions in societal and environmental contexts, and demonstrate
PO7
the knowledge of, and need for sustainable development
PO8 Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the engineering practice
PO9 Individual and Team Work: Function effectively as an individual, and as a member or leader in diverse teams, and in multidisciplinary settings.
Communication:Communicate effectively on complex engineering activities with the engineering community and with society at large, such as, being able
PO10
to comprehend and write effective reports and design documentation, make effective presentations, and give and receive clear instructions
Project Management and Finance: Demonstrate knowledge and understanding of the engineering and management principles and apply these to one’s own
PO11
work, as a member and leader in a team, to manage projects and in multidisciplinary environments.
Life-long Learning: Recognize the need for, and have the preparation and ability to engage in independent and lifelong learning in the broadest context of
PO12
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.

Lecture Course DELIVERY Plan:

Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods

Discussion on
Course
COI-
1 CO1 Handout, Handout Documents Talk ATTN
2
Question
Paper Pattern

ATTN,End Semester
Introduction to
Exam,Flipped Discussion
Linear
COI- Engagement,Pre-Class
2 CO1 Programming R3, Ch6 pp-166-70 Chalk,LTC,PPT,Talk
2 Assessment,Product/Prototy
Problems
Demonstration,SEM-
(LPP)
EXAM1,Tutorial

ATTN,End Semester
Formulation of Exam,Flipped Discussion
LP Problem Engagement,Home
COI-
3 CO1 (LPP) – R3-Ch6 pp-171-186 Chalk,LTC,PPT,Talk Assignment,Pre-Class
2
Graphical Assessment,Product/Prototy
method Demonstration,SEM-
EXAM1,Tutorial

ATTN,End Semester
Linear
Exam,Flipped Discussion
programming
COI- Engagement,Home
4 CO1 concept in R3-Ch4 pp-171-186. Chalk,LTC,PPT,Talk
3 Assignment,Pre-Class
Simplex
Assessment,SEM-
method,
EXAM1,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
COI- Transportation Engagement,Home
5 CO1 B.No.-T1[CH13] [Page No. 433-437]* Chalk,LTC,PPT,Talk
2 problem Assignment,Pre-Class
Assessment,SEM-
EXAM1,Tutorial

Duality ATTN,End Semester

concept in Exam,Flipped Discussion
LPP, Engagement,Home
COI-
6 CO1 Feasibility of https://stanford.edu/~boyd/papers/pdf/scs_long.pdf Chalk,LTC,PPT,Talk Assignment,Pre-Class
3
solution using Assessment,Product/Prototy
Farka’s Demonstration,SEM-
Lemma EXAM1,Tutorial

7 CO1 COI- Ellipsoid https://web.mat.bham.ac.uk/Y.Zhao/My%20publication/Presentation2013.pdf Chalk,LTC,PPT,Talk ATTN,End Semester

about:blank 2/15
10/12/2023, 07:43 about:blank
Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods
3 method, Exam,Flipped Discussion
Karmarkar’s Engagement,Home
Algorithm Assignment,Pre-Class
Assessment,Product/Prototy
Demonstration,SEM-EXAM

ATTN,End Semester
Integer Exam,Flipped Discussion
Programming, Engagement,Home
COI-
8 CO2 Branch & B2- 189-234 Chalk,LTC,PPT,Talk Assignment,Pre-Class
2
bound Assessment,Product/Prototy
algorithms Demonstration,SEM-
EXAM1,Tutorial

ATTN,End Semester
Gomory cut Exam,Flipped Discussion
plane method , Engagement,Home
COI-
9 CO2 valid B3-342-389 Chalk,LTC,PPT,Talk Assignment,Pre-Class
3
inequalities & Assessment,Product/Prototy
cuts Demonstration,SEM-
EXAM1,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
COI- Fractional Engagement,Pre-Class
10 CO2 B4- 233-319 Chalk,LTC,PPT,Talk
3 Programming. Assessment,Product/Prototy
Demonstration,SEM-
EXAM1,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Approximation
Engagement,Home
COI- Algorithms,
11 CO2 B.No.-T1[CH13] [Page No. 411-415] Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 Submodular
Assessment,Product/Prototy
functions,
Demonstration,SEM-
EXAM1,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Matroids ,
Engagement,Home
COI- Continuous
12 CO2 B.No.-T6[CH8] [Page No. 425-429] Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 approximation
Assessment,Product/Prototy
algorithms
Demonstration,SEM-
EXAM1,Tutorial

Dynamic ATTN,End Semester

programming: Exam,Flipped Discussion
Knapsack Engagement,Home
COI-
13 CO2 problem, B.No.-T1[CH13] [Page No. 420-422] Chalk,LTC,PPT,Talk Assignment,Pre-Class
3
Travelling Assessment,Product/Prototy
salesman Demonstration,SEM-
problem EXAM1,Tutorial

Introduction of
Non-Linear ATTN,End Semester
Programming : Exam,Flipped Discussion
Quadratic Engagement,Home
COI-
14 CO3 programs – https://www.frontiersin.org/articles/10.3389/fceng.2020.622241/full Chalk,LTC,PPT,Talk Assignment,Pre-Class
2
Constrained Assessment,Product/Prototy
quadratic Demonstration,SEM-
programming EXAM2,Tutorial
problems,

ATTN,End Semester
Exam,Flipped Discussion
Beale’s Engagement,Home
COI- method, Assignment,MOOCs
15 CO3 B.No.-T6[CH6] [Page No. 322-325] Chalk,LTC,PPT,Talk
3 Wolfes Review,Pre-Class
method, Assessment,Product/Prototy
Demonstration,SEM-
EXAM2,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Karush-Kuhn Engagement,Home
COI-
16 CO3 Tucker (KKT) B.No 4.-T6[CH6] [Page No. 322-325] Chalk,LTC,PPT,Talk Assignment,Pre-Class
3
Conditions, Assessment,Product/Prototy
Demonstration,SEM-
EXAM2,Tutorial

17 CO3 COI- Geometric https://www.ima.umn.edu/materials/2015-2016/ND8.1- Chalk,LTC,PPT,Talk ATTN,End Semester

3 Programming: 12.16/25374/morton_ima.pdf Exam,Flipped Discussion

about:blank 3/15
10/12/2023, 07:43 about:blank
Teaching-Learning
Sess.No. CO COI Topic Book No[CH No][Page No] EvaluationComponents
Methods
Problems with Engagement,Home
one-degree of Assignment,Pre-Class
difficulty with Assessment,Product/Prototy
positive Demonstration,SEM-
coefficients, EXAM2,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Geometric
Engagement,Home
COI- programming
18 CO3 B4: page number 234-267 Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 with
Assessment,Product/Prototy
constraints,
Demonstration,SEM-
EXAM2,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Problems with
Engagement,Home
COI- positive and
19 CO3 T4 -246-288 Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 negative
Assessment,Product/Prototy
coefficients
Demonstration,SEM-
EXAM2,Tutorial

ATTN,End Semester
Infinite
Exam,Flipped Discussion
Dimensional
Engagement,Home
COI- Optimization :
20 CO3 B.No.-T3[CH1] Page No. 12-14 Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 Heuristic and
Assessment,Product/Prototy
Meta
Demonstration,SEM-
heuristics,
EXAM2,Tutorial

ATTN,Flipped Discussion
Single solution Engagement,Home
COI-
21 CO4 vs. population- B.No.-T5 [CH5] Page No. 98-103 Chalk,LTC,PPT,Talk Assignment,Pre-Class
2
based Assessment,SEM-
EXAM2,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
COI- Parallel meta Engagement,Home
22 CO4 B.No.-T5 [CH5] Page No. 98-103 Chalk,LTC,PPT,Talk
3 heuristics, Assignment,Pre-Class
Assessment,Prototype
Demonstration,SEM-EXAM

ATTN,End Semester
Exam,Flipped Discussion
COI- Evolutionary Engagement,Home
23 CO4 B.No.-T4[CH2] Page No. 25-33 Chalk,LTC,PPT,Talk
3 algorithms, Assignment,Pre-Class
Assessment,Prototype
Demonstration,SEM-EXAM

End Semester Exam,Flipped

Discussion
Nature- Engagement,Home
COI-
24 CO4 inspired B.No.-T5[CH3] Page No. 223-241 Chalk,LTC,PPT,Talk Assignment,Pre-Class
2
metaheuristics Assessment,Product/Prototy
Demonstration,SEM-
EXAM2,Tutorial

ATTN,End Semester
Exam,Flipped Discussion
Genetic
Engagement,Home
COI- Algorithm,
25 CO4 B.No.-T5 [CH8] Page No. 189-212 Chalk,LTC,PPT,Talk Assignment,Pre-Class
3 Ant-colony
Assessment,Product/Prototy
optimization,
Demonstration,SEM-
EXAM2,Tutorial

ATTN,End Semester
Particle swarm Exam,Flipped Discussion
COI- optimization, Engagement,Pre-Class
26 CO4 B.No.-T5 [CH8] Page No. 289-317 Chalk,LTC,PPT,Talk
3 Simulated Assessment,Product/Prototy
annealing Demonstration,SEM-
EXAM2,Tutorial

Lecture Session wise Teaching – Learning Plan

SESSION NUMBER : 1

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 4/15
10/12/2023, 07:43 about:blank
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Tell the course objectives , the course outcomes 1 PPT
APPLICABLE ---
--- NOT
20 Explain the course structure 1 PPT
APPLICABLE ---
--- NOT
5 Recall the session 2 Talk
APPLICABLE ---

SESSION NUMBER : 2

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Define linear programming , Tell the Formulation of linear programming 2 PPT
APPLICABLE ---
20 Solve the problems on Formulation of linear programming, convex optimization 3 PPT Group Discussion
--- NOT
5 Recall the session 2 Talk
APPLICABLE ---

SESSION NUMBER : 3

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Expl;ain Graphical method 2 PPT
APPLICABLE ---
20 apply Graphical method problem in real time application 3 PPT Think / Pair / Share
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 4

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 1 Talk
APPLICABLE ---
--- NOT
20 Define Graphical method, Simplex method Illustrate Graphical method, Simplex method 2 PPT
APPLICABLE ---
20 Solve Problems on Graphical method, Simplex method 3 PPT One minute paper
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 5

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain Transportation problem in real time application 2 PPT
APPLICABLE ---
20 Solve problems on Transportation problem 3 PPT Think / Pair / Share
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 6

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain Duality concept problem method in real time application 2 PPT
APPLICABLE ---
20 Apply Duality concept problem method in real time application 3 PPT Group Discussion
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 7

about:blank 5/15
10/12/2023, 07:43 about:blank
No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Explain Karmarkar’s Algorithm problem method 2 PPT Quiz/Test Questions
--- NOT
20 apply Karmarkar’s Algorithm problem method in real time application 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 8

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain nteger programming method 2 PPT
APPLICABLE ---
--- NOT
20 Apply Integer programming method in real time application 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 9

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain Geometric programming with constraints method 2 PPT
APPLICABLE ---
20 apply Geometric programming with constraints method in real time application 3 Chalk Think / Pair / Share
--- NOT
5 Recall the session 3 Chalk
APPLICABLE ---

SESSION NUMBER : 10

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 apply Fractional programs programming with constraints method 3 PPT Seminars
--- NOT
20 solve problems on Constrained quadratic programming 3 Chalk
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 11

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Approximation Algorithms, Submodular functions with constraints method 3 PPT
APPLICABLE ---
apply Approximation Algorithms, Submodular functions with constraints method in real time
20 3 Talk Case Study
application
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 12

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain Matroids , Continuous approximation algorithms 3 PPT
APPLICABLE ---

about:blank 6/15
10/12/2023, 07:43 about:blank
20 apply Matroids , Continuous approximation algorithms in real time application 3 Chalk Think / Pair / Share
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 13

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Define dynamic programming Illustrate Knapsack problem 3 PPT Case Study
--- NOT
20 Solve problems on Travelling salesman problem 3 Chalk
APPLICABLE ---
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 14

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Define Non linear Programming Illustrate quadratic Programming 2 PPT Group Discussion
--- NOT
20 Explain constrained quadratic Problems 3 Talk
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 15

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Illustrate beale’s method Illustrate Wolfe method 2 PPT Brain storming session
--- NOT
20 Apply beale’s method Illustrate Wolfe method 3 Chalk
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 16

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 understand Karush-Kuhn Tucker (KKT) Conditions 3 PPT
APPLICABLE ---
20 apply Karush-Kuhn Tucker (KKT) Conditions,in real time application 3 Chalk One minute paper
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 17

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 DefineGeometric programming Explain one-degree of difficulty, positive coefficients 3 PPT
APPLICABLE ---
20 Solve problemswith one-degree of difficulty with positive coefficients 3 Chalk Group Discussion
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 18

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 7/15
10/12/2023, 07:43 about:blank
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Geometric programming with constraints, method i 3 Chalk Think / Pair / Share
--- NOT
20 apply Geometric programming with constraints, method in real time application 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 19

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Define Quadratic programs Illustrate constrained Quadratic programs 3 PPT
APPLICABLE ---
20 solve problems on Constrained quadratic programming 3 Talk Group Discussion
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 20

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Tell Infinite-dimensional optimization 2 PPT
APPLICABLE ---
--- NOT
20 Apply Catenoid identification methods 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 21

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
Explain the difference between Single solution vs. population-based Demonstrate Heuristic --- NOT
20 3 PPT
and Meta heuristics APPLICABLE ---
--- NOT
20 Solve problem on Heuristic and Meta heuristics 3 Chalk
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 22

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Explain Parallel meta heuristics Nature-inspired metaheuristics 3 PPT Quiz/Test Questions
--- NOT
20 Solve problemson meta heuristics 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 23

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Explain Ant-colony optimization 3 PPT
APPLICABLE ---
20 Solve problems on Ant-colony optimization and Particle swarm optimization 3 PPT Quiz/Test Questions
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

about:blank 8/15
10/12/2023, 07:43 about:blank
SESSION NUMBER : 24

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
--- NOT
20 Demonstrate Evolutionary algorithms 3 PPT
APPLICABLE ---
20 Solve problems on Simulated annealing and Evolutionary algorithms 3 PPT Group Discussion
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 25

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Demonstrate Evolutionary algorithms 3 PPT Seminars
--- NOT
20 Solve problems on Simulated annealing and Evolutionary algorithms 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 26

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 2 Talk
APPLICABLE ---
20 Explain Particle swarm optimization, Simulated annealing 3 PPT Brain storming session
--- NOT
20 apply Particle swarm optimization, Simulated annealing in project 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

Tutorial Course DELIVERY Plan:

List of Experiments supposed to finish in Open Lab Sessions:

Lab
session List of Experiments CO-Mapping
no

1 Linear Programming Using python CO1

2 Graphical Method and Simplex method CO1

3 Duality method CO1

4 Transportation Problem CO1

5 Integer Programming on Cutting plane Method, Branch and Bound CO2

6 Learning CVXOPT Package for Convex Optimization using Python CO2

7 Estimating global maxima and minima of Convex/Concave functions CO3

8 Quadratic Optimization using Wolfe’s method CO3

9 Quadratic Optimization using Beale method CO3

10 Solving Quadratic Programming Using KKT Conditions CO3

11 Ant-Colony Optimization CO4

12 Particle Swarm Optimization CO4

13 Simulated Annealing CO4

Tutorial Session wise Teaching – Learning Plan

about:blank 9/15
10/12/2023, 07:43 about:blank
SESSION NUMBER : 1

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 3 PPT
APPLICABLE ---
--- NOT
40 Linear Programming Using python 3 PPT
APPLICABLE ---
--- NOT
40 Linear Programming Using python 3 PPT
APPLICABLE ---
--- NOT
10 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 2

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
40 Graphical Method and Simplex method 3 PPT
APPLICABLE ---
--- NOT
40 Graphical Method and Simplex method 3 PPT
APPLICABLE ---
--- NOT
10 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 3

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
40 Duality method 3 PPT
APPLICABLE ---
--- NOT
40 Duality method 3 PPT
APPLICABLE ---
--- NOT
10 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 4

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
40 Transportation Problem 3 PPT
APPLICABLE ---
--- NOT
40 Transportation Problem 3 PPT
APPLICABLE ---
--- NOT
10 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 5

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
10 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
40 Integer Programming using python 3 PPT
APPLICABLE ---
--- NOT
45 Integer Programming using python 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 6

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods

about:blank 10/15
10/12/2023, 07:43 about:blank
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Concepts of Convex sets and Optimization Techniques 3 PPT
APPLICABLE ---
--- NOT
45 Concepts of Convex sets and Optimization Techniques-Formulation 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 Talk
APPLICABLE ---

SESSION NUMBER : 7

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Evaluation of global maxima and minima of Convex/Concave functions 3 Talk
APPLICABLE ---
--- NOT
45 Evaluation of global maxima and minima of Convex/Concave functions 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 8

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Quadratic Optimization using Wolfe’s method 3 PPT
APPLICABLE ---
--- NOT
45 Quadratic Optimization using Wolfe’s method using python 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 9

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Quadratic Optimization using Beale method 3 PPT
APPLICABLE ---
--- NOT
45 Quadratic Optimization using Beale method using python 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 10

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 PPT
APPLICABLE ---
--- NOT
45 Solving Quadratic Programming Using KKT Conditions 3 PPT
APPLICABLE ---
--- NOT
45 Solving Quadratic Programming Using KKT Conditions using pythom 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 11

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Ant-Colony Optimization 3 PPT
APPLICABLE ---
45 Ant-Colony Optimization 3 PPT --- NOT

about:blank 11/15
10/12/2023, 07:43 about:blank
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 12

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 PPT
APPLICABLE ---
--- NOT
45 Particle Swarm Optimization 3 PPT
APPLICABLE ---
--- NOT
45 Particle Swarm Optimization 3 PPT
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

SESSION NUMBER : 13

No Session Outcomes are mapped

Teaching- Learning Active Learning

Time(min) Topic BTL
Methods Methods
--- NOT
5 Attendance/Recap; Poll/Pop Question 3 Talk
APPLICABLE ---
--- NOT
45 Simulated Annealing using python 3 PPT
APPLICABLE ---
--- NOT
45 Simulated Annealing using python 3 Chalk
APPLICABLE ---
--- NOT
5 Recall the session 3 PPT
APPLICABLE ---

Practical Course DELIVERY Plan: NO Delivery Plan Exists

Practical Session wise Teaching – Learning Plan

No Session Plans Exists

Skilling Course DELIVERY Plan: NO Delivery Plan Exists

Skilling Session wise Teaching – Learning Plan

No Session Plans Exists

WEEKLY HOMEWORK ASSIGNMENTS/ PROBLEM SETS/OPEN ENDEDED PROBLEM-SOLVING EXERCISES etc:

Assignment
Week Assignment Type Topic Details co
No
Given Value weight 10 5 40 4 30 6 50 3 W=10
Weekly Homework
7 1 Dynamic Programming Solve the above 0/1 knapsack problem is CO2
Assignments
solved using dynamic programming
Use Wolfe’s method for solving quadratic
Weekly Homework equation Max Z= 4x_1+6x_2-2x_1^2-2x_1
9 1 Quadratic Programming CO3
Assignments x_2-2x_2^2 Subject to: x_1+2x_2≤2 and
x_1,x_2≥0
Solve using Particle Swarm Optimization
Weekly Homework Maximize: f(x)=x_1^2-x_1
11 1 Particle Swarm Optimization Algorithm CO4
Assignments x_2+x_2^2+2x_1+4x_2+3 Where
-5≤x_1,x_2≤5
4. An ANT is at a distance of 5m from the
TREE 15m from CAR and 4m from a DOLL,
Weekly Homework the distance between TREE and the CAR is
13 1 Ant Colony Optimization Algorithm CO4
Assignments 4m,CAR and DOLL is 1m ,DOLL and TREE
is 8m.Create a matrix and solve using Ant
Colony Optimization.
1. A hotel has requested a manufacturer to
produce pants and jackets for their boys. For
materials, the manufacturer has 750 m² of
cotton textile and 1,000 m² of silk. Every pair
of pants (1 unit) needs 2 m² of silk and 1 m² of
cotton. Every jacket needs 1.5 m² of cotton and
Weekly Homework
2 1 Solve a LPP using Simplex Method 1 m² of silk. The price of the pants is fixed at CO1
Assignments
$50 and the jacket, $40. What is the number of
pants and jackets that the manufacturer must
give to the hotel so that these items obtain a
maximum sale? Formulate the problem using
mathematical modeling of LPP and solve the
LPP using Simplex Method.

about:blank 12/15
10/12/2023, 07:43 about:blank
The distribution manager of a company needs
to minimize global transport costs between a
set of three factories (supply points) S1, S2,
and S3, and a set of four distributors (demand
points) D1, D2, D3, and D4. The following
table shows the transportation cost from each
Weekly Homework supply point to every demand point, the supply
4 1 Transportation Problem CO1
Assignments of the product at the supply points, and the
demand of the product at the demand points
F/D D1 D2 D3 D4 Supply S1 19 30 50 10 7 S2
70 30 40 60 9 S3 40 8 70 20 18 Demand 5 8 7
14 34 Solve Transportation problem using
Column Minimum method in Linear
Programming
Discrete Optimization using Cutting Plane
method Solve the integer programming
problem Maximize: Z=3x1+x2+3x3 Subject to
Weekly Homework
6 1 Integer Programming -x1+2x2+x3≤4 2x2-3/2 x3≤1 x1-3x2+2x3≤3 CO2
Assignments
Where x1,x2,x3≥0 and integer. Get the optimal
solution as an integer value using Gomory’s
cutting plane method.

COURSE TIME TABLE:

Hour 1 2 3 4 5 6 7 8 9
Day Component
-- -- V-S36,V-S37,V- V-S36,V-S37,V- --
Theory --- --- -- --
- - S38,V-S39 S38,V-S39 -
-- -- -- V-S26,V-S27,V- V-S26,V-S27,V-
Tutorial -- -- --- ---
- - - S28,V-S29 S28,V-S29
Mon
-- -- --
Lab -- -- --- --- -- --
- - -
-- -- --
Skilling -- -- --- --- -- --
- - -
-- -- V-S16,V-S17,V- V-S16,V-S17,V- --
Theory --- --- -- --
- - S18,V-S19 S18,V-S19 -
-- -- -- V-S31,V-S32,V- V-S31,V-S32,V-
Tutorial -- -- --- ---
- - - S33,V-S34,V-S35 S33,V-S34,V-S35
Tue
-- -- --
Lab -- -- --- --- -- --
- - -
-- -- --
Skilling -- -- --- --- -- --
- - -
-- -- V-S21,V-S22,V- V-S21,V-S22,V- --
Theory --- --- -- --
- - S23,V-S24,V-S25 S23,V-S24,V-S25 -
-- -- -- V-S11,V-S12,V- V-S11,V-S12,V-
Tutorial -- -- --- ---
- - - S13,V-S14,V-S15 S13,V-S14,V-S15
Wed
-- -- --
Lab -- -- --- --- -- --
- - -
-- -- --
Skilling -- -- --- --- -- --
- - -
-- -- V-S31,V-S32,V- V-S31,V-S32,V- --
Theory --- --- -- --
- - S33,V-S34,V-S35 S33,V-S34,V-S35 -
-- -- -- V-S21,V-S22,V- V-S21,V-S22,V-
Tutorial -- -- --- ---
- - - S23,V-S24,V-S25 S23,V-S24,V-S25
Thu
-- -- --
Lab -- -- --- --- -- --
- - -
-- -- --
Skilling -- -- --- --- -- --
- - -
-- -- V-S11,V-S12,V- V-S11,V-S12,V- --
Theory -- -- --- ---
- - S13,V-S14,V-S15 S13,V-S14,V-S15 -
-- -- V-S36,V-S37,V- V-S36,V-S37,V- --
Tutorial -- -- --- ---
- - S38,V-S39 S38,V-S39 -
Fri
-- -- --
Lab -- -- -- -- --- ---
- - -
-- -- --
Skilling -- -- -- -- --- ---
- - -
-- -- V-S26,V-S27,V- V-S26,V-S27,V- --
Theory --- --- -- --
- - S28,V-S29 S28,V-S29 -
-- -- -- V-S16,V-S17,V- V-S16,V-S17,V-
Tutorial -- -- --- ---
- - - S18,V-S19 S18,V-S19
Sat
-- -- --
Lab -- -- --- --- -- --
- - -
-- -- --
Skilling -- -- --- --- -- --
- - -
Sun Theory -- -- -- -- -- -- -- -- --
Tutorial -- -- -- -- -- -- -- -- --
Lab -- -- -- -- -- -- -- -- --

about:blank 13/15
10/12/2023, 07:43 about:blank
Skilling -- -- -- -- -- -- -- -- --

REMEDIAL CLASSES:

Supplement course handout, which may perhaps include special lectures and discussions that would be planned, and schedule notified according

SELF-LEARNING:

Assignments to promote self-learning, survey of contents from multiple sources.

S.no Topics CO ALM References/MOOCS

DELIVERY DETAILS OF CONTENT BEYOND SYLLABUS:

Content beyond syllabus covered (if any) should be delivered to all students that would be planned, and schedule notified accordingly.
S.no Advanced Topics, Additional Reading, Research papers and any CO ALM References/MOOCS

EVALUATION PLAN:

Evaluation Type Evaluation Component Weightage/Marks Assessment Dates Duration (Hours) CO1 CO2 CO3 CO4
End Semester Weightage 30 7.5 7.5 7.5 7.5
End Semester Exam 180
Summative Max Marks 100 25 25 25 25
Evaluation Weightage 10 2.5 2.5 2.5 2.5
Total= 40 % Product/Prototype Demonstration 120
Max Marks 50 12.5 12.5 12.5 12.5
In Semester Weightage 12.5 6.25 6.25
Semester in Exam-I 90
Summative Max Marks 50 25 25
Evaluation Weightage 12.5 6.25 6.25
Total= 25 % Semester in Exam-II 90
Max Marks 50 25 25
Weightage 10 2.5 2.5 2.5 2.5
Tutorial 90
In Semester Max Marks 40 10 10 10 10
Formative Weightage 10 2.5 2.5 2.5 2.5
Pre-Class Assessment 90
Evaluation Max Marks 40 10 10 10 10
Total= 35 %
Weightage 15 3.75 3.75 3.75 3.75
Flipped Discussion Engagement 90
Max Marks 40 10 10 10 10

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
Delivery Component Sections of Chamber Chamber Consultation Chamber Consultation Signature of
Name of Faculty
of Faculty Faculty Consultation Day (s) Timings for each day Room No: Course faculty:
Konda Reddy 27-MA,37-
L - - - -
Nalamalapu MA,17-MA
Konda Reddy 17-MA,27-
T - - - -
Nalamalapu MA,37-MA
Mohammed 11-MA,21-
L - - - -
Moulana MA,31-MA
Mohammed 11-MA,21-
T - - - -
Moulana MA,31-MA
Vamsidhar 12-MA,22-
L - - - -
EniReddy MA,32-MA
Vamsidhar 12-MA,22-
T - - - -
EniReddy MA,32-MA
36-MA,16-
Ch Ramana Murthy L - - - -
MA,26-MA
16-MA,26-
Ch Ramana Murthy T - - - -
MA,36-MA
Govind D L 13-MA,34-MA - - - -

about:blank 14/15
10/12/2023, 07:43 about:blank
Govind D T 34-MA,13-MA - - - -
Bikram Basaba L 15-MA,33-MA - - - -
Bikram Basaba T 15-MA,33-MA - - - -
Akhilesh Dubey L 28-MA,38-MA - - - -
Akhilesh Dubey T 28-MA,38-MA - - - -
SamudraVijaya K L 23-MA - - - -
SamudraVijaya K T 23-MA - - - -
Rojalini Patro L 39-MA - - - -
Rojalini Patro T 39-MA - - - -
Murali Puttagunta L 18-MA,29-MA - - - -
Murali Puttagunta T 18-MA,29-MA - - - -
19-MA,24-
vuda sreenivasa rao L - - - -
MA,35-MA
24-MA,35-
vuda sreenivasa rao T - - - -
MA,19-MA
Lakshmi Ramani
L 14-MA,25-MA - - - -
Burra
Lakshmi Ramani
T 25-MA,14-MA - - - -
Burra

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

Most of the notices are available on the LMS platform.

All notices will be communicated through the institution email.

All notices concerning the course will be displayed on the respective Notice Boards.

Signature of COURSE COORDINATOR

(vuda sreenivasa rao)

Signature of Department Prof. Incharge Academics & Vetting Team Member

Department Of CSE-Honors

HEAD OF DEPARTMENT:

Approval from: DEAN-ACADEMICS

(Sign with Office Seal) [object HTMLDivElement]

about:blank 15/15