Course title
P04504002
Data Structures and Algorithms 2

 SUZUKI Tetsuya Click to show questionnaire result at 2018
Course description
Following "Data Structures and Algorithms I", this course aims to provide students with an understanding of basic data structures and algorithms, as well as the ability to apply them. Sorting algorithms, basic graph algorithms, string matching, and combinatorial problems will be covered. Programming exercises will be conducted as necessary to deepen understanding of data structures and algorithms.
Purpose of class
Learn basic data structures and algorithms.
Goals and objectives
  1. Understand the algorithms (sorting algorithm, graph algorithms, string matching algorithm, backtracking method, branch-and-bound method, game tree search) and data structures (heap, graph representation) of this subject.
  2. To be able to implement the algorithms and data structures of this subject in C language.
  3. Understand the computational complexity of the algorithms in this subject and apply them appropriately.
Language
Japanese
Class schedule

 Class schedule HW assignments (Including preparation and review of the class.) Amount of Time Required
1. Overview of this course, brief review of "Data Structures and Algorithms I Check the syllabus. 190minutes
2. Sorting (1) Bubble sort, quick sort Review the previous lesson. 190minutes
3. Sorting (2) Heap sort, merge sort Review the previous lesson. 190minutes
4. Exercises (1) Review the previous lesson. 190minutes
5. Graph algorithms (1) Representation of graphs, depth-first search Review the previous lesson. 190minutes
6. Graph algorithms (2) Topological sorting, breadth-first search Review the previous lesson. 190minutes
7. Exercises (2) Review the previous lesson. 190minutes
8. String matching (1) Knuth-Morris-Pratt's algorithm Review the previous lesson. 190minutes
9. String Collation (2) Boyer-Moore Algorithm Review the previous lesson. 190minutes
10. Exercises (3) Review the previous lesson. 190minutes
11. Difficult problem (1) Backtracking method Review the previous lesson. 190minutes
12. Exercises (4) Review the previous lesson. 190minutes
13. Difficult problems (2) Branch-and-bound method, game tree search Review the previous lesson. 190minutes
14. Exercises (5) Review the previous lesson. 190minutes
Total. - - 2660minutes
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 reports and quizzes Total.
1. 35% 35%
2. 30% 30%
3. 35% 35%
Total. 100% -
Evaluation method and criteria
Evaluation will be based on reports and quizzes. A total score of 60% or higher is considered passing.
Feedback on exams, assignments, etc.
ways of feedback specific contents about "Other"
Feedback in the class
Textbooks and reference materials
Distribute materials as needed.
Prerequisites
It is desirable that students have taken "Data Structures and Algorithms I" and "Programming Exercise I" in the first semester.
Office hours and How to contact professors for questions
  • Friday lunchtime (preferably with advance notice of visit)
  • If you cannot reach the person in charge, please send an email.
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
N/A 該当しない
Education related SDGs:the Sustainable Development Goals
  • 9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
Last modified : Sat Sep 09 06:51:33 JST 2023