Computer Science - Graduate CS - Advanced algorithms - Advanced Algorithms Quiz

8 questions. Q1: Dijkstra's algorithm cannot handle? → Negative edge weights. Q2: Minimum spanning tree of a graph with V vertices has how many edges? → V-1. Q3: NP-Complete means? → The hardest problems in NP; if one is solved in poly-time, all are. Q4: KMP's advantage over naive string matching? →