Introduction to Data Structures

1. Introduction toData Structures Wen-Yang Lin Dept. of Computer Science and Information Engineering National University of Kaohsiung Revised from Been-Chian Chen and Wei-Pang Yang National University of Tainan and National Dong Hwa University

2. Contents • Basic Concepts • Arrays • Stacks and Queues • Linking Lists • Trees • Graphs • Sorting • Hashing • Heap Structures • Searching • References: • Lecture Notes • Textbook: Horowitz, E., Sahni, S. and Mehta, D., “Fundamentals of Data Structures in C.” Computer Sciences Press, 1993.

3. Outline • Part I: Introduction • System Life Cycle: Development of Programs • Performance Analysis • Part II: Fundamental data structures • ARRAY • STACK • QUEUE • LINKED LIST • TREE • GRAPH Ch.1 Ch.2, 3, 4, 5, 6

4. Outline • Part III: Sorting and Searching • Searching methods • Internal sorting methods • External sorting methods • Part IV. File structure • Hashing • Index techniques • File organization Ch.7 Ch.8, 9, 10

5. Some Problems in Data Structures • 1) Math Expression Evaluation • 2) Searching • 3) Sorting • 4) How fast a sort? • 5) Shortest Path, Critical Path • 6) Minimal Spanning Tree • 7) Hashing • 8) Index Technique • 9) Magic problem • 10) A Mazing Problem • 11) Sparse Matrix Product • . • . • .

6. Advanced Programming－Data Structures • Importance of Data Structures－ C13 C14 C15 C5 C4 C8 C2 C9 Algorithms C3DS C6 AI C1BCC C7 Graphics C10 Languages C11 C12

7. ** 2006 DS Schedule **

8. Report of Programming Project • 內容： • 題目與作者 • 分析 • Program list (須加comment) • Result • Discussion: order、CPU time、心得、注意事項、其它 • 紙張：A4 • 成績 • 成績=f(Correctness, Documentation, Presentation, On-time, Others)

9. DS Grading • Midterm exam: 25% • Final exam: 25% • Exercise: 15% • Programming: 25% • Presence: 10%

10. Questions?

11. Comments?