Lecture 7 Quiz
Graph and network processing
* Required
Andrew ID
*
Your answer
1. What is a drawback of using the coordinate format (COO) for sparse matrices?
They are not memory efficient
They are not computationally efficient
It’s hard to slice rows and columns
The data must be stored in columnmajor order
2. What is the time complexity of checking if there is a link between nodes A and B in a (nonsparse) adjacency matrix?
O(1)
O(log(n))
O(n)
O(n^2)
3. What data structure is important for selecting which node to expand in an iteration of Dijkstra’s algoritm?
Dictionary
Graph
Set
Priority Queue
Submit
Never submit passwords through Google Forms.
This form was created inside of Carnegie Mellon University.
Report Abuse

Terms of Service
Forms