CIT 594 EXAM QANDA 2026 STUDY SHEET
QUESTIONS AND SOLUTIONS GRADED A+
●● 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?.
QUESTIONS AND SOLUTIONS GRADED A+
●● 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?.
