What The Course Is About What is data structure?
資料在電腦記憶體(或檔案)中的組織方式
eg. 50個學生的資料可以variable方式儲存,或以array方式儲存, 或以linked list方式儲存,或以binary tree方式儲存, 其中array, linked list, bianry tree等,都是基本資料結構 Purpose of this course
學習各種資料結構的使用方法
學習分析各類程式的效能(time and space)
What we do in this course will be used in most of the follow-up courses you will take. Essential to become expert in what we do this semester. Else, you will be handicapped in later courses.
Prerequisites Important features of C++
template functions
classes and template classes
operator overloading
exception handling constructs
try – throw– catch clause
dynamic allocation and de-allocation
new and delete
public, protected, private class members
Polymorphism
Java review … Chapter 1
Performance Analysis … Chapter 2
Asymptotic complexity … Chapter 3
Contents of This Course Basic Concepts
Time complexity
Stacks
Queues
Linked Lists
Trees
Binary trees
Heaps
Contents of This Course Sorting
Insertion sort, Quick sort, Merge sort, Heap sort, other sorting methods
Hashing
Graphs
Comments