Data Structures and Algorithms 2

Course title

L0018000

	SUGIMOTO Tooru
	WATABE Shohei

Course description

The main purpose of this course is to learn basic techniques for designing and analyzing computer algorithms by studying many kinds of data structures and algorithms to process the data. Furthermore, training abilities to apply the basic techniques to practical problems is an advanced goal of this course.

Purpose of class

To learn basic techniques for designing and analyzing computer algorithms.

Goals and objectives

To understand basic graph algorithms.
To understand basic solution algorithms for the string matching problem.
To understand typical solution methods based on various approaches of algorithm design.

Relationship between 'Goals and Objectives' and 'Course Outcomes'

	Short test	Interim exam	Final exam	Total.
1.	10%	15%		25%
2.	10%	15%		25%
3.	10%		15%	25%
4.	10%		15%	25%
Total.	40%	30%	30%	-

Evaluation method and criteria

Short test (40%), Interim exam (30%), Final exam (30%). Over 60% is acceptable.

Language

Japanese

Class schedule

	Class schedule	HW assignments (Including preparation and review of the class.)	Amount of Time Required
1.	Java programming (1) - What is "object oriented programming"? - Commons and differences between Java and C.	Read the syllabus and the lecture materials.	80minutes
1.		Review the lecture.	80minutes
2.	Java programming (2) - Structures of classes - The relationship between objects and classes - Constructors - Strings	Read the lecture materials.	80minutes
2.		Review the lecture.	80minutes
3.	Java programming (3) - Inheritance - Interface - Polymorphism - Scope and modifier	Read the lecture materials.	80minutes
3.		Review the lecture.	80minutes
4.	Java programming (4) - Packages - Class libraries - I/O stream - Exception handling	Read the lecture materials.	80minutes
4.		Review the lecture.	80minutes
5.	Java programming (5) - Collections - List, Map	Read the lecture materials.	80minutes
5.	Java programming (5) - Collections - List, Map	Review the lecture.	80minutes
6.	Java programming (6) ・Generation of threads ・Synchronization ・Mutual exclusion	Read the lecture materials.	80minutes
6.		Review the lecture.	80minutes
7.	Interim exam, Q&A	Review the contents of all the lectures.	270minutes
7.	Interim exam, Q&A	Review the interim exam.	80minutes
8.	Gragh algorithms (I) : Representation of a graph, search algorithms	Read the lecture materials.	80minutes
8.		Review the lecture.	80minutes
9.	Gragh algorithms (II) : Shortest path problem (Dijkstra’s algorithm)	Read the lecture materials.	80minutes
9.		Review the lecture.	80minutes
10.	Gragh algorithms (III) : Network flow, Maximum flow algorithm	Read the lecture materials.	80minutes
10.		Review the lecture.	80minutes
11.	String search algorithm, String matching	Read the lecture materials.	80minutes
11.	String search algorithm, String matching	Review the lecture.	80minutes
12.	Algorithm design (I) : Recursive algorithms, Divide and conquer	Read the lecture materials.	80minutes
12.		Review the lecture.	80minutes
13.	Algorithm design (II) : Dynamic programming, Knapsack problem, Greedy method	Read the lecture materials.	80minutes
13.		Review the lecture.	80minutes
14.	Final exam, Q&A	Review the contents of all the lectures from 8. to 13. so as to solve basic examples by using algorithms presented.	300minutes
14.	Final exam, Q&A	Review the final exam.	80minutes
Total.	-	-	2650minutes

Feedback on exams, assignments, etc.

ways of feedback	specific contents about "Other"
Feedback in the class

Textbooks and reference materials

Y. Yamada, "Self-Study Java", Shoeisha
T. Asano, K. Wada and T. Masuzawa, “Algorithm Theory,” IT Text, Ohmsha
K. Otsuki，”Developing Problem-Solving Skills, Algorithms and Data Structures", Kodansha

Prerequisites

Prerequisites : “Data Structure and Algorithms 1”(L0692900)

Office hours and How to contact professors for questions

Lunch break on Mondays at Room no. 4301.

Regionally-oriented

Non-regionally-oriented course

Development of social and professional independence

Course that cultivates a basic problem-solving skills
Course that cultivates an ability for utilizing knowledge

Active-learning course

N/A

Course by professor with work experience

Work experience	Work experience and relevance to the course content if applicable
N/A	N/A

Education related SDGs:the Sustainable Development Goals

9.INDUSTRY, INNOVATION AND INFRASTRUCTURE
12.RESPONSIBLE CONSUMPTION & PRODUCTION

Last modified : Thu Mar 06 10:20:42 JST 2025