WGU C949 Data Structures and Algorithms Exam Questions with Answers Graded A+

WGU C949 Data Structures and Algorithms Exam
Questions with Answers Graded A+

1. A functions whose cost scales linearly with the size of the input: O(n)
2. Iterating over a collection of data once often indicates an algorithm.
(alphabet for-loop example): O(n)
3. A functions whose cost scales logarithmically with the input size: O(log n)
4. Which type of function works by breaking down large problem into smaller
and smaller chunks?: 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.: O(log n)
6. A function that exhibits quadratic growth relative to the input size: O(n^2)
7. An example of this type of function is doubly nested loop: O(n^2)
8. Which type of function gets really expensive really quickly?: O(n^2)
9. A function that has two inputs that contribute to growth: 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: O(nm)
11. Are Big-O cases used in the best or worst situations?: Worst
12. Which statement is static?

readonly Contact[] contacts = new Contact[];

readonly Contact contacts = new Contacts[100];: 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: Linked List
14. A is a container where nodes of data are linked together into a
list: Linked List
15. Linking together complex nodes into a single structure: Linked List
16. Each link in a chain for a linked lists is called a : node
17. What two things do nodes contain?: 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.: -
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: Singly Linked List
1/5

,WGU C949 Data Structures and Algorithms Exam
Questions with Answers Graded A+

20. A list that builds on the singly linked list by adding reverse iteration.: Dou-
bly Linked List
21. Give a coded example on how to create a doubly linked list: Node node1 =
new Node(1);

Node node2 = new Node(2);

Node node3 = new Node(3);

node1.Next = node2;

node2.Previous = node1;

node2.Next = node3;

node3.Previous = node2;
22. The first and last nodes of a doubly linked list should have a value of
: null
23. Adds a value to the beginning of the list: AddHead
24. Adds a value at the end of the linked list: AddTail
25. Finds the first node whose value equals the provided argument: Find
26. Returns true if the specified value exists in the list, false otherwise: Con-
tains
27. Removes the first node on the list whose value is equal to the argument: -
Remove
28. A doubly linked list where the values are inserted and sorted in order: Sort-
ed List
29. Adds the specified item to the linked list in the sort order of the item
type: Add
30. A way of organizing, storing, and performing operations on data: Data
Structure
31. A data structure that stores subitems, with a name associated with each
subitem.: record
32. A data structure that stores an ordered list of items, with each item is
directly accessible by a positional index.: Array
33. A data structure that stores ordered list of items in nodes, where each node
stores data and has a pointer to the next node.: linked list
34. A data structure in which each node stores data and has up to two children,
2/5