Which collision resolution technique suffers from Primary Clustering?
Linear Probing checks consecutive slots (i + 1, i + 2, ...), causing long contiguous blocks of occupied slots (Primary Clustering) that degrade performance.
What is the expected average-case lookup time complexity in a well-distributed Hash Table?
With a well-distributed hash function and a suitable load factor, hash-table lookup takes O(1) expected average time.
What is the worst-case lookup time in a hash table using separate chaining when all n keys collide into one bucket?
If all n keys are stored in one chain, a lookup may require scanning Θ(n) entries in the worst case. Since Θ(n) is not among A-C, (E) is correct.
An Undirected Complete Graph with n vertices contains how many total edges?
In an undirected complete graph Kn, every vertex connects to all other n-1 vertices. Total unique edges = n(n-1)/2.
A tournament graph is a directed graph in which exactly one directed edge exists between every pair of distinct vertices. How many directed edges does a tournament with n vertices contain?
A tournament has exactly one directed edge for each unordered pair of distinct vertices. There are n(n-1)/2 such pairs, so it has n(n-1)/2 directed edges.