- Guías de estudio, Notas de estudios & Resúmenes

ArrayList Constructor() (code) ngArray = (T[]) new Object[INITIAL_CAPACITY]; = 0; ArrayList RemoveAtIndex() (code) BIG O - O(n) Steps: 1. Store element to return 2. edge case - removing from end 3. edge case - list empty 4. shift element to be removed to back of the list and null out { T element = backingArray[index];

How would you characterize the physical size of a mainframe computer (not including its I/O (or peripheral) equipment)? A) About the size of a pickup truck B) About the size of a large refrigerator C) About the size of a large hotel ballroom D) About the size of a desktop computer E) About the size of a microwave oven - B) About the size of a large refrigerator Which mainframe job/role would you expect to perform software customization, capacity planning and performance tuning? A)...

Adaptivefaster when data is already sorted Stableequal valued elements are in the same relative order before and after sorting In-Placedoes not need an additional data structure besides the array already storing the data. O(1) extra memory Iterative Sortssort one at a time Divide and Conquer Sortsbreak the original large problem into sub-problems, solve, and then combine solutions to solve large problem (mostly recursive) Non-Comparison Based Sortsat no point can we compare two objects ...

parent BF = 2 child BF = 0, 1 Right Rotation parent BF = 2 child BF = -1 Left-Right Rotation parent BF = -2 child BF = -1, 0 Left Rotation parent BF = -2 child BF = 1 Right-Left Rotation SkipLists - Search, Add, Remove, Space Best Case O(logn)

Adaptivefaster when data is already sorted Stableequal valued elements are in the same relative order before and after sorting In-Placedoes not need an additional data structure besides the array already storing the data. O(1) extra memory Iterative Sortssort one at a time Divide and Conquer Sortsbreak the original large problem into sub-problems, solve, and then combine solutions to solve large problem (mostly recursive) Non-Comparison Based Sortsat no point can we compare two objects

ArrayList Constructor() (code) ngArray = (T[]) new Object[INITIAL_CAPACITY]; = 0; ArrayList RemoveAtIndex() (code) BIG O - O(n) Steps: 1. Store element to return 2. edge case - removing from end 3. edge case - list empty 4. shift element to be removed to back of the list and null out

parent BF = 2 child BF = 0, 1 Right Rotation parent BF = 2 child BF = -1 Left-Right Rotation parent BF = -2 child BF = -1, 0 Left Rotation parent BF = -2 child BF = 1 Right-Left Rotation SkipLists - Search, Add, Remove, Space Best Case O(logn)