JavaScript isn't enabled in your browser, so this file can't be opened. Enable and reload.
Test your knowledge
This is an ungraded check of your knowledge (i.e. I do not look at these results in any way shape or form--nor do they effect your grade).
They are designed so you can have some feedback on the assigned readings/videos/notes to see if you picked up some of the basic knowledge.
Sign in to Google
to save your progress.
Learn more
What is the difference between a tree and a graph?
1 point
There is no difference, a tree is a graph
The more 'specific' difference is that a tree is a directed-acyclic graph, and it does not contain any cycles. Trees typically demonstrate some sort of hierarchical relationship.
Clear selection
Which of the following are data structures used to store graphs?
1 point
Adjacency List
Adjacency Matrix
Incident Identities
Priority Heap
What kind of algorithm is Dijkstra's Shortest Path?
1 point
Friendly
Divide and Conquer
Greedy
Clear selection
Submit
Clear form
This content is neither created nor endorsed by Google.
Report Abuse
-
Terms of Service
-
Privacy Policy
Forms
