Course Syllabi

Course Title and Code MATH317- Numerical Methods

 Course Identification and General Information:

Department Computer Science Course Level 7

Contact Hours 2 classes per week of 75 minutes each Credit Hours 3

Web Address https://lms.qu.edu.sa/

Class Location Monday & Wednesday 8:00 AM-9:15:00 AM (Section 85)- Room 103

 Course Instructor/Coordinator’s Name: Dr. AbdulNaser Rachid, Office G196 (Ground

floor), Department of Computer Science, College of Computer, Qassim University,
[email protected]

 Office Hours: : Sun. 9:00 AM-12:00 PM & Tue. 9:00 AM-11:00 P

 Textbook Title, Author, and Year:

 Cheney & Kincaid, “Numerical Mathematics and Computing”, 7/E Or later, Brooks/Cole
678 pages, 2012. ISBN-13: 978-1-133-10371-4

 Other Supplemental Materials:

 Greenbaum, A. & Chartier, T. P. “Numerical methods: design, analysis, and computer
implementation of algorithms”. Princeton University Press, 2012. ISBN 9780691151229
 Gilat, A and Subramaniam, V. “Numerical Methods for Engineers and Scientists” 2nd
edition John Wiley and Sons Inc., 2011

 Specific Course Information:

 Catalog Description: This course is to help the student in understanding some of the many
methods for solving typical problems that arise in science, engineering, and technology
on a modern computer. This course It covers diverse topics such as: Review of Taylor
Series, Floating-Point Representation and error, Locating Roots of Equations, Interpolation
and Numerical Differentiation, Numerical Integration and additional Topics on Numerical
integration.

Page 1 of 6
 Pre-requisites: MATH116

 Co-Requisites: None

 Required, Elective, or Selected Elective: Required

 Specific Goals for the Course: Summary of the main learning outcomes for enrolled
students.
1. Students will able to explain the role and the limitations of the computer in solving
mathematical and engineering problems.
2. Students will able to analyze a computation for error and discuss the types and sources
of errors involved.
3. Students will able to Explain how error accumulates and discuss the errors inherent in
using standard floating point numbers.
4. When asked, in writing, students will able to find the root of Equations.
5. When asked in writing, students will able to evaluate Interpolation and Polynomial
Approximation.
6. When prompted, in writing independently, students will able to evaluate Numerical
Differentiation and Integration.
7. When asked, in writing, students will able to apply the Simpson’s Rule for obtaining a
numerical approximation to the integral.

 ABET Student Outcomes Addressed by the Course:

This course provides the following outcomes with the following relationship:
Computer Science Program Outcome Relationship to Course

1. Analyze a complex computing problem and to apply principles of

Evaluated
computing and other relevant disciplines to identify solutions.

2. Design, implement, and evaluate a computing-based solution to meet a

given set of computing requirements in the context of the program’s Evaluated
discipline.

3. Communicate effectively in a variety of professional contexts. Not Evaluated

4. Recognize professional responsibilities and make informed judgments in

Not Evaluated
computing practice based on legal and ethical principles.

5. Function effectively as a member or leader of a team engaged in

Not Evaluated
activities appropriate to the program’s discipline.

6. Apply computer science theory and software development

Not Evaluated
fundamentals to produce computing-based solutions.

Page 2 of 6


 CLO to ABET Performance Indicators Mapping and Assessments

CLOs Covered ABET Performance Assessment Process and Target
Indicators (SOs) Performance (average CLO
achievement threshold – assessed
from grades, self-assessment and
faculty scores)

1. Students will able to explain the 2. Design, implement, and evaluate a Through written exams, quizzes,
role and the limitations of the computing-based solution to meet and home works.
computer in solving a given set of computing Target Performance: Practiced
mathematical and engineering requirements in the context of the (> 80%)
problems. program’s discipline.

2. Students will able to analyze a 1. Analyze a complex computing Through written exams, quizzes, and
computation for error and problem and to apply principles of home works.
discuss the types and sources of computing and other relevant Target Performance: Mastered (>
errors involved. disciplines to identify solutions. 85%)

3. Students will able to Explain how 2. Design, implement, and evaluate a Through written exams, quizzes, and
error accumulates and discuss computing-based solution to meet home works.
the errors inherent in using a given set of computing Target Performance: Practiced (>
standard floating point numbers. requirements in the context of the 80%)
program’s discipline.

4. When asked, in writing, students 1. Analyze a complex computing Through written exams, quizzes, and
will able to find the root of problem and to apply principles of home works.
Equations. computing and other relevant Target Performance: Practiced (>
disciplines to identify solutions. 80%)

5. When asked in writing, students 1. Analyze a complex computing Through written exams, quizzes, and
will able to evaluate problem and to apply principles of home works.
Interpolation and Polynomial computing and other relevant Target Performance: Practiced (>
Approximation. disciplines to identify solutions. 80%)

6. When prompted, in writing 1. Analyze a complex computing Through project presentation

independently, students will able problem and to apply principles of Target Performance: Practiced (>
to evaluate Numerical computing and other relevant 80%)
Differentiation and Integration. disciplines to identify solutions.

7. When asked, in writing, students 1. Analyze a complex computing Through project presentation
will able to apply the Simpson’s Rule problem and to apply principles of Target Performance: Practiced (>
for obtaining a numerical computing and other relevant 80%)
approximation to the integral. disciplines to identify solutions.

Page 3 of 6
 Outcome Assessment:
1. Direct Assessment
☒ Midterm Written Exam I
☒ Midterm Written Exam II
☒ Final Written Exam
☒ Quizzes
☒ Homework
☒ Integrative Projects
☒ Participation in Lecture
2. Indirect Assessment
☒ Post-Course Questionnaire

 Course Outline:
General Topics Contact Hours

Introduction – Preliminary Remarks and Review of Taylor Series. 9

Floating-Point Representation and error- Floating-Point Representation and Loss of Significance. 6

Locating Roots of Equations - Bisection Method and Newton’s Method. 6

Interpolation and Numerical Differentiation - Polynomial Interpolation. 9

Numerical Integration - Lower and Upper Sums, Trapezoid Rule and Romberg Algorithm. 6
Additional Topics on Numerical integration- Simpson’s Rule and Adaptive Simpson’s Rule and 6
Gaussian Quadrature Formulas.
Review 3

Total Contact Hours 45

 Grading Policy:
Mark Distribution: Grading Scale:
Mid Terms Exam 1 – 20% A+ (95% or more)
Mid Terms Exam 2 – 20% A (90% - 94%)
Home Works and assignments – 5% B+ (85% - 89%)
Quizzes – 5% B (80% - 84%)
Project and Presentations – 5% C+ (75% - 79%)
Participation in Lectures 5% C (70% - 74%)
Final Exam – 40% D+ (65% - 69%)
D (60% - 64%)
F (less than 60%)

Assessment Descriptions: The students will be given two written midterm exams (each having 15% of the total marks.
Students in groups (2-3 members/group) will be given some recent topics in optimization to perform research and
then present their research project in class (15% of the total grade). Some home-work assignments will cover the
core concepts of the course (5% of the grade). Final exam (40% of the total grade) will be a written exam.

Attendance Policy: The policy for missing classes is same as the policy followed in QU. Excuses must be submitted within
one week of missing the class. Later arrival in the quiz or exam will not be excused.

Page 4 of 6
Ethical Responsibilities: All assignments and programming exercises must be done by the student himself. A student
can discuss/consult or refer to any other person or resources, however, the final work must be his own and not
copied as is from others. Any copied assignment will receive a zero grade.

Late Submission Policy: Any assignments submitted late will lose 25% of the assigned grades for each day of delay.

Policy for Missed Exam: Missed quizzes cannot be repeated, as the best 2 out of 3 quizzes will count towards the final
grade. Mid-term/final exam may be retaken for students having valid medical excuses.

 Course Schedule:

Topics and/or Target Representative Assessments

Weeks Reference
Activities CLO(s) Questions
Significant Digits of Mid1,
Precision, Errors: Homework,
Absolute and
Relative, Accuracy
1 Preliminary Remarks CLO 2,3 Ch1 (Introduction)
and Precision,
Rounding and
Chopping, Nested
Multiplication.

Taylor Series, Mid I ,

Complete Horner’s Homework.
2 Review of Taylor Series Algorithm, Tylor
CLO 2,3 Ch1 (Introduction)
Theorem in Terms of
(x-c)?

Mean Value Mid I , Quiz 1,

CLO 2,3 Ch1 (Introduction) Theorem? Taylor’s Homework.
3 Review of Taylor Series
Theorem in Terms of
h, Alternating Series.

Normalized Mid 1,
Floating-Point Homework
4 Floating-Point CLO 2,3 Ch2 (Floating-Point Representation,
Representation. Representation and Single-Precision
Errors) Floating-Point Form,

CLO 2,3 Ch2 (Floating-Point Double-Precision Mid 1, Quiz 2

Floating-Point
5 Representation and Floating-Point Form. Homework
Representation.
Errors)

Apply Bisection, Mid 1

Bisection Algorithm and Newton’s Methods to
6 CLO 1,4 Ch3 (Locating Homework,
Pseudocode, locate roots of
Roots of Equations)
Equations)

Page 5 of 6
 Ch3 (Locating Apply Newton’s Mid 1
Newton’s method, and Roots of Equations) Methods to locate
7 CLO 1,4 Homework,
the secant method roots of Equations)
Quiz 3,

Ch4 (Interpolation Interpolating Mid 1

8 Polynomial Interpolation CLO 1,5 and Numerical Polynomial - Homework,
Differentiation) Lagrange Form,

Ch4 (Interpolation Interpolating Homework,

10 Polynomial Interpolation CLO 1,5 and Numerical Polynomial - Quiz 3
Differentiation) Newton Form, Mid1,

Ch4 (Interpolation Dirichlet Function, Homework,

Errors in Polynomial CLO 1,5 and Numerical Runge Function, Mid1,
11
Interpolation Differentiation) Theorems on
Interpolation Errors

Definite and Quiz 4,

CLO 5,6 Ch5 (Numerical Indefinite Integrals, Homework,
12 Lower and Upper Sums Integration) Lower and Upper Mid 2
Sums, Riemann-
Integrable Functions

Recursive Trapezoid Homework,

Trapezoid Rule, CLO 5,6 Ch5 (Numerical Formula for Equal Mid 2
13 Multidimensional Integration) Subintervals,
Integration Multidimensional
Integration

Ch6 (Additional Basic Simpson’s Rule, Homework,

Simpson’s Rule and
CLO 7 Topics on Simpson’s Rule Mid 2
14 Adaptive Simpson’s Rule
and Gaussian Quadrature Numerical
Composite Simpson’s
Formulas. integration)
Rule.

Ch6 (Additional An Adaptive Quiz 5,

Simpson’s Rule and CLO 7 Topics on Simpson’s Scheme, Homework ,
Adaptive Simpson’s Rule Numerical Example Using
17 Mid 2
and Gaussian Quadrature integration) Adaptive Simpson
Formulas. Procedure,
Newton-Cotes Rules.

18 Review - -

Page 6 of 6