(1) Understand the basic concepts of pointers, functions, file input/output, and structures, and can create programs using them.
(2) Understand and can apply iterative methods for nonlinear equations, solutions for linear equations, function interpolation methods, function approximation methods, and solutions for ordinary differential equations, and can create programs of these solutions.
Outline:
In order to analyze various engineering problems using computers, it is essential to learn programming techniques and numerical analysis methods. The purpose of this class is to learn more about advanced programming techniques in C language and specific numerical analysis methods related to engineering using C language. This course's content will amount to 90 hours of study in total. These hours include the learning time guaranteed in classes and the standard self-study time required for pre-study / review, and completing assignment reports.
Style:
Classes are held in a lecture style using PowerPoint to make it easier to understand visually. Students will create programs as assignments during the rest of a class or outside of a class.
Notice:
It is important for students to be proactive in using computers. Do the assignments on your own and keep the submission deadline.
Students who miss 1/3 or more of classes will not be eligible for a passing grade.
|
|
|
Theme |
Goals |
| 1st Semester |
| 1st Quarter |
| 1st |
Review of C language
Reviews basics, mathematical functions, control structures, iterative processing, arrays, and more. |
Understand the basics, mathematical functions, control structures, iterative processing and arrays.
|
| 2nd |
Pointer (1)
Explain the basics of pointers, control of pointers, and more. |
Understand the basics of pointers, control of pointers, and so on.
|
| 3rd |
Pointer (2)
Explain the relationship between pointers and arrays, pointer arrays, and multiple indirect references. |
Understand the relationship between pointers and arrays, pointer arrays, and multiple indirect references.
|
| 4th |
Function (1)
Explain function prototypes, recursive functions, and so on. |
Understand function prototypes, recursive functions, etc.
|
| 5th |
Function (2)
Explain the passing of arguments and passing references, arguments to the main function, and so on. |
Understand the arguments passed and passed by reference and the arguments of the main function.
|
| 6th |
File input/output
Explain the basics of the file system and how to read and write files. |
Understand the basics of the file system and how to read and write files.
|
| 7th |
Structures
Explain structure basics, pointers, and arrays. |
Understand structure basics, pointers, and arrays.
|
| 8th |
Midterm Exam (or Report Assignment)
|
|
| 2nd Quarter |
| 9th |
Iterative methods for nonlinear equations
Explain the method of solving nonlinear equations using Newton and two-fraction methods. |
Understand the method of solving nonlinear equations using Newton and two-fraction methods.
|
| 10th |
Solution of a series of linear equations (1)
Explain the Cramer's and Gauss-Jordan methods, both direct solutions. |
Understand the Cramer and Gauss-Jordan methods, both direct solutions.
|
| 11th |
Solution of a series of linear equations (2)
Explain the iterative methods of Jacobi and Gauss-Seidel. |
Understand the iterative methods of Jacobi and Gauss-Seidel.
|
| 12th |
Interpolation method
Explain the Lagrangian and Newton interpolation methods. |
Understand Lagrangian and Newton interpolation methods.
|
| 13th |
Function approximation
Explain the function approximation using least squares. |
Understand the function approximation using least squares.
|
| 14th |
Numeric integration
Explain the trapezoidal formula and the numerical integration by Simpson's formula are explained. |
Understand the trapezoidal formula and the numerical integration of Simpson's formula.
|
| 15th |
Solutions for the ordinary differential equation
Explain the numerical solutions by the Euler method, the Heun's method, and the Runge–Kutta. |
Understand the numerical solutions by the Euler method, Heun's methd, and Runge–Kutta methods.
|
| 16th |
Final exam (or report assignment)
|
|