Math 3614: Study Guide 7 (11/4-11/13)

Sections 8.4,8.5,8.6

Objectives:

1. Learn the following terms:
   • sorting
   • complexity of sorting
   • bubble sort
   • merge sort
   • spanning tree
   • depth first search
   • breadth first search/backtracking
   • minimum spanning tree
   • greedy algorithm
   • Prim's algorithm
2. Become comfortable working the following types of problems:
   1. Use a bubble sort to sort a list of numbers.
   2. Use a merge sort to sort a list of numbers.
   3. Determine the largest number of comparisons needed to sort a list of n numbers using merge sort of bubble sort.
   4. Find a spanning tree of a simple graph using depth-first search.
   5. Find a spanning tree of a simple graph using breadth-first search.
   6. Use Prim's algorithm to construct a minimal spanning tree for a weighted graph.
3. Problem List:Learn to work the following problems:
   1. Section 8.4: 1, 6, 12
   2. Section 8.5: 1, 9, 13, 26
   3. Section 8.6: 1, 3

   Answers to even numbered problems

   Click here for answers to the even numbered problems.

Evaluation: