Expression Tree Test

1. How many properties will an equivalent relationship satisfy?

2. How many strategies are followed to solve a dynamic equivalence problem?

3. What is the total time spent for N-1 merges in a dynamic equivalence problem?

4. What is the worst case efficiency for a path compression algorithm?

5. Electrical connectivity is an example of equivalence relation.

6. ___________ is one of the earliest forms of a self-adjustment strategy used in splay trees, skew heaps.

7. What is the worst-case running time of unions done by size and path compression?

8. What is the depth of any tree if the union operation is performed by height?

9. A relation R on a set S, defined as x R y if and only if y R x. This is an example of?

10. What is the condition for an equivalence relation if two cities are related within a country?