Mastering Algorithms With C - Kyle Loudon [231]
abstraction, An Introduction to Data Structures
defined, Introduction
destruction, Storage Allocation
efficiency, An Introduction to Data Structures
encapsulated functions, Function Pointers
initialization, Storage Allocation
pointers in, An Introduction to Data Structures
reasons for using, An Introduction to Data Structures
reusability, An Introduction to Data Structures
storage management, Storage Allocation
two pointing to the same data, Questions and Answers
database queries, Sets
database systems, Sets, Hash Tables, Trees, Related Topics, Sorting and Searching, Data Compression
B+-trees, B*-trees, and B-trees in, Related Topics
binary trees in, Trees
data compression in, Data Compression
hash tables in, Hash Tables
query languages, Sets
decision trees, Trees
delivery services, Heaps and Priority Queues, Priority Queue Example: Parcel Sorting, Graph Algorithms
dense graphs, Description of Graphs
depth-first forests, Depth-first search
depth-first search, Depth-first search, Graph Example: Topological Sorting, Questions and Answers
deques, Related Topics
dequeue event, Queue Example: Event Handling
derivatives of functions, Related Topics
DES, Description of DES (see Data Encryption Standard)
descendant nodes, Description of Binary Trees
destroy_left function, bistree_destroy, bistree_size
destroy_right function, bistree_destroy, bistree_size
destroy_tree function, huffman_uncompress
des_decipher function, des_decipher, des_decipher
des_encipher function, des_encipher, des_encipher
des_main function, des_encipher
dfs function, Graph Example: Topological Sorting, Graph Example: Topological Sorting
DfsVertex structure, Graph Example: Topological Sorting, Graph Example: Topological Sorting
dfs_main function, Graph Example: Topological Sorting, Graph Example: Topological Sorting
dictionary-based compression, Data Compression
diffusion principle, Description of DES
digital cash, Data Encryption
digital signatures, Data Encryption
Dijkstra's algorithm, Dijkstra's Algorithm
direct-address tables, Related Topics
directed acyclic graphs, Graphs, Description of Graphs, Graph Example: Topological Sorting
directed graphs, Description of Graphs
directory listings, Sorting and Searching, Quicksort Example: Directory Listings
discovery times, Questions and Answers
dispatch function, Queue Example: Event Handling
divided-difference tables, Constructing an Interpolating Polynomial
division method (hashing), Division method
DList structure, Implementation and Analysis of Doubly Linked Lists, Implementation and Analysis of Doubly Linked Lists
DListElmt structure, Implementation and Analysis of Doubly Linked Lists
dlist_data, Return Value, Implementation and Analysis of Doubly Linked Lists, dlist_size, dlist_head, dlist_tail, dlist_is_head, dlist_is_tail, dlist_data, dlist_next, and dlist_ prev
dlist_destroy, dlist_destroy, Description, Implementation and Analysis of Doubly Linked Lists, dlist_destroy, dlist_size, dlist_head, dlist_tail, dlist_is_head, dlist_is_tail, dlist_data, dlist_next, and dlist_ prev
dlist_head, Description
dlist_init, dlist_init, dlist_init
dlist_ins_next, Description, dlist_ins_next
dlist_ins_prev, Description, dlist_ins_ prev
dlist_is_head, Description
dlist_is_tail, Return Value
dlist_next, Return Value
dlist_prev, Return Value
dlist_remove, Description, dlist_remove
dlist_size, Description
dlist_tail, Description
double hashing, Double hashing
double-ended queues, Related Topics, Related Topics
doubly-linked circular lists, Description of Circular Lists, Related Topics
doubly-linked lists, Description of Doubly-Linked Lists, Description of Doubly-Linked Lists, Return Value, Return Value, Implementation and Analysis of Doubly Linked Lists, dlist_init, dlist_destroy,