UML 2 Diagrams

Introduction to the Diagrams of UML 2.X:

Robustness (computer science)

Robustness (computer science) - Wikipedia, the free encyclopedia: "In computer science, robustness is the ability of a computer system to cope with errors during execution. Robustness can also be defined as the ability of an algorithm to continue operating despite abnormalities in input, calculations, etc.

Fuzz testing ~ random input testing

Fuzz testing - Wikipedia, the free encyclopedia

Logarithm(log, lg, ln), Logarithmic Formulas

Heap (data structure)

Heap - specialized tree (usually binary) data structure adhere, conform to heap property: parent node key is greater(less) then child nodes for two heap types max heap (min heap)

Used in heap sort algorithm and Dijkstras graph algorithm

Heap Sort - use max-heapify alg N times

Heap (data structure) - Wikipedia, the free encyclopedia:

Stack (LIFO), QUEUE (FIFO) - mnemonics sample

STACK (LIFO)  - mnemonic vertical stack of leafs

QUEUE (FIFO) - mnemonic horizontal queue of football balls

FINO (First In Never OUT) FISH (First In Still There) - memory leak (memo leak in brain)

Stack (abstract data type) - Wikipedia, the free encyclopedia:

https://en.wikipedia.org/wiki/FIFO_(computing_and_electronics)

https://en.wikipedia.org/wiki/FINO