WGU C949 DATA STRUCTURES AND ALGORITHMS| 102
ACTUAL QUESTIONS & CORRECT VERIFIED ANSWERS ||
GRADED A+
1. A functions whose cost scales linearly with the size of the input ANS >> O(n
2. Iterating over a collection of data once often indicates an algorithm.
(alphabet for-loop example) ANS >> O(n)
3. A functions whose cost scales logarithmically with the input size ANS >>
O(log n)
4. Which type of function works by breaking down large problem into smaller
and smaller chunks? ANS >> O(log n)
5. 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 performing the operation on 1,000 items. ANS >> O(log n)
6. A function that exhibits quadratic growth relative to the input size ANS >>
O(n^2)
7. An example of this type of function is doubly nested loop ANS >> O(n^2)
O(n^2)
Which type of function gets really expensive really quickly? ANS >>
8.
9. A function that has two inputs that contribute to growth ANS >> O(nm)
10. An example of this type of function is when there is a nested loop that
iterates of two distinct collections of data ANS >> O(nm)
1 J/ J
11
, 11. Are Big-O cases used in the best or worst situations? ANS >> Worst
12. Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100]; ANS >> readonly Contact
contacts = new Contacts[100];
13. A container where data is stored in nodes consisting of a single data item
and a reference to the next node ANS >> Linked List
14. A is a container where nodes of data are linked together into a
list ANS >> Linked List
15. Linking together complex nodes into a single structure ANS >> Linked List
16. Each link in a chain for a linked lists is called a ANS >> node
17. What two things do nodes contain? ANS >> 1. the value
2. reference to next item in the list
18. Give a coded example on how to create a 3 chained linked list of nodes.
ANS >> -
Node head = new Node(1);
head.Next = new Node(2);
head.Next.Next = new Node(3);
19. A list where we start at the first node and follow the chain of nodes iterating
over each until we get to the end ANS >> Singly Linked List
2 J/ J
11
ACTUAL QUESTIONS & CORRECT VERIFIED ANSWERS ||
GRADED A+
1. A functions whose cost scales linearly with the size of the input ANS >> O(n
2. Iterating over a collection of data once often indicates an algorithm.
(alphabet for-loop example) ANS >> O(n)
3. A functions whose cost scales logarithmically with the input size ANS >>
O(log n)
4. Which type of function works by breaking down large problem into smaller
and smaller chunks? ANS >> O(log n)
5. 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 performing the operation on 1,000 items. ANS >> O(log n)
6. A function that exhibits quadratic growth relative to the input size ANS >>
O(n^2)
7. An example of this type of function is doubly nested loop ANS >> O(n^2)
O(n^2)
Which type of function gets really expensive really quickly? ANS >>
8.
9. A function that has two inputs that contribute to growth ANS >> O(nm)
10. An example of this type of function is when there is a nested loop that
iterates of two distinct collections of data ANS >> O(nm)
1 J/ J
11
, 11. Are Big-O cases used in the best or worst situations? ANS >> Worst
12. Which statement is static?
readonly Contact[] contacts = new Contact[];
readonly Contact contacts = new Contacts[100]; ANS >> readonly Contact
contacts = new Contacts[100];
13. A container where data is stored in nodes consisting of a single data item
and a reference to the next node ANS >> Linked List
14. A is a container where nodes of data are linked together into a
list ANS >> Linked List
15. Linking together complex nodes into a single structure ANS >> Linked List
16. Each link in a chain for a linked lists is called a ANS >> node
17. What two things do nodes contain? ANS >> 1. the value
2. reference to next item in the list
18. Give a coded example on how to create a 3 chained linked list of nodes.
ANS >> -
Node head = new Node(1);
head.Next = new Node(2);
head.Next.Next = new Node(3);
19. A list where we start at the first node and follow the chain of nodes iterating
over each until we get to the end ANS >> Singly Linked List
2 J/ J
11
