| １． |
Outline |
|
We will learn the followings:
(1) Complexity: time complexity, space complexity
(2) Basic data structures: list, stack, queue, tree
(3) Basic algorithms: searching, sorting, graph, pattern matching
(4) Designing algorithms: recursion, dynamic programming, backtracking
This course is related to DP2.
|
| ２． |
Objectives |
|
The aim of this course is to comprehend basic data structures and algorithms. The learners have to master the methods of analyzing and designing algorithms and should acquire the ability to apply basic techniques to actual problems.
|
| ３． |
Grading Policy |
|
The learners must submit two reports. After two reports are accepted, the learners can take an exam and are evaluated by the exam. The learners can get feedback from the reports in which professors write comments.
|
| ４． |
Textbook and Reference |
|
Masayuki Arai: "Data Structures and Algorithm using Java Applet," Kyoritsu Shupppan, 2008.
|
| ５． |
Requirements (Assignments) |
|
The class proceeds according to contents of the textbook.
The learners must read the part of the textbook carefully then confirm concept of each class's keywords before class (1.5 hours), and take exercises written in the end of the section after the class (1.5 hours).
|
| ６． |
Note |
|
Not only reading the textbook, but learners should write programs to reconfirm the contents.
Please install Eclipse and JDK in your computers.
|
| ７． |
Schedule |
|
１. The relationship between algorithm and data structures
|
２. Time and space complexity
|
３. Basic data structure (1) : Array
|
４. Basic data structure (2) : Class
|
５. Basic data structure (3) : List
|
６. Basic data structure (4) : Stack and data structures written in Java,
|
７. Basic data structure (5) : Tree structure
|
８. Basic data structure (6) : Balanced tree (1)
|
９. Basic data structure (7) : Balanced tree (2)
|
10. Basic data structure (8) : Heap
|
11. Search algorithm (1) : Linear searching, binary searching, and depth first searching
|
12. Search algorithm (2) : Width first searching, backtracking and hash
|
13. String matching algorithm : Knuth-Morris-Pratt method, Boyer-Moore method, and recursion
|
14. Sort algorithm : Simple sort, bubble sort, and quick sort
|
15. Summarization and examination
|
|
| １． |
Outline |
|
We will learn the followings:
(1) Complexity: time complexity, space complexity
(2) Basic data structures: list, stack, queue, tree
(3) Basic algorithms: searching, sorting, graph, pattern matching
(4) Designing algorithms: recursion, dynamic programming, backtracking
This course is related to DP2.
|
| ２． |
Objectives |
|
The aim of this course is to comprehend basic data structures and algorithms. The learners have to master the methods of analyzing and designing algorithms and should acquire the ability to apply basic techniques to actual problems.
|
| ３． |
Grading Policy |
|
The learners must submit two reports. After two reports are accepted, the learners can take an exam and are evaluated by the exam. The learners can get feedback from the reports in which professors write comments.
|
| ４． |
Textbook and Reference |
|
Masayuki Arai: "Data Structures and Algorithm using Java Applet," Kyoritsu Shupppan, 2008.
|
| ５． |
Requirements (Assignments) |
|
The class proceeds according to contents of the textbook.
The learners must read the part of the textbook carefully then confirm concept of each class's keywords before class (1.5 hours), and take exercises written in the end of the section after the class (1.5 hours).
|
| ６． |
Note |
|
Not only reading the textbook, but learners should write programs to reconfirm the contents.
Please install Eclipse and JDK in your computers.
|
| ７． |
Schedule |
|
１. The relationship between algorithm and data structures
|
２. Time and space complexity
|
３. Basic data structure (1) : Array
|
４. Basic data structure (2) : Class
|
５. Basic data structure (3) : List
|
６. Basic data structure (4) : Stack and data structures written in Java,
|
７. Basic data structure (5) : Tree structure
|
８. Basic data structure (6) : Balanced tree (1)
|
９. Basic data structure (7) : Balanced tree (2)
|
10. Basic data structure (8) : Heap
|
11. Search algorithm (1) : Linear searching, binary searching, and depth first searching
|
12. Search algorithm (2) : Width first searching, backtracking and hash
|
13. String matching algorithm : Knuth-Morris-Pratt method, Boyer-Moore method, and recursion
|
14. Sort algorithm : Simple sort, bubble sort, and quick sort
|
15. Summarization and examination
|
|
|