1142_Computer Algorithms_355287
Registration：Now ~ Any Time
Course Period：Now ~ Any Time
LINE sharing feature only supports mobile devices
Course Intro
Course Resources
-
Course Outline
-
Lec1_Chapter01 (1)
-
Complementary Material_未來數學家的挑戰
-
Complementary Material_NP-complete的概念
-
Lec2_chapter02
-
Divide and Conquer Paradigm
-
Lec3_chapter03
-
Complemetary Materials: Factorial n
-
Lec4_Chapter04
-
NP-complete的概念
-
NP-Completeness
-
Homework #1
-
chapter06[1]
-
chapter07[1]
-
Complementary Material__Expected Running Time of Randomized Quicksort
-
chapter08[1]
-
chapter09[1]
-
chapter16
-
chapter15
-
An introduction to heuristic algorithms
-
Complementary Material_Dynamic Programming
-
chapter22[1]
-
Complementary Material_Shortest paths proof of BFS
-
chapter23[1]
-
chapter24[1]
-
Complementary Material_Bellman-Ford
-
Complementary Material_Bellman-Ford_dynamic-programming
-
NP-completeness_34
-
[錄] 03061610
-
[錄] 03131615
-
[錄] 03201617
-
[錄] 03201723
-
[錄] 03271627
-
[錄] 03271731
Teacher / 蕭榮修
Related Courses
|
|
||||||
|
|
|
||||||
|
|
|
||||||
|
|
|
||||||
|