M

m element data structure, implicitly advancing, 42

Maintain Linked List Tail Pointer problem, 35–40

management, as a goal, 2

management job, taking, 4

managers, resumes for, 212–218

mark and sweep garbage collection, 189

market. See job market

marketable skills, developing, 4–5

marketing tool, resume as, 4, 206

mask algorithms, comparing, 156

masks, getting the value of any bits, 155–156

Max, No Aggregates problem, 139–140

max value, extracting with a heap, 58–59

maximum value

function returning, 20–21

returning using SQL without an aggregate, 139–140

m-behind pointer

with a current position pointer, 42

explicitly advancing, 42

memory deallocation by garbage collection, 188

memory requirements of arrays versus hash tables, 74–75

methods.

See also actions

add method, 115–116

constructor method in a class, 124

finalizer method, 125

length method in Java, 72

nonvirtual in C# and C++, 127

remove method, 115–116

modulo of a negative number, 86

modulo operator (%), 86

monitors

around code using or altering the value of userBalance, 111

described, 108–109

Monster, 3, 9

most-significant byte (MSB), 153

MSB. See most-significant byte (MSB)

Mth-to-Last Element of a Linked List problem, 41–44

multibyte data type, determining LSB and MSB, 154

multibyte encodings, 71

multidimensional arrays

implementing as linear, 67

in Java, 70

Multiple Inheritance problem, 128–129

multiple inheritance, simulating in Java using interfaces, 187

multithreaded applications, classical problems involving, 112–114

multithreaded programming, 107

mutable strings

in C++, 72

creating in Java, 72

creating with StringBuilder class in C#, 73

mutex semaphore, 108