IS 2020
Mathematical Foundations

Fall 2000 (01-1)
Study Guide for Final

The Final Exam will cover

• Sections 6.1 - 6.4
• Sections 11.1 - 11.3
• Sections 12.1, 12.2, 12.4
• Sections 13.1, 13.2

• The chart under "The Algebra of Strings" and "Graph Theory" from inside the front and back covers.

• Blue boxes with Dijkstra's Shortest-Path Algorithm (p. 594), Kruskal's Algorithm (p. 599-600), Prim's Algorithm (p. 602).

• Table 11.1

  Repeated Vertices	Repeated Edges	Open/Closed	Name
  Yes	Yes	Open	Open Walk
  Yes	Yes	Closed	Open Closed
  Yes	No	Open	Trail
  Yes	No	Closed	Circuit
  No	No	Open	Path
  No	No	Closed	Cycle