2025
CIT 594 Final Exam With 100% Correct
And Verified Answers
Tree Set - Correct Answer-A set interface that uses a tree
for storage
what is the time complexity of a single for loop? -
Correct Answer-O(n)
What is the time complexity of linked list's get
operation? - Correct Answer-O(n)
How is the bucket number calculated for a hash set ? -
Correct Answer-hashcode % number_of_buckets
AVL Tree - Correct Answer-a self-balancing sorted binary
tree, in which the heights of subtrees differ by at most 1.
Max Heap - Correct Answer-a complete binary tree in
which the value in each internal node is greater than or
equal to the values of the children in those nodes(Note*
NOT the SUM, just each individual value)
What does the factory method do? - Correct Answer-For
the factory method pattern, we need to define an
abstract class that subclasses can use to return
subclasses of the dependency
CIT 594 Final Exam With 100% Correct
And Verified Answers
Tree Set - Correct Answer-A set interface that uses a tree
for storage
what is the time complexity of a single for loop? -
Correct Answer-O(n)
What is the time complexity of linked list's get
operation? - Correct Answer-O(n)
How is the bucket number calculated for a hash set ? -
Correct Answer-hashcode % number_of_buckets
AVL Tree - Correct Answer-a self-balancing sorted binary
tree, in which the heights of subtrees differ by at most 1.
Max Heap - Correct Answer-a complete binary tree in
which the value in each internal node is greater than or
equal to the values of the children in those nodes(Note*
NOT the SUM, just each individual value)
What does the factory method do? - Correct Answer-For
the factory method pattern, we need to define an
abstract class that subclasses can use to return
subclasses of the dependency
