Definition | Term | % Correct |
---|---|---|
Stores a value that can be changed during execution. Has a name/identifier. | Variable | 90%
|
Can hold multiple data elements of only same type (String, int, boolean, etc.) or objects. Has a name, size cannot be changed during execution. Can be one-dimensional/linear or two-dimensional. | Array | 87%
|
Very slow sorting algorithm that compares two adjacent elements in array, swapping them if not in correct (ascending or descending) order. Stops when no swaps were required. | Bubble sort | 68%
|
Unlike above, requires sorted array. Eliminates upper or lower half of array every iteration until search value is found. | Binary search | 61%
|
Visual representation of algorithm | Flowchart | 55%
|
Simplest search algorithm. Looks through every index in array for search value. | Sequential search | 55%
|
Algorithm whose syntax is not as strict as computer languages. Cannot be understood by computers. | Pseudocode | 52%
|
Very simple sorting algorithm, where largest or smallest element of array is swapped with leftmost unsorted element. | Selection sort | 45%
|
Like resizable array, and may hold elements of different data types. Operations include: addItem(), getNext(), hasNext() | Collection | 42%
|
Measure of efficiency of algorithm. Represented as O(n), where n is number of times algorithm is executed. | Big O notation | 32%
|
Amount of computer resources such as CPU and memory required to perform functions. | Efficiency | 19%
|
Indicates condition. Its value is changed when condition changed. Usually boolean variable. For example, can be used to end a loop. | Flag | 19%
|
Capability of algorithm to maintain predefined level of performance and perform all required functions under stated conditions, having long mean time between failures. | Reliability | 13%
|
Extent to which algorithm satisfies expectations and all objectives from design and implementation phase, and is free from faults | Correctness | 10%
|
Effort required to modify algorithm for purposes other than what it was originally developed for. | Flexibility | 6%
|
Useful for storing different properties of entity, e.g. Student names and equivalent grades | Parallel arrays | 3%
|
Copyright H Brothers Inc, 2008–2024
Contact Us | Go To Top | View Mobile Site