This is exercise class which is related to the lecture 'data structure and algorithms'. Students studied some of data structures
and algorithms in the lecture. They actually make codes for them in this exercise. Finally, they develop small applications.
The purpose is to understand basic data structures by actually making codes. By developing applications we understand the
importance of the data structures.
- Understanding basic data structure
- Understanding algorithms and its characteristics
- Developing applications
| Class schedule | HW assignments (Including preparation and review of the class.) | Amount of Time Required | |
|---|---|---|---|
| 1. | Review of basic programming | review of programming | 90minutes |
| 2. | Function, array and list | review of programming | 90minutes |
| 3. | Constriction | review of programming | 90minutes |
| 4. | Array, list and memory allocation | review of data structures (class) | 90minutes |
| 5. | List and stack, Queue and circular queue | review of data structures (class) | 90minutes |
| 6. | Selection sort, bubble sort | review of data structures (class) | 90minutes |
| 7. | Quick sort | review of data structures (class) | 90minutes |
| 8. | Radix sort and bucket sort | review of data structures (class) | 90minutes |
| 9. | Graphics methods | review of programming | 90minutes |
| 10. | Wireframe | review of graphics methods | 90minutes |
| 11. | Shading | review of Wireframe | 90minutes |
| 12. | Animation | review of Shading | 90minutes |
| 13. | Event of mouse and keyboard | review of animation | 90minutes |
| 14. | Examination and contest of applications | total review | 90minutes |
| Total. | - | - | 1260minutes |
| exam | application | Total. | |
|---|---|---|---|
| 1. | 25% | 25% | |
| 2. | 25% | 25% | |
| 3. | 50% | 50% | |
| Total. | 50% | 50% | - |
- Course that cultivates a basic self-management skills
Last modified : Wed Oct 17 07:33:53 JST 2018