Algorithms For Dummies

Index

---

406

 

   

  

Algorithms For Dummies

bitwise operators, 71

Black Hat search engine optimization (Black Hat SEO), 

209–210

Bloom, Burton H. (author)

Space/Time Trade-offs in Hash Coding with Allowable 

Errors, 239

Bloom Filters, 151, 239–247

Bonaparte, Napoleon (military leader), 28

Boolean circuits, 348–349

Boolean expressions, comparing data using, 72–74

Boolean values, 69

Borůvka’s algorithm, 186

bottom-up solutions, 301

bounded knapsack problem, 309

bounds, 360

branch nodes, 125, 275

breadth-first search (BFS), 34, 176–177, 343

Brin, Sergey (author)

“The Anatomy of a LargeScale Hypertextual Web 

Search Engine,” 210

“PageRank: Bringing Order to the Web,” 213

brute-force solutions, 29, 30, 34

BST (binary search tree), 143

Burrows-Wheeler Transform algorithm, 273

C

C (website), 47

cache, 290, 299–300

cached computer data, 290–291

cache_info

 method, 307

caching, 303

calling functions, 78–81

Cartesian coordinate system, 39, 360, 362

centrality, computing, 166–169

chaining, 150

change()

 function, 285

ChaosKey, 393

cheat sheet (website), 4

check_solution

 function, 350

child nodes, 275

circuit satisfiability, 349

clairvoyant replacement algorithm, 291

classification systems, 29–30

clause, 82

clique, 201–203

clique percolation method, 202

cloaking, 211

closed category, 199

cluster computing, 18

clustering

graphs, 166

networks in groups, 198–201

code blocks, 78

code repository, 59–65

collisions, 148, 149–150

colon (:), 82, 125

columns, in a transition matrix, 216

COM (website), 47

comb

 function, 311

“Combinatorics of the Change-Making Problem” 

(Adamszek and Adamaszek), 32

communities, discovering, 201–203

companion files, book (website), 4

Comparison of Probabilistic Test for Primality  

(Finn), 323

comparisons, 135

complex number, 69

compress

 method, 271

compressing data

about, 265–266

algorithms for, 394

choosing types of, 271–273

effects of, 267–269

encoding, 266–267

LZW algorithm, 275–279

types of, 269–271

using Huffman compression, 273–275

computers, solving problems with, 15–19

concatenation, 88

conditional statements, 81–85

connected pair category, 199

Connection Suggestion algorithm (LinkedIn), 199

constant complexity O(1), 40

constrain programming, 358

constraints, 360

consumed data, 233

---

Index 

     407

convex hull algorithm, 359

cores, 252

costs, computing, 33–35

counterexamples, finding, 26–27

Count-Min Sketch algorithm, 151, 247–248

CPLEX, 364

CPUs, leveraging, 16

crawling, 209

Cray, Seymour (computer scientist), 251

create, read, update, and delete (CRUD), 133

create_random_solutions

 function, 350

CRUD (create, read, update, and delete), 133

cryptography, 14, 394–395

cubic complexity O(n

3

), 41

curly brackets ({}), 86

customer satisfaction, 292–293

cycles, 219

cyclic graph, 181

D

DAGs (Directed Acyclic Graphs), 181–182

damping factor, 219

Dantzig, George Bernard (mathematician), 357

Dantzig, Tobias (mathematician), 308

data. See also big data; compressing data; 

manipulating data

arranging, 133–152

comparing using Boolean expressions, 72–74

finding, 124–125, 208–210

finding using dictionaries, 124–125

indexing using dictionaries, 90

managing large amounts of, 250–258

matching, 117–118

patterns in, 396–397

searching, 133–152

sorting, 134–142, 392

storing using sets, lists, and tuples, 85–89

data duplication, 118–119

data structuring

about, 21–22, 115

determining need for, 116–121

graphing, 128–131

piling in order, 121–125

stacking in order, 121–125

trees, 125–128

datasets

downloading, 58–66

used in this book, 65–66

dates, interacting with, 76

dead ends, 219

deadlines, meeting, 293–294

decompression, 275

decorator, 305–306

default value, giving function arguments a, 80

degenerate matrix, 100

degree, 165

degrees of separation, 204–206

deletion, 317

dense graph, 182

depth-first search (DFS), 34, 177–179, 343, 380

deque

 function, 177

deques, 87

design

about, 23–24

computing costs, 33–35

dividing problems into small pieces, 28–30

evaluating algorithms, 35–41

finding solutions and counterexamples, 26–28

greedy algorithms, 31–32

heuristic approach, 33–35

modeling real-world problems, 25–26

Dewey Decimal System, 29–30

DFS (depth-first search), 34, 177–179, 343, 380

DFS (Distributed File System), 253

dictionaries, 86–87, 90, 124–125

difference()

, 86

Dijkstra algorithm, 194–196, 385

dimension, 95

Directed Acyclic Graphs (DAGs), 181–182

directed graph, 157, 181

discovered vertex, 174

display KeyValue

 function, 146

DisplayMulti()

 function, 84

DisplaySum()

 function, 80

distance measures, using as heuristics, 376–377

---

408