|Lecturer||Takashi WATANABE, Professor|
|Department||School of Informatics and Sciences, 2016 Spring|
|Recommended for:||School of Information Science (2・1.5 hours / session One session / week 15 weeks / semester)|
The academic field of algorithms is now increasing. You will learn about some of the representative algorithms and experience how to use them in practices.
Some information technology examinations include problems that involve algorithms. In these cases, you will realize that these problems are similar to those you have learned in the algorithm course.
You can review the course of programming and use the knowledge to apply algorithms to concrete problems. You will also confirm your knowledge of algorithms by tracing the step-by-step processes of problem solving, even though it may be difficult for you to make a program.
During the last five or ten minutes of each class, you will have to opportunity to join in discussion about your questions and/or what you have learned in the class.
No special references are required. Depending upon your request, the teacher will introduce you to some useful materials.
The lectures are given on algorithms that determine problem solving processes in computers. Some of the algorithms are used to demonstrate how to use them in problem solving.
|1||BNF, regular expressions|
|2||basic algorithms and recursive algorithms (review of programming)|
|3||processing of lists|
|4||processing of hash|
|5||processing of graphs (definition of the graph and minimum const spanning tree)|
|6||processing of graphs (non-directional tree, minimum cost directed tree)|
|7||trees (definition of tree, traverse and binary tree)|
|8||trees (complete binary tree, heap)|
|9||trees (processing of complete binary tree)|
|10||sorting (classical methods)|
|11||sorting (merge sort, quick sort, heap sort)|
|12||sorting (other useful sorts)|
|13||searching (simple search)|
|14||searching (cost-based search)|
Comprehensive evaluation of reports and the examination
May 13, 2020