A functions whose cost scales linearly with the size of the input -
ANSWER :
O(n)
A functions whose cost scales logarithmically with the input size -
ANSWER :
O(log n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet for-
loop example) -
ANSWER :
O(n)
Which type of function works by breaking down large problem into smaller and smaller
chunks? -
ANSWER :
O(log n)
As the size of the input grows the cost of the algorithm does not increase at the same rate.
The overall cost of performing an operation on 1,000,000 items is only twice that of per-
forming the operation on 1,000 items. -
ANSWER :
O(log n)
1
,A function that exhibits quadratic growth relative to the input size -
ANSWER :
O(n^2)
Which type of function gets really expensive really quickly? -
ANSWER :
O(n^2)
An example of this type of function is doubly nested loop -
ANSWER :
O(n^2)
A function that has two inputs that contribute to growth -
ANSWER :
O(nm)
An example of this type of function is when there is a nested loop that iterates of two dis-
tinct collections of data -
ANSWER :
O(nm)
Are Big-O cases used in the best or worst situations? -
ANSWER :
Worst
A container where data is stored in nodes consisting of a single data item and a reference to
the next node -
ANSWER :
2
, Linked List
Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100]; -
ANSWER :
readonly Contact contacts = new Contacts[100];
A ______ is a container where nodes of data are linked together into a list -
ANSWER :
Linked List
Linking together complex nodes into a single structure -
ANSWER :
Linked List
Each link in a chain for a linked lists is called a ______ -
ANSWER :
node
What two things do nodes contain? -
ANSWER :
1. the value
2. reference to next item in the list
3
ANSWER :
O(n)
A functions whose cost scales logarithmically with the input size -
ANSWER :
O(log n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet for-
loop example) -
ANSWER :
O(n)
Which type of function works by breaking down large problem into smaller and smaller
chunks? -
ANSWER :
O(log n)
As the size of the input grows the cost of the algorithm does not increase at the same rate.
The overall cost of performing an operation on 1,000,000 items is only twice that of per-
forming the operation on 1,000 items. -
ANSWER :
O(log n)
1
,A function that exhibits quadratic growth relative to the input size -
ANSWER :
O(n^2)
Which type of function gets really expensive really quickly? -
ANSWER :
O(n^2)
An example of this type of function is doubly nested loop -
ANSWER :
O(n^2)
A function that has two inputs that contribute to growth -
ANSWER :
O(nm)
An example of this type of function is when there is a nested loop that iterates of two dis-
tinct collections of data -
ANSWER :
O(nm)
Are Big-O cases used in the best or worst situations? -
ANSWER :
Worst
A container where data is stored in nodes consisting of a single data item and a reference to
the next node -
ANSWER :
2
, Linked List
Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100]; -
ANSWER :
readonly Contact contacts = new Contacts[100];
A ______ is a container where nodes of data are linked together into a list -
ANSWER :
Linked List
Linking together complex nodes into a single structure -
ANSWER :
Linked List
Each link in a chain for a linked lists is called a ______ -
ANSWER :
node
What two things do nodes contain? -
ANSWER :
1. the value
2. reference to next item in the list
3
