To deeply and completely understand and obtain the knowledge and skills learnt in the course "Data Structures and Algorithms
1", this course will provide exercises to develop some software with C programming language that satisfy the various requirements.
The purpose of this course is to obtain the middle-level programming skills by C language through the exercises related to
various data structures and algorithms, such as list, stack, queue and tree structures as well as search and recursive algorithms.
The exercises also require file I/O, array, pointer, and structure technique.
- Obtain the skills to utilize array, structure, pointer, and file I/O.
- Understand the equivalence between data structures and various technique in C language, and obtain the skills to express the data structures using array, structure and pointer.
- Obtain the skill to describe the programs with C language for various algorithms learnt in "Data Structures and Algorithms 1"
| Class schedule | HW assignments (Including preparation and review of the class.) | Amount of Time Required | |
|---|---|---|---|
| 1. | Review of C language | Develop software and make reports | 100minutes |
| 2. | Exercise for pointer, array, structure, and their dynamic allocation | Develop software and make reports | 100minutes |
| 3. | Exercise of file I/O | Develop software and make reports | 100minutes |
| 4. | Expression of data structure (1): data insert and reference using array and list of structure | Develop software and make reports | 100minutes |
| 5. | Expression of data structure (2): data insert and reference using array and list of structure | Develop software and make reports | 100minutes |
| 6. | Expression of stack using list of structure | Develop software and make reports | 100minutes |
| 7. | Expression of queue using list of structure and ring buffer | Develop software and make reports | 100minutes |
| 8. | Evaluation of arithmetic expression using stack | Develop software and make reports | 100minutes |
| 9. | Tree search using recursive programming (1) | Develop software and make reports | 100minutes |
| 10. | Tree search using recursive programming (2) | Develop software and make reports | 100minutes |
| 11. | Linear search and binary search | Develop software and make reports | 100minutes |
| 12. | Construction of binary tree and its search | Develop software and make reports | 100minutes |
| 13. | Hash method (Chain method) | Develop software and make reports | 100minutes |
| 14. | Hash method (Linear search method) | Develop software and make reports | 100minutes |
| Total. | - | - | 1400minutes |
| Reports | Total. | |
|---|---|---|
| 1. | 20% | 20% |
| 2. | 40% | 40% |
| 3. | 40% | 40% |
| Total. | 100% | - |
Evaluated by the achievement of the reports. The absences from classes will lead the deduction of points.
Textbook: Kiyoshi Ishihata, Algorithms and data structures, Iwanami. (In Japanese)
Provide handouts in the class.
Provide handouts in the class.
- Expected to have taken "Information Processing 1&2".
- Review the lecture materials given in "Information Processing 1&2" and prepare for the C programming.
- Need to take "Data structures and algorithms 1" for the exercise to make C programming.
- Review the lecture materials given in "Information Processing 1&2" and prepare for the C programming.
- Need to take "Data structures and algorithms 1" for the exercise to make C programming.
- Questions are welcome as needed. Email is also welcome.
- Office hour: 2nd time slot on Wednesday. Make an appointment in advance by email.
- Course that cultivates an ability for utilizing knowledge
- Course that cultivates a basic problem-solving skills
| Work experience | Work experience and relevance to the course content if applicatable |
|---|---|
| N/A | 該当しない |
Last modified : Thu Mar 21 14:52:28 JST 2019