Course Objectives
At the completion of this course, students will be able to
1) Explain the analysis method and the evaluation method of the algorithms correctly
2) Explain the characteristics of basic data structures and their usage correctly
3) Create an algorithms that use data structures appropriate for solving problems correctly
Rubric
| Ideal Level of Achievement (Very Good) | Standard Level of Achievement (Good) | Unacceptable Level of Achievement (Fail) |
| Evaluation 1 | Can explain the analysis method and the evaluation method of the algorithms almost perfectly. | Can explain the analysis method and the evaluation method of the algorithms correctly. | Can't explain the analysis method and the evaluation method of the algorithms correctly. |
| Evaluation 2 | Can explain the characteristics of basic data structures and their usages almost perfectly. | Can explain the characteristics of basic data structures and their usages correctly. | Can't explain the characteristics of basic data structures and their usages correctly. |
| Evaluation 3 | Can create algorithms that use data structures appropriate for solving problems almost perfectly. | Can create algorithms that use data structures appropriate for solving problems correctly. | Can't create algorithms that use data structures appropriate for solving problems correctly. |
Assigned Department Objectives
Teaching Method
Outline:
Students understand the efficiency of algorithms and the practical use of data structures through basic algorithms.
Style:
Lectures and exercises: Students use their own laptops.
Notice:
A student whose evaluation is less than 60 scores is allowed to take the ratification exam.
The student is evaluated by the ratification exam.
The evaluation of the student who is allowed to acquire a credit because of the result of the ratification exam shall be 60 scores.
Characteristics of Class / Division in Learning
Course Plan
|
|
|
Theme |
Goals |
| 1st Semester |
| 1st Quarter |
| 1st |
Basic concept of algorithms |
Students can explain the concept of algorithms.
|
| 2nd |
Basic data structures
|
Students can explain the concept of basic data structures.
|
| 3rd |
Computational complexity of algorithms
|
Students can explain the computational complexity of algorithms.
|
| 4th |
Basic data structure (stack) |
Students can explain the characteristics of stack and how to use it.
|
| 5th |
Exercise (stack) |
Students can create the program of exercise.
|
| 6th |
Basic data structure (queue) |
Students can explain the characteristics of queue and how to use it.
|
| 7th |
Exercise (queue) |
Students can create the program of exercise.
|
| 8th |
Midterm exam |
Midterm exam
|
| 2nd Quarter |
| 9th |
Recursive algorithm |
Students can explain recursive algorithm.
|
| 10th |
Exercise (recursive algorithm) |
Students can create the program of exercise.
|
| 11th |
Basic data structure (list) |
Students can explain the characteristics of list and how to use it.
|
| 12th |
Exercise (list) |
Students can create the program of exercise.
|
| 13th |
Exercise (list) |
Students can create the program of exercise.
|
| 14th |
Exercise (list) |
Students can create the program of exercise.
|
| 15th |
Final exam |
Final exam.
|
| 16th |
Interpretation of the final exam |
Return of the final exam.
|
Evaluation Method and Weight (%)
| Examination | Report | Mutual Evaluations between students | Behavior | Portfolio | Other | Total |
| Subtotal | 80 | 20 | 0 | 0 | 0 | 0 | 100 |
| Basic Ability | 40 | 10 | 0 | 0 | 0 | 0 | 50 |
| Technical Ability | 40 | 10 | 0 | 0 | 0 | 0 | 50 |
| Interdisciplinary Ability | 0 | 0 | 0 | 0 | 0 | 0 | 0 |