Lecture 7 Quiz
Graph and network processing
Andrew ID *
Your answer
1. What is a drawback of using the coordinate format (COO) for sparse matrices?
2. What is the time complexity of checking if there is a link between nodes A and B in a (non-sparse) adjacency matrix?
3. What data structure is important for selecting which node to expand in an iteration of Dijkstra’s algoritm?
Submit
Never submit passwords through Google Forms.
This form was created inside of Carnegie Mellon University. Report Abuse - Terms of Service