Gongo La Mboto, Pugu Road
P.O Box 9790, Dar es Salaam–Tanzania
Tel: …………………………………
E-mail: info@kiut.ac.tz
Website: www.kiut.ac.tz
FACULTY OF COMPUTING MANAGEMENT AND SOCIALSCIENCE
DEPARTMENT OF COMPUTING
DATE: 19th MARCH 2024
SUBJECT: COURSE FILE
1. Particulars:
a) Course Instructor: CHRISTOPHER KAHOLA
b) Day Time Contact:+255 679 986904
c) Email: chriskahola56@gmail.com
d) Course Title/Subject: Introduction to Scientific Computing
e) Course Code: DCS 2202
f) Notional Hours Per Week: 3 Hours
g) Time of the Week: Thursday 04:15 PM – 05:15 PM (Theory) Friday 10:15 AM -12:15
PM;
h) Venue: H12
i) Mode of Assessment: Lectures, reading assignment and Class discussions
j) Study Session: Day
k) Course Program: Diploma in Computer Science(DCS)
l) Coordinating Department: Department of Computing
m) Semester and Year of Study: Semester One of 2023/2024
n) Academic Year: 2023/2024
2. Lecture Requirements
a) Prerequisite: None
b) Learning Context: The Course will be taught through lectures, discussions, assignments,
practical session
c) Learning Materials: White Boards, Marker pens, Handouts, Laptop Computer, Projector
1
“Exploring The Heights”
3. Course Requirements:
d) Assessment Details and Related Requirements:
Continuous assessment tests (CAT 1 & CAT 2) 30
Class assignment(Individual and Group) 10
End of semester examination 60
Total 100
4. Description of the Course Unit: This course provides an overview of scientific computing,
i. e. of the different tasks to be tackled on the way towards powerful numerical simulations.
Starting from mathematical models (derivation, analysis, and classification; various
examples), their numerical treatment is discussed (discretization of differential systems,
grid generation). The course is conceived as an introduction to the thriving field of
numerical simulation for computer scientists, mathematicians, engineers, or natural
scientists without an already strong background in numerical method
5. Overall Learning Outcomes:
Development of algorithms for the numerical solution of mathematical problems
The study of the numerical stability of these algorithms
2
“Exploring The Heights”
6. Course Plan in the Semester
S/No Week Topic to be Covered Time/Durati Teaching References
and on Methodology
Month
of Study
Week 1: Topic 1: Basic 3 Hours Lectures Facilitator’s
Calculus Class compiled
Functions and discussions notes
functions Reading
notation. assignment
Limits
Derivatives
Integrals
Week 2: Topic 2: Root finding 3 Hours Lectures Facilitator’s
Bisection Class compiled
method discussion
Reading notes
Fixed Point
Iteration assignment
Newton’s
method
Secant method
3
“Exploring The Heights”
Week 3: Topic 3 Hours Lectures Facilitator’s
3:Combinatorics Class compiled
Fundamental discussion
Theorem of notes
Reading
Counting
Factorial assignment
Notations
Permutation
Combinations
Week 4: CONTINUOUS ASSESSMENT TEST 1
Week 5: Topic 3: Errors and 3 Hours Lectures Facilitator’s
Error propagation Class compiled
Relative error, discussion
Absolute error Reading notes
and Cancelation assignment
Truncation error
Iterative
methods
Week 6: Topic 4: Interpolation 3 Hours Lectures Facilitator’s
The Class compiled
Vandermonde discussion
Reading notes
Matrix
Lagrange Form assignment
Hermite
Interpolation
Wee 7: Topic 5: Local 3 Hours Lectures Facilitator’s
Analysis Class compiled
Taylor series discussion
and asymptotic Reading notes
expansions assignment
Numerical
Differentiation
Week 8: CONTINUOUS ASSESSMENT TEST 2
“Exploring The Heights”
Week 9: Topic 5: Local 3 Hours Lectures Facilitator’s
Analysis Class compiled
Integration discussion
The methods of notes
Reading
undetermined assignment
coefficients
Week Topic 6: 3 Hours Lectures Facilitator’s
10:
Approximating Class compiled
Functions discussion
Polynomial Reading notes
interpolation assignment
Newton
interpolation
formula
Week Topic 6: 3 Hours Lectures Facilitator’s
11:
Approximating Class compiled
Functions discussion
Lagrange Reading notes
interpolation assignment
formula
Week Topic 6: 3 Hours Lectures Facilitator’s
12:
Approximating Class compiled
Functions discussion
Discrete Fourier notes
Reading
transform assignment
Week FINAL EXAM
13:
“Exploring The Heights”
5
“Exploring The Heights”
