WorksheetsCSF U2 Algorithms p2
Total questions: 11
Worksheet time: 8mins
An 'for' statement is an example of
repetition
selection
sequence
What will the Python code will output?
2, 3, 4
3, 4, 5
3, 4, 5, 6
2, 3, 4, 5
What will the Python code output?
12
13
16
17
What will the Python code output?
-10, -9, -8, 3, 4, 5
-10, -9, -8, 4, 5, 6
-10, -9, 3, 4, 5, 6
-10, -9, -8, 3, 4
What would the Python code output?
4
9
13
16
In the diagram A is called:?
weight
edge
vertex
node
What is true about the following graph?
it is a MST
it could NOT be an MST
it is an undirected weighted graph
it is a spanning tree
Which MST algorithm iterates over all the vertices and then repeats this process by identifying subgroups as a vertex?
Kruskal’s
Borůvka’s
Prim's
Which MST algorithm starts with any vertex and grows by finding the smallest edge
Kruskal’s
Borůvka’s
Prim's
Which MST algorithm chooses the smallest weights and adds them making sure not to create cycles
Kruskal’s
Borůvka’s
Prim's
Google Maps is an abstraction of the real world
yes, because it hides away details that are not important
yes, because it is very fast at finding routes
no, because it can only be used for driving
no, because you can use Apple Maps
