• 沒有找到結果。

20070921 chap00 Hsiu-Hui Lee 2

N/A
N/A
Protected

Academic year: 2022

Share "20070921 chap00 Hsiu-Hui Lee 2"

Copied!
3
0
0

加載中.... (立即查看全文)

全文

(1)

1

Introduction

資料結構與演算法(上)

Data Structure & Algorithm (1)

李秀惠

20070921 chap00 Hsiu-Hui Lee 2

目標

• 進一步探討各類進階的演算方法以及較複雜的

資料結構

(2)

2

20070921 chap00 Hsiu-Hui Lee 3

課程大綱

I Foundations

1 The Role of Algorithms in Computing 2 Getting Started

3 Growth of Functions 4 Recurrences

5 Probabilistic Analysis and Randomized Algorithms

II Sorting and Order Statistics

6 Heapsort 7 Quicksort 8 Sorting in Linear Time 9 Medians and Order Statistics

III Data Structures

10 Elementary Data Structures 11 Hash Tables

12 Binary Search Trees 13 Red-Black Trees 14 Augmenting Data Structures

IV Advanced Design and Analysis Techniques

15 Dynamic Programming 16 Greedy Algorithms 17 Amortized Analysis

V Advanced Data Structures

18 B-Trees 19 Binomial Heaps 20 Fibonacci Heaps 21 Data Structures for Disjoint Sets

20070921 chap00 Hsiu-Hui Lee 4

• 教科書:

Introductions to Algorithms, second edition

by Thomas H. Cormen, Charles E. Leiserson,

Ronald L. Rivest, and Clifford Stein MIT Press, 2001.(開發代理)

• 網站:

http://mitpress.mit.edu/algorithms/

MIT OCW

http://www.csie.ntu.edu.tw/~ds200702f

(at NTU CSIE)

(3)

3

20070921 chap00 Hsiu-Hui Lee 5

• 成績評量方式:

作業(30%)+期中考(35%)+期末考(35%)+Bonus(5%)

• 助教:

彭兆蔚

Email: ds200702f @csie.ntu.edu.tw

Blog: http://www.pada.biz/Algorithm96.blog

• 時間:星期五 9:10-12:00 資訊系館 102

參考文獻

相關文件

For his major contributions to the analysis of algorithms and the design of programming languages, and in particular for his contributions to. “The Art of Computer Programming”

Good Data Structure Needs Proper Accessing Algorithms: get, insert. rule of thumb for speed: often-get

In computer science, the treap and the randomized binary search tree are two closely related forms of binary search tree data structures that maintain a dynamic set of ordered keys

• raw scores 80, 60 with term scores F, B: impossible from the principle: no individual score

tree type maximum height minimum height average height after insertion after insertion after insertion height-bounded binary search tree.. AVL tree

In this paper we study data trees in which the data values come from a linearly ordered domain, and in addition to equality test, we can test whether the data value in a node is

12 Partial Derivatives 13 Multiple Integrals 14 Multiple Integrals 15 Multiple Integrals 16 Vector Calculus 17 Vector Calculus 18

Lower bound on the cost of any algorithm in the GST model is generalized from the interleave lower bound of BST 3 to search trees on