Transcript Data Structures Chapter 5 Trees

Practice of Data Structures
Syllabus
Instructor: Ching-Chi Lin
林清池 助理教授
[email protected]
Department of Computer Science and Engineering
National Taiwan Ocean University
What Will You Learn From PDS?
Basic Concepts
Arrays and Structures
top
Stacks and Queues
Lists
20
Trees
15
2
Graphs
14
10
Sorting
tree
Hashing
*first, trail
Heap Structures









2
1
10
3
0
1
array
J3 J4
B
A
J2
J5
J1
J6
J7
queue
stack
10
50
list
20
NULL
Course Objectives

To help you develop a solid understanding of what
data structure is

To equip you to use fundamental data structures
effectively in subsequent courses

To help you be able to implement computer-based
solutions to solve real problems
To help you be able to do a Big-Oh analysis for the
implementations of basic data structures

3
Textbooks
Fundamentals of Data Structures in C, 2/e


Authors : Sartaj Sahni, Ellis Horowitz, and Susan

Publisher : Silicon Press (2008)

ISBN : 9780929306407
代理商

4

開發圖書

電話: 02-8242-3988
TAs and Grading Policy
TAs







洪進德 楊宗豫
E-mail
Homepage
TA hours
Labs
Phones
資工所碩一
[email protected]
http://www.cs.ntou.edu.tw/lincc/courses/pds98
TBA
INS503 INS605
6607
6636
Grading Policy



5
Weekly programming assignments : 60%
Attendance : 40%