Course title | |||||
アルゴリズム序論 [Introduction to Algorithms] | |||||
Course category | technology speciality courses | Requirement | Credit | 2 | |
Department | Year | 2~4 | Semester | 1st | |
Course type | 1st | Course code | 022663 | ||
Instructor(s) | |||||
宮代 隆平 [MIYASHIRO Ryuhei] | |||||
Facility affiliation | Faculty of Engineering | Office | afjgxte/L1151 | Email address |
Course description |
In this lecture, students will learn basic knowledge of algorithms, i.e., computational complexity, algorithms, data structures, programming. Without the knowledge one cannnot implement efficient software. Students should understand these topics before implementing large software systems. |
Expected Learning |
- Learning basic knowldege of complexity, algorithms, data structures - Learning the ability to improve algorithms See the Curriculum maps. |
Course schedule |
(1) Introduction (2) Number of steps in computation (3) Computational complexity (4) Computational complexity (cont.) (5) Search and simple sorting algorithms (6) Mergesort (7) Quicksort (8) Average complexity (9) List (10) Hashing (11) Stack and queue (12) Priority queue and heap (13) Heapsort (14) Efficient codes (15) Conclusion and examination |
Prerequisites |
Understanding C programming language. In addition to 30 hours that students spend in the class, students are recommended to prepare for and revise the lectures, spending the standard amount of time as specified by the University and using the lecture handouts as well as the references specified below. |
Required Text(s) and Materials |
None |
References |
- Introduction to Algorithms, Cormen, Leiserson et al. |
Assessment/Grading |
Report and Examination The grade evaluation in this online class is premised on all attendances, and comprehensively evaluates the attitude to learn, assignment, report, and (online) tests. Standard study time set by the our university is required to get the grade. The rate of evaluation is as follows: Normal assignment: 33%, report: 33%, examination (or report): 33%. Grade will be given according to the following criteria by comprehensive evaluation: S: 87.5 points or more, A: 75 or more and less than 87.5 points, B: 62.5 or more and less than 75 points, C: 50 or more and less than 62.5 points. |
Message from instructor(s) |
Course keywords |
Complexity, Algorithm, Data Structure, Programming |
Office hours |
Please e-mail me when you have questions. |
Remarks 1 |
Remarks 2 |
Related URL |
Lecture Language |
Japanese |
Language Subject |
Last update |
5/6/2020 3:17:27 PM |