2023 Faculty Courses School of Engineering Undergraduate major in Industrial Engineering and Economics
Advanced Computer Programming
- Academic unit or major
- Undergraduate major in Industrial Engineering and Economics
- Instructor(s)
- Akiyoshi Shioura / Nobutaka Shimizu
- Class Format
- Lecture/Exercise (Face-to-face)
- Media-enhanced courses
- -
- Day of week/Period
(Classrooms) - 5-8 Tue (W9-311)
- Class
- -
- Course Code
- IEE.A230
- Number of credits
- 110
- Course offered
- 2023
- Offered quarter
- 3Q
- Syllabus updated
- Jul 8, 2025
- Language
- Japanese
Syllabus
Course overview and goals
This course provides an introduction of algorithms and data structures.
This course uses Python programming language to implement algorithms.
By combining lectures and exercises, the course enabls students to understand the fundamentals of programming to solve computational problem.
Course description and aims
At the conclusion of this course students will be able to:
1) learn how to use the Python language.
2) understand basic data structures and algorithms.
3) understand the difference in efficiency of algorithms.
4) implement computing algorithms to solve problems.
Keywords
Python, Programming, Algorithms
Competencies
- Specialist skills
- Intercultural skills
- Communication skills
- Critical thinking skills
- Practical and/or problem-solving skills
- Several algorithms and the ability to translate an algorithm into a Python-code.
Class flow
The first two-thids of each class is lecture and the rest for exercises of programming.
Course schedule/Objectives
| Course schedule | Objectives | |
|---|---|---|
| Class 1 | guidance review (numbers, strings, list, for, if) exercise | Understand the standard usage of Python. |
| Class 2 | computational complexity and graph exercise | Understand the notation of computational complexity and graphs. |
| Class 3 | depth-first search and breadth-first search exercise | Understand and implement the depth-first search and breadth-first search |
| Class 4 | greedy algorithms exercise | Understand greedy algorithms and Kruskal algorithms. |
| Class 5 | shortest path problem exercise | Understand the shortest path problem and algorithms (Dijkstra algorithm, Bellman-Ford algorithm, and Warshall-Floyd algorithm) |
| Class 6 | dynamic programming exercise | Understand the technique of dynamic programming and solve problems using it. |
| Class 7 | maximum flow problem exercise | Understand the maximum flow problem and algorithms. |
Study advice (preparation and review)
To enhance effective learning, students are encouraged to spend approximately 100 minutes preparing for class and another 100 minutes reviewing class content afterwards (including assignments) for each class.
They should do so by referring to textbooks and other course material.
Textbook(s)
None required.
Reference books, course materials, etc.
Guido van Rossum: Python Tutorial.
Mark Lutz: Learning Python
Evaluation methods and criteria
Learning achievement is evaluated by exercises in every lecture.
Related courses
- IEE.A207 ： Computer Programming (Industrial Engineering and Economics)
Prerequisites
Only undergraduate students of Department of Industrial Engineering and Economics can attend the class.
Students must have completed Computer Programming (Industrial Engineering and Economics) or have equivalent knowledge.
Other
Bring your own laptop PC when you attend a lecture at the university.
You should have your own google account since the lecture notes are based on Google Colaboratory.