Crossword Puzzle Of The Week #32 (DSU)

In this issue of Crossword Puzzle of the Week, we will dive into the topic of DSU. The solution to the crossword puzzle is provided at the end.

Crossword Puzzle Of The Week #32 (DSU)

HINTS:

ACROSS:

1. The idea of _____ is to make the found root as parent of x so that we don’t have to traverse all intermediate nodes again.
2. Two sets are called disjoint sets if they don’t have any element in common, the _____ of sets is a null set.
3. _____ can be implemented by recursively traversing the parent array until we hit a node that is the parent of itself.
4. _____ is an application of DSU where an undirected graph with V nodes and E edges. The task is to check if there is any cycle in undirected graph.
5. _____ is based on the idea that merging a smaller subset into a larger one will result in a tree of lesser height compared to merging a larger subset into a smaller one.

DOWN:

1. In _____ the index represents the node, and the value at each index corresponds to the parent of that node.
6. In Disjoint Set Union , a tree is used to represent a set, or a collection of elements. Each set contains several elements, and each element is represented as a node in the tree.
7. In DSU one of the key applications that involves finding the _____ is in problems related to network connectivity and in the formation of groups or clusters – particularly in Kruskal’s algorithm.
8. _____ takes two elements as input and finds the representatives of their sets using the Find operation, and finally puts either one of the trees (representing the set) under the root node of the other tree.
9. A data structure that stores non overlapping subset of elements is called _____ data structure.

Solution for Crossword Puzzle #32:

Crossword Puzzle Of The Week #32 (DSU)

ANSWERS:

ACROSS:

1. PATH COMPRESSION
2. INTERSECTION
3. FIND
4. CYCLE DETECTION
5. LAZY UNION

DOWN:

1. PARENT ARRAY
6. TREE
7. NUMBER OF PAIRS
8. UNION
9. DISJOINT SET