E

edges in graphs, 60

Eighth of a Circle problem, 146–148

electronic devices, turning off before interviews, 11

element list, as a special case, 36, 38

elements

finding based on position, 42

inserting and deleting in a singly-linked list, 29–30

Ellipse subclass in Shape, 123–124

empty list, as a special case, 36, 38

empty or null link in a linked list, 26

encapsulation, 122

encapsulators, interfaces as, 125

end node, special properties in a cyclic list, 50

endian, familiarity with the term, 153

endianness, 153, 154

equality (=) operator, testing for a NULL column value, 141

error code arguments, 32–33

error codes, returned by createStack and deleteStack, 33

error conditions

checking, 41

checking common, 40

watching for, 42

error correction in graphics algorithms, 143

error handling for push and pop operations, 32

Escaping the Train problem, 183–184

estimation problems, 162

event semaphores, 108

event thread, 108

blocking, 114

examining input items in big-O analysis, 21

examples

going back to, 19

starting an interview problem with, 18

working through, 161

exception throwing, pros and cons of, 94

experience

answering questions about, 193–194

discussing, 195

exploding signing bonus, 12

exponents, expressing repeated multiplication, 171

extends. See inheritance