I. Data Structures: In the first section of your report, indicate which programs in your portfolio best exemplify your knowledge and skills related to data structures. For each example that you provide, defend your program in terms of how effectively the data is organized, using specific evidence from the

problem. Specifically, you must discuss each of the following data structure types:

A. Vectors

B. Hash tables

C. Tree structures

II. Algorithms: In the second section of your report, indicate which programs within your portfolio best exemplify your knowledge and skills related to algorithms. For each example that you provide, defend your program as one that is technically sound and can perform the required functions, using specific evidence. Specifically, you must discuss each of the following algorithm types:

A. Search

B. Sort

C. Hash/Chaining