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 |
Assignments | Total. | |
---|---|---|
1. | 25% | 25% |
2. | 25% | 25% |
3. | 25% | 25% |
4. | 25% | 25% |
Total. | 100% | - |
Work experience | Work experience and relevance to the course content if applicable |
---|---|
N/A | N/A |