資料結構 (含資料結構實習)
Data Structure (including Data Structure Exercises)

劉瑞瓏
Rey-Long Liu

2019/1/23

 

 

Goal:

Learning to design suitable data structures for efficient problem solving.


Prerequisite:

Programming using C.


Content:

[W1] Introduction & Pseudocode, Algorithms, and Time Complexity of algorithms

[W2]  Searching -- Linear searching

[W3] Searching -- Hash searching (I)

[W4] Searching -- Hash searching (II)

[W5] Searching -- Hash searching (III)

[W6] Linked Lists -- Linearly Linked lists

[W7] Linked Lists -- Complex Linked Lists

[W8] Stack -- Concepts and  Implementation

[W9] Midterm Examination

[W10] Stack -- Application  

[W11] Queue -- Concepts and Implementation

[W12] Queue --  Application

[W13] Tree -- Tree traversal and applications  

[W14] Tree -- Search trees

[W15] Sorting -- Exchange & Merge sort

[W16] Sorting -- Insertion sort & Selection sort

[W17] Sorting -- External sort, Summary

[W18] Final Examination

 

Grading:

1. Exercises (40%)

2. Midterm examination (30%)

3. Final examination (30%)

 

Textbook:

Gilberg R. F. and Forouzan B. A., 2005, "Data Structures -- A Pseudocode Approach with C," 2nd edition, Course Technology, Cengage Learning.

 

Back to Teaching