1. | (1) Basic concepts | 1) Overview 2) Algorithm Specification 3) Data Abstraction | ||
2. | (2) Basic concepts, arrays, structures | 1) Performance Analysis 2) Performance Measurement 3) Array as an ADT 4) Structures and Unions | ||
3. | (3) Arrays and Structures I | 1) Array as an ADT 2) Structures and Unions 3) Polynomial ADT | ||
4. | (4) Arrays and Structures II | 4) Sparce matrix ADT 5) 다차원 array의 표현 6) String ADT | ||
5. | (5) Stacks and Queues | Chapter3. Stacks and Queues 3.1 The Stack Abstract Data Type 3.2 The Queue Abstract Data Type 3.3 예제: 미로 문제 (생략) 3.4 Evaluation of Expressions 3.5 Multiple Stack | ||
6. | (6) Lists | Chapter 4: Lists 4.1 Pointers 4.2 Singly Linked Lists (단일 연결 리스트) | ||
7. | (7) Lists | Ch. 4 Lists Chain 연산 / 연산 뒤집기 | ||
8. | (8) Lists | 4.5 Additional List Operations (추가 리스트 연산) 4.6 (생략) Equivalence Relations (동치 관계) 4.7 (생략) Sparse Matrices (희소 행렬) 4.8 Doubly Linked Lists (이중 연결 리스트) | ||
9. | (9) Trees | Chap 5. Trees 5.1 Introduction 5.2 Binary Trees | ||
10. | (10) Trees | 5.3) Binary Tree Traversal 5.4) 이진 트리의 추가 연산 5.5) Threaded Binary Trees 5.6) Heaps 5.7) Binary Search Trees 5.8) Selection Trees 5.9) Forests 5.10) Set 표현 | ||
11. | (11) Graphs & Hashing | Chap 6. Graphs Chap 8. Hashing | ||
12. | (12) Sorting | Chap 7. Shorting -Selection Sorting -이중 selection sorting -Bubble Sort -Insertion Sort -Merge Sorting -Quick Sorting |