1.Describe and implement in a high level lanuage the basic data structure of lists, trees, graphs along with the functions that operate on them.2.Compare tradeoffs among different implementations amongst these data structures.3.Devise algorithms and programs that use these basic data structures.4.Implement algorithmic strategies of recursion, divide and conquer, sorting, and searching.5. Determine the time complexity of simple algorithms.

REQUIREMENTS:

Access to computers in the Linux computer lab is required to complete homework.