WGU C949 Data Structures and Algorithms
(New 2026/ 2027 Update) Questions &
Answers {Grade A} 100% Correct (Verified
Solutions)
A hash function computes a bucket index from an item's _____. - correct answer key
A 100 element hash table has 100 _____. - correct answer buckets
For a well-designed hash table, searching requires _____ on average. - correct answer
O(1)
In a Hash Table keys need to be ______. - correct answer unique
Given a hash table with 100 buckets and modulo hash function, in which bucket will
HashInsert(table, item 334) insert item 334? - correct answer 34
Given a hash table with 50 buckets and modulo hash function, in which bucket will
HashSearch(table, 201) search for the item? - correct answer 1
,(201%50)
A hash table's items will be positive integers, and -1 will represent empty. A 5-bucket
hash table is: -1, -1, 72, 93, -1. How many items are in the table? - correct answer 0
A functions whose cost scales linearly with the size of the input - correct answer O(n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet
for-loop example) - correct answer O(n)
A functions whose cost scales logarithmically with the input size - correct answer
O(log n)
Which type of function works by breaking down large problem into smaller and smaller
chunks? - correct 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 performing the operation on 1,000 items. - correct answer O(log n)
A function that exhibits quadratic growth relative to the input size - correct answer
O(n^2)
An example of this type of function is doubly nested loop - correct answer O(n^2)
Which type of function gets really expensive really quickly? - correct answer O(n^2)
A function that has two inputs that contribute to growth - correct answer O(nm)
An example of this type of function is when there is a nested loop that iterates of two
distinct collections of data - correct answer O(nm)
Are Big-O cases used in the best or worst situations? - correct answer Worst
(New 2026/ 2027 Update) Questions &
Answers {Grade A} 100% Correct (Verified
Solutions)
A hash function computes a bucket index from an item's _____. - correct answer key
A 100 element hash table has 100 _____. - correct answer buckets
For a well-designed hash table, searching requires _____ on average. - correct answer
O(1)
In a Hash Table keys need to be ______. - correct answer unique
Given a hash table with 100 buckets and modulo hash function, in which bucket will
HashInsert(table, item 334) insert item 334? - correct answer 34
Given a hash table with 50 buckets and modulo hash function, in which bucket will
HashSearch(table, 201) search for the item? - correct answer 1
,(201%50)
A hash table's items will be positive integers, and -1 will represent empty. A 5-bucket
hash table is: -1, -1, 72, 93, -1. How many items are in the table? - correct answer 0
A functions whose cost scales linearly with the size of the input - correct answer O(n)
Iterating over a collection of data once often indicates an ______ algorithm. (alphabet
for-loop example) - correct answer O(n)
A functions whose cost scales logarithmically with the input size - correct answer
O(log n)
Which type of function works by breaking down large problem into smaller and smaller
chunks? - correct 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 performing the operation on 1,000 items. - correct answer O(log n)
A function that exhibits quadratic growth relative to the input size - correct answer
O(n^2)
An example of this type of function is doubly nested loop - correct answer O(n^2)
Which type of function gets really expensive really quickly? - correct answer O(n^2)
A function that has two inputs that contribute to growth - correct answer O(nm)
An example of this type of function is when there is a nested loop that iterates of two
distinct collections of data - correct answer O(nm)
Are Big-O cases used in the best or worst situations? - correct answer Worst
