Mathematics 20 Mathematical Modelling for Computer Science
2008-2009 - REA2002 - 10 ECTS

On the basis of

REA1042 Mathematics 10, REA 1051 Mathematics 15

Expected learning outcomes

The student shall gain familiarity with some basic concepts, types of problems and methods of solution needed for technical applications.

Topic(s)

Graphs: Basic theory, weighted graphs, Dijkstra's algorithm.

Trees: Spanning trees, Prim's algorithm.

Networks: Flow, Ford-Fulkerson's algorithm.

Series: Geometric series, convergence, criteria for convergence, power series, Taylor series.

Fourier series: Periodic functions, trigonometric series, Fourier series, even and odd functions, half-range expansions.

Functions with several variables: Graphs of functions with two variables, partial derivatives, maximum and minimum value problems, total differentials, increments.

Teaching Methods

Lectures
Exercises

Form(s) of Assessment

Written exam, 4 hours

Grading Scale

Alphabetical Scale, A(best) – F (fail)

Re-sit examination

Re-sit examination will be arranged.

Examination support

Approved calculator .

Haugan, J. Tabeller og formelsamling. NKI-forlaget. ISBN 82-562-2483-5

Coursework Requirements

None

Teaching Materials

Lorentzen, Hole og Lindstrøm: Kalkulus med en og flere variable, Universitetsforlaget. ISBN 82-00-42433-2

Hans Engenes: Grafer, trær og nettverk (lecture notes).

Hans Engenes: Fourierrekker (lecture notes).