In-Class

JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.

In-Class

In-Class Activity to be completed in class.

Note: For this activity and all other activities, you should only make 1 submission (your first submission is always the one graded)

First Name *

Last Name *

E-mail (Please use Northeastern e-mail) *

Which section of Algorithms are you in? *

Mike

John

Is a tree a graph? *

1 point

Yes, a tree is simply a special instance of a graph. It has edges and nodes just like a graph does, but it dose not contain any cycles.

NO WAY!

Assume we have a graph of a fixed size G(V,E) that is very dense (i.e. all of the nodes are highly connected to other nodes). Additionally, we need to have random access to find out which nodes are not connected in very rare instances. Do you think an adjacency matrix would be a good representation? *

1 point

Yes, and adjacency matrix can be a good representation. It uses an array as a backend data structure, and since it does not need to be resized we can access each node in O(1) to find connections.

No, the adjacency list is always the best and most flexible representation. Always use adjacency list.

Is there exactly one unique topological sort for all graphs? *

1 point

No, there may be multiple orderings, just like there are multiple orderings of how you perform tasks during the day.

Yes, there is always, always, always only one way to do things.

Will Dijkstra's Algorithm reveal the optimal shortest path? *

1 point

Yes, the greediness of the algorithm always reveals the shortest path.

No, unfortunately the optimal shortest path is an 'intractable' problem that cannot be solved. Dijkstra's however does a pretty good job for us.

Submit

Clear form

Never submit passwords through Google Forms.

This content is neither created nor endorsed by Google. Report Abuse - Terms of Service - Privacy Policy

Forms