D

data elements. See nodes

data structure

restoring to its original condition, 48–49

trying a different, 19

database problems, 136–141

database transactions

described, 135–136

properties of, 136

databases, fundamentals, 131–136

deadlocks

described, 109

determining occurences of, 117–119

solution to breaking, 119

debuggers, 1

default implementation, of an interface, 126

deleteStack function, 33

deleteStack operation, 34

deletions

in BSTs, 58

from a linked list, 29–30

in a linked list, 36

DeMorgan’s Law, 152

denominator, 176

depth-first search (DFS), 59

derivative, ratio of rates of change between two variables, 174, 175

descendants of a node, 55

design-oriented jobs, less likely to be outsourced, 4

destination position, tracking for the write position, 77

destructors in C++, 124–125

developer job market. See job market

DFS (depth-first search), 59

diagrams, importance of drawing to solve puzzles, 173–174

Dice job site, 3, 8, 9

digit characters, value of, 84

The Dining Philosophers problem, 117–119

directed graph, 60

DISTINCT keyword with SELECT, 140

“Do You Have Any Questions for Me?”, 199

doubly-linked lists

described, 27

flattening, 44–47

dress for interviews, 10–11

duck, maximizing the head start of, 180

durability of database transactions, 136

dynamic arrays

defined, 31

implementing a stack, 31

in JavaScript, 70–71

as a language feature, 68

dynamic data structures, compared to arrays, 68