Algorithms Exam Latest Update 2024-

WGU C949 Data Structures and Algorithms Exam Latest Update 2024- 2025 Questions and Verified Correct Answers Guaranteed A+

• A functions whose cost scales linearly O(n)

with the size of the input

• Iterating over a collection of data once O(n)

often indicates an ______ algorithm. (alphabet for-loop example)

• A functions whose cost scales logarith- O(log n)

mically with the input size

• Which type of function works by break- O(log n)

ing down large problem into smaller and smaller chunks?

• As the size of the input grows the O(log n)

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.

• A function that exhibits quadratic O(n^2)

growth relative to the input size

• An example of this type of function is O(n^2)

doubly nested loop

• A function that has two inputs that con- O(nm)

tribute to growth

• . Which type of function gets really ex-

pensive really quickly?O(n^2) 1 / 2

• An example of this type of function is O(nm) when

there is a nested loop that iterates of two distinct collections of data

• Are Big-O cases used in the best or Worst worst

situations?

• Which statement is static? readonly Contact

contacts = new Contacts[100]; readonly Contact[] contacts = new Contact[]; readonly Contact contacts = new Contacts[100];

• A container where data is stored in Linked List

nodes consisting of a single data item and a reference to the next node

• A ______ is a container where nodes of Linked List

data are linked together into a list

• Linking together complex nodes into a Linked List

single structure

• Each link in a chain for a linked lists is node called

a ______

• What two things do nodes contain? 1. the value
• reference to next item in the list

• Give a coded example on how to create Node head

= new Node(1); a 3 chained linked list of nodes.

• / 2