report 5

Course Title L T P C C Course
H
Program Code: Numerical Methods Type
and Optimization Using
CS201/CS202/IT201/CS703/
Python
CS704
2 0 2 3 4 CR
Course Code- 21CSH-459
Pre-requisite 21CSH-459/ 21ITH-459
Co-requisite
Anti-requisite NA
a. Course Description
 This course provides a comprehensive introduction to numerical methods and
optimization techniques using the Python programming language.
 Participants will gain practical skills in solving mathematical problems, simulating real-
world scenarios, optimizing processes through hands-on coding exercises and projects.
b. Course Objectives
 Understand and apply fundamental numerical methods.
 Gain knowledge of optimization concepts.
 Understand the integration of Python libraries.
 Learn to implement numerical algorithms and optimization techniques in Python.
c. Course Outcomes
CO1 Students will be able to recall the use of python with Numerical and
Optimization methods.
CO2 Students will be able to understand the techniques used for solving linear and
nonlinear Algebra.
CO3 Students will be able to apply the optimization algorithms such as gradient
descent, Newton's method, and genetic algorithms.
CO4 Students will be able to analyze the proficiency of numerical methods using
Python for implementing optimization techniques.
CO5 Students will be able to evaluate the numerical computations used for different
Python libraries, such as NumPy and SciPy.
d. Syllabus
Unit I 15Hrs
Chapter 1.1 Introduction to Python programming for numerical computation,

Basic Python syntax, data types, and control structures, Basic Python
CO1 for Calculus and Algebra.
Chapter 1.2 Data Structures (List, Tuples, Dictionaries and Sets), Use of functions
and passing different types of arguments to functions.
CO1
Chapter 1.3 Overview of Numerical Methods, Importance and applications,

NumPy and SciPy libraries for numerical computing, Root-finding
CO5 Methods : Bisection method, Newton-Raphson method, Secant
method
Experiment 1 Review of Python Basics, Data Types, Control Structures, and
Functions in Python
CO1
Experiment 2 Implementations of different Data Structures
CO1
Experiment 3 Implementing Root-finding Algorithms (Bisection method, Newton-

Raphson method) in Python
CO5
Experiment 4 Implementing Secant Algorithms in Python
CO5
Unit 2 15Hrs
Chapter 2.1 Polynomial Interpolation and Curve Fitting: Basic Algebra and
Interpolation, Lagrange interpolation, Newton interpolation,
CO2
Polynomial curve fitting, Least squares fitting
Chapter 2.2 Numerical Integration: Trapezoidal rule, Simpson's rule, Gaussian
quadrature
CO3
Chapter 2.3 Ordinary Differential Equations (ODEs): Introduction to ODEs, Euler's

method, Runge-Kutta methods, Solving ODEs with SciPy.
CO3
Experiment 2.1 Hands-on interpolation exercises using Python libraries
CO2
Experiment 2.2 Implementing numerical integration algorithms
CO3
Experiment 2.3 Implementing numerical differentiation algorithms
CO3
Unit 3 15Hrs
Chapter 3.1 Optimization Techniques: Introduction to Optimization, Types

of optimization problems, Optimization in Python,
CO4 Unconstrained Optimization: Gradient-based methods (e.g.,
gradient descent).
Chapter 3.2 Constrained Optimization: Equality and inequality constraints,
Lagrange multipliers, Linear programming, Quadratic
CO4 programming,
Chapter 3.3 Metaheuristic Optimization Algorithms: Genetic algorithms-

Fundamentals, Simulated annealing, Particle swarm
CO3 optimization.
Experiment 3.1 Write a program on Lagrange Multipliers in Python
CO4
Experiment 3.2 Write a program on Optimization with Equality and Inequality

Constraints Using Python
CO4
Experiment 3.3 Write a program to Optimization of a Multidimensional Function Using

Particle Swarm Optimization in Python
CO3
e. Textbooks Books
I. Robert Johansson,"Numerical Python: A Practical Techniques Approach for Industry".
II. Jaan Kiusalaas "Numerical Methods in Engineering with Python 3".
III. Claus Führer, "Scientific Computing with Python 3".
IV. Eric Matthes,”Python Crash Course”.
f. Reference Books
I. Rajaraman V,” Computer Oriented Numerical Methods”, Pearson Education.
II. Gerals &Whealey,” Applied Numerical Analyses”, AW.
III. Qingkai kong,”Python Programming And Numerical Methods”, AP.
g. Assessment Pattern - Internal and External

The performance of students is evaluated as follows:
Theory
Components Continuous Internal Semester End

Assessment (CAE) Examination (SEE)
Marks 40 60
Total Marks 100
Internal Evaluation Component
S. No. Type of Weightage Frequency Final Weightage in Remarks

Assessment of actual of Task Internal
conduct Assessment
1 Assignment 10 marks of One Per 10 marks As applicable
each Unit to
assignment
course types
2 Surprise 12 marks for One per 4 marks depicted
test Unit above.
each test
3 Quiz/Test 4 marks of 2 per Unit 4 marks
each
quiz
4 Homework NA One per Non-Graded:
lecture
Engagement Task
topic (of 2
questions)
5 Case study NA NA NA
6 Discussion NA One per Non Graded:
Chapter Engagement Task

7 Presentatio NA NA Non Graded:
n
Engagement Task
h. CO-PO Mapping
Course PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO

Outcome 1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3
CO2 3 2
CO3 3 2
CO4 3 2 3 2
CO5 3 2 3

report 5

Uploaded by

Copyright:

Available Formats

report 5

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

report 5

Uploaded by

Copyright:

Available Formats

Course Title L T P C C Course

Course Code- 21CSH-459

Pre-requisite 21CSH-459/ 21ITH-459

Chapter 1.1 Introduction to Python programming for numerical computation,

Chapter 1.3 Overview of Numerical Methods, Importance and applications,

Experiment 2 Implementations of different Data Structures

Experiment 3 Implementing Root-finding Algorithms (Bisection method, Newton-

Experiment 4 Implementing Secant Algorithms in Python

Chapter 2.3 Ordinary Differential Equations (ODEs): Introduction to ODEs, Euler's

Experiment 2.2 Implementing numerical integration algorithms

Experiment 2.3 Implementing numerical differentiation algorithms

Chapter 3.1 Optimization Techniques: Introduction to Optimization, Types

Chapter 3.3 Metaheuristic Optimization Algorithms: Genetic algorithms-

Experiment 3.1 Write a program on Lagrange Multipliers in Python

Experiment 3.2 Write a program on Optimization with Equality and Inequality

Experiment 3.3 Write a program to Optimization of a Multidimensional Function Using

g. Assessment Pattern - Internal and External

Components Continuous Internal Semester End

Total Marks 100

Internal Evaluation Component

S. No. Type of Weightage Frequency Final Weightage in Remarks

Chapter Engagement Task

Course PO PO PO PO PO PO PO PO PO PO PO PO PSO PSO

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.