1
Q
What do we use to memorize BFS
A
Giant quiet vultures swoop quite carefully near 3 villages
2
Q
What is the tracing concept of prims?
A
Start at specified node, choose shortest path, touch each node only once to not create a loop, and the record the cost
3
Q
BFS
A
Queue
4
Q
DFS
A
Stack
5
Q
What do we need to start Kruskal
A
A list of all the edge costs in ascending order
6
Q
Explain Dijkstra’s algorithm
A
First make a table labeling starting node as 0 and others as infinity, find the least costing path, adding it to zero, update the table and continue finding least costing path
7
Q
B-trees insert from leaf nodes or from the top
A
Insert from the leaf
Use this to visualize: [link] (https://www.cs.usfca.edu/~galles/visualization/BTree.html)
Cs
flashcards
Decks in class (4)
# Cards
