ALL RIGHTS RESERVED.
CIT 594 Final Exam Questions With Verified
Answers
Tree Set - Answers✔A set interface that uses a tree for storage
what is the time complexity of a single for loop? - Answers✔O(n)
What is the time complexity of linked list's get operation? - Answers✔O(n)
How is the bucket number calculated for a hash set ? - Answers✔hashcode %
number_of_buckets
AVL Tree - Answers✔a self-balancing sorted binary tree, in which the heights of subtrees differ
by at most 1.
Max Heap - Answers✔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? - Answers✔For the factory method pattern, we need to define
an abstract class that subclasses can use to return subclasses of the dependency
What is a race condition in regards to Threads? - Answers✔When you dont know what thread
will finish first, so therefore the threads are "racing" against each other and you have thread non
determinism... (not good)
What does UML stand for? - Answers✔Unified Modeling Language
How does a stack operate? - Answers✔-think of a stack as literally a stack of bricks but each
element contains data
-It is a linked list that is last in first out
How does a queue operate? - Answers✔-adds to the rear and removes from the front
-It is a linked list that is first in first out