Course title
Data Structure and Algorithm

YAMAZAKI Kenichi Click to show questionnaire result at 2018
Course description
This course deals with the well-known data structure and algorithms. They are used in many types of applications to execute them efficiently.
Purpose of class
The purpose is to understand well-known existing algorithm and to know how to create new algorithms.
Goals and objectives
  1. Understand famous data structures such as tree, hash and graph
  2. Understand computational order of algorithms.
  3. Write programs which realizes such algorithms.
Class schedule

Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Correctness, partial correctness and termination Section 1 of ref. book 90minutes
2. Binary search tree (1) search, insertion and deletion Section 4 of ref. book 90minutes
3. Binary search tree (2) computation order Section 4 and 10 of ref. book 90minutes
4. B-tree and trie Section 4 of ref. book 90minutes
5. String search (1) Boyer-Moore method Section 7 of ref. book 90minutes
6. String search (2) Knuth-Morris-Pratt method Section 7 of ref. book 90minutes
7. Quantum Computation and Algorithms review handouts 90minutes
8. Graph (1) data structure Section 6 of ref. book 90minutes
9. Graph (2) shortest path problem Section 6 of ref. book 90minutes
10. Regular expression and automaton review handouts 90minutes
11. Automaton and state transition machine review handouts 90minutes
12. Algorithm design (1) recursion, divide-and-conquer, dynamic programming Section 8 of ref. book 90minutes
13. Algorithm design (2) many algorithms in real Section 8 and 9 of ref. book 90minutes
14. Term-end examination Review the all materials 90minutes
Total. - - 1260minutes
Relationship between 'Goals and Objectives' and 'Course Outcomes'

Reports Term-end exam. Total.
1. 5% 30% 35%
2. 5% 30% 35%
3. 30% 0% 30%
Total. 40% 60% -
Evaluation method and criteria
Report (4 times): 50%
Term-end examination: 50%
Textbooks and reference materials
Reference book: Tetsuo Asano, "Algorithm-ron", Ohmsha
The students are expected to take "Programming", "Practice of Programming"
Office hours and How to contact professors for questions
  • After the class (16:40-).
    Other office hours will be shown in the fist lecture.
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates an ability for utilizing knowledge
  • Course that cultivates a basic problem-solving skills
Active-learning course
About half of the classes are interactive
Course by professor with work experience
Work experience Work experience and relevance to the course content if applicable
Applicable Research and development experience in corporate laboratory
Education related SDGs:the Sustainable Development Goals
Feedback on exams, assignments, etc.
Feedback will be done in the class.
Last modified : Sat Sep 09 05:03:38 JST 2023