as it pertains to an algorithm, the algorithm is correct with respect to a specification
functional correctness - input-output behavior of the algorithm
each node has at most two leaves but they are not necessarily ordered
the ability of a computer system to cope with errors during execution and cope with erroneous input
check with stress testing (operation under peak load) and volume testing (handling large inputs)
satisfies all constraints
response times, throughput, resource usage
glass box testing p 517, 525-530
aka test to code
types: statement, branch, path coverage
Sign up for free and study better.
Get started today!