Course title
Y02500312
Data Structure and Algorithm 2

 YAMAZAKI Kenichi
Middle-level Diploma Policy (mDP)
Program / Major mDP Goals
Department of Design Engineering E E 情報技術に関する高度な専門知識やデジタル技術を含む他の専門分野の知識・技術を活用し、構想を具体化するとともに、実現に向けた取り組みを行うことができる。
Purpose of class
Students will gain a deep understanding of advanced data structures and algorithms and develop the ability to design and apply them independently.
Course description
In software development, it is essential to design and analyze efficient algorithms and data structures.
This course explains advanced algorithms and the data structures suited for their implementation. It also covers theoretical aspects such as correctness and computational complexity in detail.
As this course builds upon Data Structure and Algorithm 1, it is strongly recommended that students have completed that course beforehand.
Goals and objectives
  1. Understand data structures and algorithms such as B-trees, Dijkstra’s algorithm, and regular expressions, and explain their behavior and meaning.
  2. Understand the characteristics of these algorithms and explain their advantages and disadvantages in practical applications.
  3. Understand algorithm correctness and computational complexity deeply enough to be able to prove correctness and analyze complexity independently.
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Exam Total.
1. 60% 60%
2. 20% 20%
3. 20% 20%
Total. 100% -
Evaluation method and criteria
Students who achieve 60% or higher on the final exam will pass the course.
A score of 60% corresponds to the level at which students can understand and solve the in-class exercises and practice problems.
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Algorithm Correctness and Computational Complexity Theory Review distributed materials 190minutes
2. Advanced Trees (B-Trees, Tries) Review distributed materials 190minutes
3. String Matching (KMP, BM) Review distributed materials 190minutes
4. Graph Algorithms (Data Structures, Traversal, Shortest Path) Review distributed materials 190minutes
5. Regular Expression (Automata, Parsing) Review distributed materials 190minutes
6. Dynamic Programming Review distributed materials 190minutes
7. Examination and Explanation Prepare Examination 190minutes
Total. - - 1330minutes
Feedback on exams, assignments, etc.
ways of feedback specific contents about "Other"
Feedback in the class
Textbooks and reference materials
No textbook.
Prerequisites
Office hours and How to contact professors for questions
  • 1 hour after the class
Regionally-oriented
Non-regionally-oriented course
Development of social and professional independence
  • Course that cultivates an ability for utilizing knowledge
Active-learning course
More than one class is interactive
Course by professor with work experience
Work experience Work experience and relevance to the course content if applicable
Applicable The instructor has industrial experience in system and programming language research and development, and will explain data structures and algorithms based on that experience.
Education related SDGs:the Sustainable Development Goals
  • 9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
Last modified : Sat Mar 14 13:28:08 JST 2026