| Algorithms and Data Structures in C++ by Alan Parker CRC Press, CRC Press LLC ISBN: 0849371716 Pub Date: 08/01/93 |
Index
A
- Acyclic graph 66
- Adder
- CLA adder module 200
- CLA adder, 16 bit 203
- full 189
- half 189
- output delay for half adder 193
- 2s Complement 4 bit adder 192
- Addition
- carry lookahead 197
- overflow 196
- ripple carry 191, 193
- 2s complement 187
- Adjacency matrix 80
- Algorithm
- booth 223
- efficiency 71
- order 37
- pipelining 71
- time complexity 38
- Arrays 112
- class 119
- example of 114
- ASCII 26
B
- Binary search 149
- Bit operators 20
- Bit-pair recoding 228
- Booth algorithm 223
- Bridge 67
- Broadcast 78
C
- Carry lookahead addition 197
- Circular lists 133
- CLA adder
- 16 bit 203
- CLA adder module 200
- Connected graph 65
- Conversion
- residue number system 246
- Crossbar
- topology 74
- Cube-connected cycles
- topology of 77
- Cycle
- in a graph 66
D
- Data structures 101
- Decimal to binary conversion 28
- delete 102, 110
- Directed graph 65
- Division
- fixed point 232
- nonrestoring 234
- restoring 233
- Doubly linked lists 133
- Dynamic memory allocation 101, 110
E
- Efficiency 71, 83
- Efficient hypercubes 80
- Euler totient function 246
F
- Factorial 45
- Fibonacci numbers 46
- FIFO 122
- File formats
- DOS 32
- Unix 32
- Fill 52
- Fixed point division 232
- Floating point
- Newtons method 241
- Floating point notation 16
- free 112
G
- Graph 62
- acyclic 66
- adjacency matrix of 80
- bridge 67
- connected 65
- cycle 66
- directed 65
- neighbors 64
- order 63
- path 64
- planar 68
- size 63
- subgraph 64
- transitive closure 68
- tree 67
H
- Hypercube
- broadcast 78
- distance between processors 78
- efficiency 83
- efficient 83
- message passing 78, 79
- path length 81
- topology of 76
- Hypercubes
- efficient 80
I
- IEEE 754 Floating Point Standard 16
- Induction 42
- infinite descent 43
- Infinite descent 43
- Integers 1
L
- Least-weighted path length 81
- LIFO 122
- Linear search 148
- Linked lists 126
- circular lists 133
- doubly linked lists 133
- operations on 134
- singly linked lists 126
M
- malloc 112
- Mathematical Induction 42
- Matrix
- adjacency 80
- Median of three 152
- Message
- in a hypercube 79
- Message passing
- in a hypercube 78
- Moveto 52
- Multiplication
- bit-pair recoding 228
- booth algorithm 223
- shift-add 221
- 2s complement 215
N
- new 102, 110
- Newpath 52
- Newtons method 241
- Nonrestoring division 234
O
- Operator
- overloading 117
- Order 37
- of a graph 63
- Overflow
- in addition 196
- Overloading
- of operators 117
P
- Path 64
- Pipelining 71
- Planar graph 68
- Pointers 101, 105
- as arrays 107
- double pointer example 106
- Postscript 52
- Procedure
- recursive 45
Q
- Quadratic formula 48
- Quicksort 150
- median of three 152
R
- Rectangular mesh
- topology of a 76
- Recurrence relation 46
- Recursion 45
- tower of hanoi 51
- Representations
- ASCII 26
- floating point 16
- integer 1
- signed-magnitude notation 6
- unsigned notation 5
- 2s complement notation 7
- Residue number system 244
- data conversion 246
- range of numbers 245
- representation in 244
- Restoring division 233
- Ripple carry addition 191
- Rlineto 52
S
- Searching
- binary search 149
- linear search 147
- Setgray 52
- Setlinewidth 52
- Shift-add multiplication 221
- Showpage 52
- Sign extension 11
- signed-magnitude notation 12
- 2s complement notation 12
- unsigned notation 12
- Signed-magnitude notation 6
- Simulated annealing 165
- Size
- of a graph 63
- Sorting
- quicksort 150
- Stack
- fifo 122
- lifo 122
- Subgraph 64
T
- Time complexity 38
- Topology
- crossbar 74
- cube-connected cycles 77
- hypercube 76
- rectangular mesh 75
- Tower of hanoi 51
- Transitive closure 68, 80
- Tree 67
- 2s complement notation 7
U
- Unions 20, 33
- Unsigned notation 5
V
- Visualization 52
Copyright © CRC Press LLC