Numerical solutions to non linear equations
Introduction
We consider one of the most basic problems of
numerical approximation, the root-finding
problem.
This process involves finding a root, or solution,
of an equation of the form f(x) = 0.
A root of

Recursion
Lecture 3
Outline
Recursion
Recursion Vs Iteration
Implementation of recursion
Recursion Examples
Analysis of recursion
Memoization
Introductory Example
Suppose you are responsible for alarming a large group of
people in case of an emergency
E

s
i
s
y
l
a
n
A
m
h
t
i
r
o
g
l
A
Lecture 2
Objectives
Understand the meaning of an algorithm.
Describe various applications of algorithms.
Distinguish between empirical and analytical methods for analyzing
algorithms.
Understand the use of Big-Oh not

DATA
&
S
E
R
U
T
C
U
R
T
S
S
M
H
T
I
ALGOR
L EC T UR E 1
1
1
0
2
,
0
1
r
e
Octob
6
Objectives
Understand the concept of data structure
Distinguish between data structures and data types
Learn how data structures are organized in the computer
Describe

MTH 2203 Numerical Analysis
John Ngubiri
0776543466, ngubiri@cis.mak.ac.ug
Course content
Errors and their propagations
Numerical solutions to non-linear equations
Numerical solutions for systems of linear
equations
Numerical differentiation
Langranges In