MATH 1300 - The Nature of Mathematics
                          Spring 2014

                       Exam 2 study guide

The exam will be in class on Friday, March 28.  It will cover
Chapters 7, 8 and 9 of the textbook.

You will NOT be allowed to use the textbook or notes during the
exam.  You WILL be allowed to use a calculator if you would like.


Terms you should know how to define:

Network
Degree of Separation
Tree
Redundancy of a network
Spanning Tree
Minimum spanning tree
Scheduling tasks, processors, precedence relations
Project digraph
Priority list
Critical path, critical time
Population sequence
Linear growth model
Exponential growth model
Growth rate
Arithmetic sequence
Common difference
Geometric sequence
Common ratio


You should know how to work problems like the study questions and homework
problems.  In particular, you should be able to answer questions about
the following topics:

Degrees of separation
Redundancy
Minimum spanning trees (Kruskal's algorithm)
Priority-list scheduling
Critical times (backflow algorithm)
Scheduling using the critical-path algorithm
Finding or using recursive or explicit formulas for
    population sequences
Sum of an arithmetic sequence
Sum of a geometric sequence


Things that will NOT be on the exam:

Maximum spanning trees
Logistic growth model