WGU C949 Exam Bundle

D - Answer- Which statement describes a queue data structure? A.) It is a sequence of elements in which insertion and deletion takes place at one end. B.) It is a sequence of elements in which insertion and deletion takes place at both ends. C.) It is a sequence of elements in which insertion c...

A functions whose cost scales linearly with the size of the input - Answer- O(n) Iterating over a collection of data once often indicates an ______ algorithm. (alphabet for-loop example) - Answer- O(n) A functions whose cost scales logarithmically with the input size - Answer- O(log n) Whic...

record - Answer- data structure that stores subitems, with a name associated with each subitem array - Answer- a data structure that stores an ordered list of items, with each item is directly accessible by a positional index homogeneous data elements linked list - Answer- data structure th...

Which statement describes a queue data structure? - Answer- It is a sequence of elements in which insertions can take place only at the back end and deletions can take place only at the front end. What are the official indexes for the list list01 given this declaration? int[ ] list01 = {0, 2, 4, ...

Algorithm - Answer- Describes a sequence of steps to solve a computational problem or perform a calculation. Computational Problem - Answer- Specifies an input, a question about the input that can be answered using a computer, and the desired output. Longest Common Substring - Answer- An algor...

Record - Answer- Data structure that stores subitems, often called fields, with a name associated with each subitem. Array - Answer- A data structure that stores an ordered list of items, with each item is directly accessible by a positional index. homogeneous data elements linked list - An...

inserting a new item at the beginning it causes no shift to the data - Answer- what is an advantage of a linked list over an array?n N - Answer- In the worst case, inserting a new node into a tree with N nodes requires how many comparisons? reference count - Answer- A _____________is an intege...

binary search - Answer- first checks the middle element of the list. If the search key is found, the algorithm returns the matching location. If the search key is not found, the algorithm repeats the search on the remaining left sublist (if the search key was less than the middle element) or the rem...