Consider the following graph

What would the output be if we were to print each node in a Depth First Search starting from the node marked with value source? Assume we traverse starting from the leftmost neighbor (e.g. in node 5, we would push to the stack node 1, node 2, node 3 in that order)

Consider the following graph

What would the output be if we were to print each node in a Breadth-First Search starting from the node with value marked as source?

When traversing assume we go leftmost neighbor first.

If G = (V, E) is an undirected graph, how much space is needed to represent G using an adjacency list? What about when   G is a directed graph?

If G =(V, E) is a directed graph that has |V| = 20 , how many values would an adjacency matrix need to represent G ?

Consider the following directed graph G:

The Adjacency List representation of G is

Consider the following undirected graph G:

What would the adjacency matrix for G be like?

To DownHeap (sifting down) we compare the parent node to its children to check it the heap property is upheld. If that is not the case, we swap the parent with one of its childrens and then recursively apply this until we reach a leaf.

This process is needed whenever we remove an entry from the Heap. 

Please comment on YOUR OWN performance in the project.  You should specifically address the following questions:

• Were you helpful and dependable during the project?  
• Did you share the load and responsibilities of the project roughly equally/fairly with your partner?
• Were you able to contact and communicate with your partner when needed?

Please comment on your partner's performance in the programming assignment.  You should specifically address the following questions:

• Was your partner helpful and dependable during the project?  
• Did your partner shared the load and responsibilities of the project roughly equally/fairly with you?
• Were you able to contact and communicate with your partner when needed?

Enter your partner's email address: