白塊線上課程

Week 1 Getting Started、Heap

Introduction

1m 19s

Sorting 的方法 & 分析

1m 19s

Exercise - Insertion Sort

1m 19s

Sorting 的分析

1m 19s

Exercise - Merge Sort

1m 19s

Growth of Functions

1m 19s

Exercise - Growth of Functions

1m 19s

Insertion Sort 上機

1m 19s

Heap-1

1m 19s

Exercise - Heap I

1m 19s

Heap-2

1m 19s

Exercise - Heap II

1m 19s
Week 2 Sorting Lower Bound、Basic Data Structures I (List, Queue, Stack)

Lower Bound on Comparison Sorts - 1

1m 19s

Exercise - Lower Bound on Comparison Sorts I

1m 19s

Lower Bound on Comparison Sorts - 2

1m 19s

Exercise - Lower Bound on Comparison Sorts II

1m 19s

Pointers in C

1m 19s

Basic Data Structure Ⅰ - 1

1m 19s

Basic Data Structure Ⅰ - 2

1m 19s

Exercise - Basic Data Structure I

1m 19s

Josephus 上機

1m 19s

Exercise - Josephus Problem

1m 19s

Balanced 括號上機

1m 19s

Exercise - Balanced Parentheses

1m 19s

List 上機_insert

1m 19s

List 上機_delete

1m 19s
Week 3 Basic Data Structures II (Tree, Graph)、Graph and Tree Traversals I (BFS, DFS)

Tree and Graph

1m 19s

Exercise - Tree

1m 19s

Breadth First Search

1m 19s

Exercise - Breadth First Search

1m 19s

Depth First Search

1m 19s

Exercise - Depth First Search

1m 19s

Depth First Search 分析

1m 19s
Week 4 Graph and Tree Traversals II (Tree Traversals, Expression Tree )、Graph and Tree Traversals III (Topological Sort)

Tree Traversal

1m 19s

Exercise - Tree Traversal

1m 19s

Expression Tree & Postfix Notation of an Expression

1m 19s

Infix-Postfix Coversion

1m 19s

Exercise - Expression

1m 19s

Topological Sort

1m 19s

Topological Sort 證明

1m 19s

Exercise - Topological Sort

1m 19s

Two IQ Questions

1m 19s

Exercise - Josephus Problem Revisited

1m 19s
Week 5 Searching Set Data I (Binary Search Tree)

Binary Search Tree

1m 19s

Binary Search Tree 實作 (Min / Max)

1m 19s

Binary Search Tree 實作 (Search / Predecessor)

1m 19s

Binary Search Tree 實作 (Insert / Delete)

1m 19s

Binary Search Tree 實作 (Delete) - Case 1 & 2

1m 19s

Binary Search Tree 實作 (Delete) - Case 3

1m 19s

BST上機_insert

1m 19s

BST上機_delete_1

1m 19s

BST上機_delete_2

1m 19s

BST上機 - 3

1m 19s

Exercise - Binary Search Tree

1m 19s
Week 6 Searching Set Data II (AVL Tree)

AVL Tree

1m 19s

AVL Tree - Rotation

1m 19s

AVL Tree - Insertion 的情形

1m 19s

AVL Tree - Insertion實作 Case 2.2

1m 19s

AVL Tree - Insertion 實作 Case 2.3

1m 19s

AVL Tree Insert 補充 & Delete

1m 19s

Augmenting Data Structure

1m 19s

Exercise - AVL Tree

1m 19s
Week 7 Searching Set Data III (B-Tree)

B-tree EM Model

1m 19s

B-tree insert

1m 19s

B-tree delete

1m 19s

Exercise - B Tree I

1m 19s

Exercise - B Tree II

1m 19s
Week 8 Hashing (Chaining, Open Addressing)、Suffix Tree and Suffix Array

Hashing

1m 19s

Common Hash Function

1m 19s

Exercise - Hashing

1m 19s

Indexing Strings & Suffix Array

1m 19s

Exercise - Suffix Array

1m 19s

Course Descriptions

「資料結構」是學習以聰明的方法去儲存資料，使得我們在有需要的時候能夠快速有效地把資料擷取。例如我們希望把學生某一科的考試成績整理，使得我們能隨時查詢任何學生的排名。為了節省查詢的時間，我們或許會把學生們的成績從高至低排好，而不會以隨意的順序排列。〈對此問題，其實還有一個更好的方法呢！〉

本課程提供線上測驗，但不提供線上成績單，僅提供成績顯示。

How students rated this courses

4.5

(Based on 27 reviews)

53%

36%

Reviews

No Course Rating now

指定用書

1.Introuction to Algorithms

Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein

2.Fundamentals of Data Structures in C＋＋

Ellis Horowitz, Sartaj Sahni, Dinesh Mehta

參考資料

Algorithms in C＋＋Robert Sedgewick

先修課程

C/C＋＋ Programming

Sign Course

What’s included

16 hours video
Certificate
12 Article
Watch Offline
Lifetime access

韓永楷

國立清華大學資訊工程學系教授

4.5Instructor Rating

11,604

Students

32

Courses

12,230

Reviews

聯絡方式：wkhon@cs.nthu.edu.tw

研究專長

字串比對、資料壓縮、組合最優化

學歷

香港大學計算機科學系博士

經歷

美國普渡大學計算機科學系客座教授

國立清華大學電機資訊學院學士班主任

國立清華大學教學發展中心組長

View Details

Guests

2024-自學課程-資料結構導論(1-6月)

Course Descriptions

How students rated this courses

4.5

Reviews

What’s included

韓永楷

11,604

32

12,230