You are on page 1of 7

MAPA UNIVERSITY

School of Electrical, Electronics and Computer Engineering

VISION

Mapua shall be among the best universities in the world.

MISSION

A. The University shall provide a learning environment in order for its students to acquire the
attributes that will make them globally competitive.
B. The University shall engage in economically viable research, development and
innovation.
C. The University shall provide state-of-the-art solutions to the problems of industries and
communities.

MISSION
PROGRAM EDUCATIONAL OBJECTIVES
A B C
Within the five years after graduation, the graduates of the Computer Engineering
program shall have:
Undertaken, singly or in teams, projects that show ability to solve complex
1 engineering problems.
Had substantial involvement in projects that take into consideration safety, health,
2 environmental concerns and the public welfare, partly through adherence to required
codes and laws.
Demonstrated professional success via promotions and/or positions of increasing
3 responsibility.
Demonstrated life-long learning via progress toward completion of an advanced
4 degree, professional development/continuing education courses, or industrial training
courses.
Demonstrated technical expertise, professionalism, and ethics in ICT, semiconductor
5 electronics, entrepreneurship of fields in the practice of Computer Engineering for
the advancement of industry and society.

COURSE SYLLABUS
1. Course Code : COE 60

2. Course Title : Numerical Methods with Computing

3. Pre-requisite : MATH24

4. Co-requisite : None

5. Credit/Class schedule : 3 / 4.5 lecture hours per week

6. Course Description:

This course covers the concepts of numerical analysis and computer software tools dealing
with engineering problems. It includes techniques in finding the roots of an equation, solving
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 1 of 7
with Computing
systems of linear and non-linear equations, eigenvalue problems, polynomial approximation
and interpolation, ordinary and partial differential equations. The Monte-Carlo method,
simulations, error propagation and analysis, the methods of least squares and goodness-of-fit
tests, are also discussed.

7. Student Outcomes and Relationship to Program Educational Objectives

Program Educational
Program Outcomes Objectives
1 2 3 4 5
Ability to apply knowledge of mathematics and
(a)
science to solve engineering problems
Ability to design and conduct experiments, as well
(b)
as to analyze and interpret data
An ability to design a system, component, or
process to meet desired needs within realistic
constraints such as economic, environmental,
(c)
social, political, ethical, health and safety,
manufacturability, and sustainability, in
accordance with standards
(d) Ability to function on multidisciplinary teams
An ability to identify, formulate, and solve
(e)
engineering problems
An understanding of professional and ethical
(f)
responsibility
(g) An ability to communicate effectively
Broad education necessary to understand the
(h) impact of engineering solutions in a global,
economic, environmental, and societal context
A recognition of the need for, and an ability to
(i)
engage in life-long learning
(j) A knowledge of contemporary issues
Ability to use techniques, skills, and modern
(k) engineering tools necessary for engineering
practice.
Knowledge and understanding of engineering and
management principles as a member and leader
(l)
in a team, to manage projects and in
multidisciplinary environments

8. Course Outcomes (COs) and Relationship to Student Outcomes

Course Outcomes Student Outcomes*


After completing the course, the student
must be able to:
1. Apply the different iterative bracketing
techniques applicable in solving roots
for both types of non-linear functions E E E E
and implement the role of
approximation and errors
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 2 of 7
with Computing
2. Apply the different open method
techniques applicable in solving roots E E E E
for both types of non-linear functions
3. Apply the different iterative methods
for solving a non-linear polynomial E E E E
function and iterative methods for
solving systems of linear equation
4. Demonstrate an understanding on the
different curve fitting techniques,
integral approximation process, E E E E
derivative approximation and ordinary
differential approximation techniques
* Level: I- Introduced, E- Enhanced, D- Demonstrated

9. Course Coverage:
COURSE
WEEK TOPIC TLA AT
OUTCOMES

Orientation and
Introduction to the Course

Discussion on COs, TLAs,


and ATs of the course and
other course policies
Discussion of Mission and
Vision of the school

Introduction
- Mathematical
CO 1: Background Lecture Coursework
Apply the different - Computer Modeling 1
Q&A
iterative bracketing and structure
Board Machine
techniques - Approximation and
Exercises Problem 1
applicable in solving Round-off and
roots for both types Truncation errors Problem Quiz 1
1-2 of non-linear - Taylor Series Solving
functions and - Mc Laurin Series Computer
implement the role of Expansion Based Problems
approximation and
errors
Non-linear Transcendental
and Polynomial Function
Techniques
- Conventional
Methods
- Graphical Method
- Iterative Methods

Iterative Bracketing
Method
- Bisection
- Regula-Falsi (False
position Method)

Iterative Non-
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 3 of 7
with Computing
3-5 CO 2: Bracketing/Open Methods
- Fixed-point Lecture Coursework
Apply the different
Method(MOSS) 1
open method Q&A
- Secant Method
techniques Machine
- Newtons Method Board
applicable in solving Problem 2
- Newton-Raphson Exercises
roots for both types
Method Problem Quiz 2
of non-linear
functions Solving
Computer
Based Problems
5-7 CO 3: Lecture Coursework
Iterative Polynomial 2
Apply the different Q&A
function techniques
iterative methods for Machine
- Mllers method Board
solving a non-linear Problem 3
- Bairstows Method Exercises
polynomial function
Problem Quiz 3
and iterative
System of Linear Solving
methods for solving
Equations
systems of linear Computer Based
Direct methods
equation Problems
- Gauss Jordan
- Matrix LU
Decomposition
- Crouts/Choleskys
Method
- Matrix LU
Decomposition
- Doolittle Method

Iterative methods
- Gauss-Jacobi method
- Gauss-Seidel method
- Relaxation method
- Successive relaxation
methods

Curve Fitting Techniques


Least square regression Lecture Coursework
- Linear Regression 2
- Polynomial Q&A
Regression Board Machine
Exercises Problem 4
CO 4:
Interpolation techniques Problem Quiz 4
Demonstrate an - Lagrange
understanding on the Solving
interpolating
different curve fitting Computer
Polynomial
techniques, integral Based Problems
- Newtons Divided
7-9 approximation difference
process, derivative interpolating
approximation and polynomial
ordinary differential
approximation Numerical Integration
techniques techniques
- Trapezoidal Rule
method and Multiple
application
Trapezoidal Rule
method
- Simpsons 1/3 Rule
and Multiple
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 4 of 7
with Computing
application Simpsons
1/3 Rule
- Simpsons 3/8 Rule
and Multiple
application Simpsons
3/8 Rule
- Booles Rule
- Romberg Integration

CO 4:
9-10 Numerical Differentiation Lecture Coursework
Demonstrate an - Forward Finite
understanding on the Q&A 2
Divided difference
different curve fitting - Backward Finite Board Machine
techniques, integral Divided difference Exercises Problem 4
approximation - Centered Finite Examination
Problem
process, derivative Divided difference 4
Solving
approximation and - Richardsons
ordinary differential Computer
extrapolation
approximation Based Problems
techniques
Ordinary Differential
Equations (ODE)
- Eulers Method
- Runge-kutta Methods

Summative
11 CO 1 to 4 Assessment:
Final Examination

10. Lifelong-Learning Opportunities

Students will be asked to learn on their own the use of a computer software like MS Excel,
MATLAB, C-language, C++ or other related object oriented software to solve machine
problems, and simulation in courseworks.

11. Contribution of Course to Meeting the Professional Component:

Engineering topics 90%


General Education Component 10%

12. Textbook: Numerical Method for Engineers with Software and Programming Applications, 4th
Ed., by Steven C. Chapra and Raymond P. Canale, Elizabeth A.Jones, Mc Graw-Hill Companies
Inc. 2002

13. Course Evaluation:

Student performance will be rated based on the following:

Assessment Tasks Weight Minimum Average for


Satisfactory
Performance
Coursework 1 1%
CO 1 Machine Problem 1 5% 60%
Quiz 1 10%
Coursework 2 1%
CO 2 Machine Problem 2 5% 60%
Quiz 2 11%
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 5 of 7
with Computing
Coursework 3 1.5%
CO 3 Machine Problem 3 5% 60%
Quiz 3 14%
Coursework 4 1.5%
CO 4 Machine Problem 4 5% 60%
Quiz 4 15%
Summative Assessment:
25% 60%
Final Examination
TOTAL 100% 60%

The final grades will correspond to the weighted average scores shown below

Average Grade Average Grade


Below 60 5.00 77.76 82.19 2.00
60 64.43 3.00 82.2 86.63 1.75
64.44 68.87 2.75 86.64 91.07 1.50
68.88 73.31 2.50 91.08 95.19 1.25
73.32 77.75 2.25 95.20 100 1.00

13.1 Other Course Policies

a. Attendance
According to CHED policy, total number of absences by the students should not be
more than 20% of the total number of meetings or 9 hrs for a three-unit-course.
Students incurring more than 9 hours of unexcused absences automatically gets a
failing grade regardless of class standing.

b. Submission of Assessment Tasks

Late submissions of course works and machine problems will not be accepted.

c. Written Examination
There will be 4 written examinations covering the CO1 to CO4. The final examination
will be the summative assessment of CO1 to CO4 and will cover all topics of the
course. Test booklet will be used as answer sheet on all written examinations.

d. Language of Instruction
Lectures, discussion, and documentation will be in English. Written and spoken work
may receive a lower mark if it is, in the opinion of the instructor, deficient in English.

e. Honor, Dress and Grooming Codes


All of us have been instructed on the Dress and Grooming Codes of the Institute. We
have all committed to obey and sustain these codes. It will be expected in this class
that each of us will honor the commitments that we have made.
For this course the Honor Code is that there will be no plagiarizing on written work and
no cheating on exams. Proper citation must be given to authors whose works were
used in the process of developing instructional materials and learning in this course. If
a student is caught cheating on an exam, he or she will be given zero mark for the
exam. If a student is caught cheating twice, the student will be referred to the Prefect of
Student Affairs and be given a failing grade.

f. Consultation Schedule
Consultation schedules with the Professor are posted outside the EECE Faculty room
and in the Schools web-page (http://www.mapua.edu.ph/Schools/EECE/). It is
recommended that the student first set an appointment to confirm the instructors
availability.
Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 6 of 7
with Computing
g. System of Grading
The course evaluation recommended will be followed. Any misconduct as grounds for
failing grade besides academic deficiency will automatically incur a 5.0 grade on the
final grade of the student.

14. Other References:

Applied Numerical Analysis by Curtis F. Gerald and Patrick O. Wheatley 7th ed.,Greg Tobin,
Pearson Addison Wesley 2004.
Numerical Analysis International edition by Richard L. Burden and J. Douglas Faires 9 th edition,
Brooks/ Cole, Cengage Learning 2011.
Numerical Methods and applications by Ward Cheney and David Kincaid, Brooks/ Cole,
Cengage Learning 2008.
An introduction to numerical methods and analysis by Epperson, James F., 2002.
Numerical Methods using MATLAB 2nd edition by George Lindfield and John Penny, Prentice
Hall, Inc. 2000.

15. Course Materials Made Available:


15.1 Syllabus
15.2 Lecture Notes in Numerical Methods with Computing

16. Committee Members:

Meo Vincent Caya


Joshua Cuesta
Carlos C. Hortinela IV
Dionis Padilla
Analyn Yumang

Course Title: Date Effective: Date Revised: Prepared by: Approved by:
3rd Quarter 2016-17 2nd Quarter 2016-17
Numerical Methods CChortinela Noel B. Linsangan Page 7 of 7
with Computing

You might also like