▶Japanese
Post to SNS
- Home
- > School of Engineering
- > Undergraduate major in Information and Communications Engineering
- > Discrete Structures and Algorithms
- School of Science
-
School of Engineering
- Undergraduate major in Mechanical Engineering
- Undergraduate major in Systems and Control Engineering
- Undergraduate major in Electrical and Electronic Engineering
- Undergraduate major in Information and Communications Engineering
- Undergraduate major in Industrial Engineering and Economics
- Common courses
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
- School of Environment and Society
- 工学院，物質理工学院，環境・社会理工学院共通科目
- Liberal arts and basic science courses
- First-Year Courses
- School of Science
- School of Engineering
- School of Materials and Chemical Technology
- School of Computing
- School of Life Science and Technology
-
School of Environment and Society
- Department of Architecture and Building Engineering
- Department of Civil and Environmental Engineering
- Department of Transdisciplinary Science and Engineering
- Department of Social and Human Sciences
- Department of Innovation Science
- Graduate major in Technology and Innovation Management
- Common courses
- Liberal arts and basic science courses
- Academic unit or major
- Undergraduate major in Information and Communications Engineering
- Instructor(s)
- Takahashi Atsushi
- Class Format
- Lecture / Exercise
- Media-enhanced courses
- Day/Period(Room No.)
- Mon5-8(W631) Thr7-8(W631)
- Group
- -
- Course number
- ICT.M215
- Credits
- 3
- Academic year
- 2021
- Offered quarter
- 4Q
- Syllabus updated
- 2021/5/6
- Lecture notes updated
- 2022/1/7
- Language used
- Japanese
- Access Index
-
- Supplementary documents
Lecture
Lecture 1 Graph and its representation / Tree and forest
1-1グラフとその表現(766KB)
Exercise
Lecture 2 Exercise
2021.12.9(Thu.) 7-8Session
Lecture
Lecture 3 Bipartite graph, graph coloring, Eulerian graph, and Hamiltonian graph / Asymptotic evaluation of function
Exercise
Lecture 4 Exercise
2021.12.16(Thu.) 7-8Session
Lecture
Lecture 5 Analysis of algorithm / Sorting algorithm
Exercise
Lecture 6 Exercise
2021.12.23(Thu.) 7-8Session
Midterm Examination
Lecture 7 Midterm exam
2022.1.6(Thu.) 7-8Session
Lecture
Lecture 8 Search algorithm / Shortest path algorithm
Lecture
Lecture 9 Maximum spanning tree algorithm / Exercise
2022.1.17(Mon.) 5-8Session
Lecture
Lecture 10 Design methodologies of algorithm
2022.1.20(Thu.) 7-8Session
Lecture
Lecture 11 Greedy algorithm / Exercise
2022.1.24(Mon.) 5-8Session
Lecture
Lecture 12 Greedy algorithm
2022.1.27(Thu.) 7-8Session
Lecture
Lecture 13 Approximate algorithm / Exercise
2022.1.31(Mon.) 5-8Session
End of Term Examination
Lecture 14 Final exam
2022.2.3(Thu.) 7-8Session
It is necessary for those who refer to the PDF file to use "Adobe Reader" as the plug-in software of Adobe System Company.
If you don't have the software, please download from this item (free).
