[Cs61003] study guide

[Dianne Foreback]

Hello AP2 Class:

Just to clarify, if you look at our website, the material we studied is
listed in items 8, 9 and 10. This is just section 4.2 - 4.4 (not even the
entire section of 4.4) in our book.

Many items in the study guide can be provided in simple terms.  e.g. "be
able to explain how the different types of graphs are presented within a
computer (Undirected, Directed, Undirected Weighted Graphs and Directed
Weighted Graphs)". The adjacency list may have a node with more info for a
weighted graph (the weight must be represented), for directed graphs,
directed edge v-w may only show w in v's adjacency list but not w's.

Compare Prim's and Kruskals--one grows a tree and the other builds a
forest. What does this mean?

Which algorithm's require graphs to be acyclic? Think about it. The Acyclic
Shortest Path and precedence scheduling. That is why cycle detection needs
to be done before a topological sort.

To prepare, go through the algorithms in these sections that we covered.
Review your class notes and the study guide that you are hopefully
preparing after each lecture. Run through traces of the algorithm.

Again, go through the algorithms one by one. Many of them are variations of
DFS.

I know you can handle this material, you are talented graduate students at
Kent State University.

Kindest Regards,
Dianne

_______________________________________________
Dr. Dianne Foreback, Assistant Professor
Department of Computer Science
Math and Computer Science Building (MSB) 266
P.O. Box 5190, Kent, Ohio 44242-0001, USA
Phone: 330.672.9064
Email: dforebac at kent.edu
_______________________________________________
-------------- next part --------------
An HTML attachment was scrubbed...
URL: https://listmail.cs.kent.edu/pipermail/cs61003/attachments/20160304/32f3236b/attachment.html