CIT 594 Final Exam WITH CORRECT QUESTIONS AND ANSWERS 2025 |
GRADED A+
Tree Set - (answer)A set interface that uses a tree for storage
what is the time complexity of a single for loop? - (answer)O(n)
What is the time complexity of linked list's get operation? - (answer)O(n)
How is the bucket number calculated for a hash set ? - (answer)hashcode % number_of_buckets
农业和医学提供了重要启示。
AVL Tree - (answer)a self-balancing sorted binary tree, in which the heights of subtrees differ by
at most 1.
Max Heap - (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? - (answer)For the factory method pattern, we need to define
an abstract class that subclasses can use to return subclasses of the dependency
GRADED A+
Tree Set - (answer)A set interface that uses a tree for storage
what is the time complexity of a single for loop? - (answer)O(n)
What is the time complexity of linked list's get operation? - (answer)O(n)
How is the bucket number calculated for a hash set ? - (answer)hashcode % number_of_buckets
农业和医学提供了重要启示。
AVL Tree - (answer)a self-balancing sorted binary tree, in which the heights of subtrees differ by
at most 1.
Max Heap - (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? - (answer)For the factory method pattern, we need to define
an abstract class that subclasses can use to return subclasses of the dependency
