Course title
L00160002
Fundamental Exercise on Computer Science and Engineering 2A

 SUGIMOTO Tooru

WATABE Shohei
Course description
This class presents example problems that can be solved by solution algorithms explained in “Data Structure and Algorithms 2” (L0694500). Designing algorithms and programming for the examples help you understand the standard solution algorithms, evaluate computational complexity and apply the standard algorithms to more practical problems.
Purpose of class
To understand standarard solutin algorithms and apply them to problems in specefic cases through programming.
Goals and objectives
  1. To sort data by basic sorting algorithms.
  2. To solve graph search problems by basic graph search algorithms.
  3. To solve string match problems by typical string match algorithms.
  4. To solve some standard problems using typical designing methods of algorithms.
Relationship between 'Goals and Objectives' and 'Course Outcomes'

 Assignments Total.
1. 25% 25%
2. 25% 25%
3. 25% 25%
4. 25% 25%
Total. 100% -
Evaluation method and criteria
Assignments 1-14 (100%). Over 60% of the total 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. 		Complete programs by following specifications in a material. 90minutes
2. Java programming (2)
- Structures of classes
- The relationship between objects and classes
- Constructors
- Strings 		Complete programs by following specifications in a material. 90minutes
3. Java programming (3)
- Inheritance
- Interface
- Polymorphism
- Scope and modifier 		Complete programs by following specifications in a material. 90minutes
4. Java programming (4)
- Packages
- Class libraries
- I/O stream
- Exception handling 		Complete programs by following specifications in a material. 90minutes
5. Java programming (5)
- Collections
- List, Map 		Complete programs by following specifications in a material. 90minutes
6. Java programming (6)
・Generation of threads
・Synchronization 		Complete programs by following specifications in a material. 90minutes
7. Comprehensive Exercises of Java programming Complete programs by following specifications in a material. 90minutes
8. ragh algorithms (I) : Representation of a graph, search algorithms Complete programs by following specifications in a material. 90minutes
9. Gragh algorithms (II) : Shortest path problem (Dijkstra’s algorithm) Complete programs by following specifications in a material. 90minutes
10. Gragh algorithms (III) : Network flow, Maximum flow algorithm Complete programs by following specifications in a material. 90minutes
11. String search algorithm, String matching Complete programs by following specifications in a material. 90minutes
12. Algorithm design (I) : Recursive algorithms, Divide and conquer Complete programs by following specifications in a material. 90minutes
13. Algorithm design (II) : Dynamic programming, Knapsack problem, Greedy method Complete programs by following specifications in a material. 90minutes
14. Applied Exercises of algorithms Complete programs by following specifications in a material. 90minutes
Total. - - 1260minutes
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 : Understand the contents of “Data Structure and Algorithms 1” (L0692900) and “Fundamental Exercise on Computer and Information Engineering 1A” (L0845300). You should take “Data Structure and Algorithms 2” (L0694500) in parallel.
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 an ability for utilizing knowledge
Active-learning course
Most classes are interactive
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:39 JST 2025