Page 11 - Data Structures Interactive Book
P. 11
10.8 Summary .............................................................................................................. 136
10.9 Exercise ................................................................................................................ 138
CHAPTER 11 ADVANCED DATA STRUCTURES ..................................................... 140
11.1 Sets and multi-sets ................................................................................................ 141
11.1.1 Definition and Characteristics ...................................................................... 141
11.1.2 Operations on Sets ........................................................................................ 141
11.1.3 Multi-Sets and Applications ......................................................................... 141
11.1.4 Example Programs in C++ ............................................................................ 142
11.2 Tables ................................................................................................................... 143
11.2.1 Definition of Tables (ADT) .......................................................................... 144
11.2.2 Relations to Arrays and Hash Tables ............................................................ 144
11.2.3 Applications in Databases and Information Systems ................................... 144
11.2.4 Example Implementation in C++ .................................................................. 144
11.3 String Algorithms ................................................................................................. 145
11.3.1 Importance of String Processing ................................................................... 145
11.3.2 Basic Operations ........................................................................................... 146
11.3.3 Knuth-Morris-Pratt (KMP) Algorithm ......................................................... 146
11.3.4 Rabin-Karp Algorithm .................................................................................. 147
11.3.5 Boyer-Moore Algorithm ............................................................................... 148
11.4 Priority Queues ..................................................................................................... 149
11.4.1 Definition and Characteristics ...................................................................... 149
11.4.2 Implementation Using Heaps ........................................................................ 150
11.4.3 Applications in Scheduling and Networking ................................................ 150
11.4.4 Example Programs in C++ ............................................................................ 151
11.5 Summary .............................................................................................................. 152
11
