Homework Assignment 8
Due: Apr. 6 before class starts
Assignment
- (40 points) Draw an adjacency list and adjacency matrix representation of the undirected graph shown in Figure 14.1.
-
(30 points) Suppose we represent a graph
Ghavingnvertices andmedges with the edge list structure. Why, in this case, does theinsertVertexmethod run inO(1)time while theremoveVertexmethod runs inO(m)time? Statement and proof of complexity required. -
(30 points) Would you use the adjacency matrix structure or the adjacency
list structure in each of the following cases? Justify your choice.
- The graph has 10,000 vertices and 20,000 edges, and it is important to use as little space as possible.
- The graph has 10,000 vertices and 20,000,000 edges, and it is important to use as little space as possible.
- You need to answer the query
getEdge(u, v)as fast as possible, no matter how much space you use.
-
Bonus.
(10 points) Suppose we wish to represent an
n-vertex graphGusing the edge list structure, assuming that we identify the vertices with the integers in the set{0, 1, ..., n - 1}. Describe how to implement the collectionEto supportO(log n)-time performance for thegetEdge(u, v)method. How are you implementing the method in this case?
General Instructions, Turning in assignments, and Grading
General Instructions
- All homework assignments must be typeset using LaTex. Using another program (e.g., Microsoft Word) or handwriting assignments will result in grade of 0. Here is an example homework problem worked out to see the expected format and the tex file that generated it to help you start.
- If you are unfamiliar with LaTex, here is a short tutorial and the tex file that generated it. This tutorial shows how to write common mathematics, how to write pseudocode, how to cite sources, how to include images, and how to include tables.
- Use pseudocode and good mathematical style to describe algorithms and data structures. Do not specify Java code unless otherwise stated. Described more in example homework document above.
- Complete every part of every problem!
- Follow turn-in instructions precisely.
- Failure to complete any of these steps will result in a significant loss of points.
Turn in Instructions
Each assignment will be turned in in class (hard copy). Assignments are due BEFORE, let me repeat, before class starts. This does not mean five minutes after class starts. Details:
- The first page of your hard copy must be a signed coverpage.
- Next put the problems in order as described in the description. This may seem silly but you would be surprised sometimes.
- If you do not know how to print you may have to consult University of Richmond webpages to learn how to use campus printers. If possible, please print 2-sided.
- Staple all pages together.
- Turn in packet before class begins.
- I reserve the right to assign a 0 to any assignment failing to comply with these instructions. Even for something as small as a missing staple.
Points
- Each assignment is graded out of 100 points (not including bonus).
- Criteria and point distribution (This distribution is a general guideline
that may change depending on the specific problem - exceptions for example
include but are not limited to proof-only problems.)
- Approximately 50% on a problem is devoted to the algorithm. This includes items like describing a correct and efficient algorithm, using proper and clear pseudocode, and describing your algorithm clearly.
- Approximately 25% on a problem is devoted to time complexity. This includes stating a lemma or theorem of your result and providing a proof and justification of the result.
- Approximately 25% on a problem is devoted to memory complexity. This includes stating a lemma or theorem of your result and providing a proof and justification of the result.
- If the problem is simply a proof, 100% is split between a proper statement (lemma or theorem) of the result and proving a clear and concise proof of the result.
- You can receive points off for not following formatting guidelines.
- If there are any discrepencies in grades please see the instructor during his office hours or by appointment (do not discuss with the lab assistants or graders).
