2022 Discrete Structures and Algorithms

Font size  SML

Register update notification mail Add to favorite lecture list
Academic unit or major
Undergraduate major in Information and Communications Engineering
Instructor(s)
Takahashi Atsushi 
Class Format
Lecture / Exercise    (Face-to-face)
Media-enhanced courses
Day/Period(Room No.)
Mon5-8(S621)  Thr7-8(S621)  
Group
-
Course number
ICT.M215
Credits
3
Academic year
2022
Offered quarter
4Q
Syllabus updated
2022/4/20
Lecture notes updated
2023/2/16
Language used
Japanese
Access Index
Supplementary documents 

Lecture

Lecture 1 Graph and its representation

2022.12.8(Thu.) 7-8Session

Lecture

Lecture 2 Tree and forest / Exercise

2022.12.12(Mon.) 5-8Session

Lecture

Lecture 3 Bipartite graph, graph coloring, Eulerian graph, and Hamiltonian graph

Lecture

Lecture 4 Asymptotic evaluation of function / Exercise

2022.12.19(Mon.) 5-8Session

Lecture

Lecture 5 Analysis of algorithm

2022.12.22(Thu.) 7-8Session

Lecture

Lecture 6 Sorting algorithm / Exercise

2022.12.26(Mon.) 5-8Session

Midterm Examination

Lecture 7 Midterm exam

2023.1.5(Thu.) 7-8Session

Lecture

Lecture 8 Search algorithm

2023.1.12(Thu.) 5-8Session

Lecture

Lecture 9 Shortest path algorithm / Maximum spanning tree algorithm

Exercise

Lecture 10 Exercise

2023.1.19(Thu.) 7-8Session

Lecture

Lecture 11 Design methodologies of algorithm / Greedy algorithm

Exercise

Lecture 12 Exercise

2023.1.26(Thu.) 7-8Session

Lecture

Lecture 13 P and NP / Approximate algorithm

Exercise

Lecture 14 Exercise

2023.2.2(Thu.) 7-8Session

Get Adobe Reader

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).

Creative Commons License