Homework
This homework consists of two parts:
Part A:
a. Draw a simple undirected graph G that has 10 vertices and 15 edges.
b. Draw an adjacency list and adjacency matrix representation of the undirected graph in question a.
c. Write a short paragraph to describe the graph you draw.
Part B:
a. Based on the course reading in this module and your own research, use big O notation to explain the complexity and performance of the following data structures:
Arrays, linked list, and vector
b. Based on the course reading in this module and your own research, use big O notation to explain the complexity and performance of the following data structures:
Stacks and Queues
Format your homework according to the give formatting requirements:
1. The answer must be double spaced, typed, using Times New Roman font (size 12), with one-inch margins on all sides.
2. The response also includes a cover page containing the title of the homework, the course title, the student's name, and the date. The cover page is not included in the required page length.
3. Also include a reference page. The references and Citations should follow APA format. The reference page is not included in the required page length.