CIT 594 Final Exam Questions and Answers

1 | Page



CIT 594 Final Exam Questions and Answers

Tree Set
Ans: A set interface that uses a tree for storage

what is the time complexity of a single for loop?
Ans: O(n)

What is the time complexity of linked list's get operation?
Ans: O(n)

How is the bucket number calculated for a hash set ?
Ans: hashcode % number_of_buckets

AVL Tree
Ans: a self-balancing sorted binary tree, in which the heights of subtrees
differ by at most 1.

Max Heap
Ans: 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?
Ans: 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?
Ans: 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)


© 2025 All rights reserved