Problem 1 (8 points) – Concepts on Data Structures and Analy…
Problem 1 (8 points) – Concepts on Data Structures and Analysis Techniques Please keep your answers short (one sentence for the problem description and a couple of sentences for meaningful explanations). (1) (1 point) Briefly describe a simple problem where hash tables can be effectively used. (2) (1 point) Briefly describe a simple problem where B-trees can be effectively used. (3) (1 point) Briefly describe a simple problem where disjoint sets can be effectively used. (4) (1 point) Briefly describe a simple problem where average case complexity analysis is needed. (5) (1 point) Briefly describe a simple problem where amortized analysis is needed. (6) (1 point) Briefly describe a simple problem where greedy methods can be effectively used. (7) (1 point) Briefly describe a simple problem where dynamic programming is needed. (8) (1 point) Briefly describe a simple problem where graph search algorithms can be effectively used.