Math 210

Spring 2016

Homework

Note:  Homework assignments will be given in class.  This page is meant to merely be a backup.  I will try to update this page occasionally, but I make no promises.  Do not count on this page being up-to-date. 

If you miss class when the homework is assigned and this page is not updated, then get the assignment from a classmate.

I will drop some assignments.  The number of assignments kept will be announced towards the end of the course.

There are a total of at least 27 homework assignments.  Only the best 21 will be kept.

Section Problems Due Answers (for some assignments)
1.1a 2, 4, 21 Wednesday January 13  
1.1b 10bdfh, 12acef, 14(all), 16, 18 Tuesday January 19  
1.1c 24, 28a, 32cde, 36f, 44bc Tuesday January 19  
1.2 8, 10, 40 Wednesday January 20  
1.3 9d, 10b, 14, 31 Thursday January 21  
  Test 1 Friday January 22  
1.4 2, 5, 10bcd, 14, 25abef, 33ace Tuesday January 26  
1.5 4, 613f, 8, 32, 36ad Wednesday January 27 Answers for 1.5
2.1 6, 20, 33b, 36 Friday January 29  
  Gateway Quiz 1 Friday January 29  
2.2 2, 4, 26abcde, 50bc, 52
26d) A \cup (B-A)
26e) A \cup B \cup C
Monday February 1  
  Test 2 Tuesday February 2  
2.3a 4, 10, 11, 15bcde, 16, 22ab, 32ac Friday February 5
2.3b 8aceg, 30, 58, A
58) Hint:  See Example 27
A)  Find the inverse function of f(x)=-3x+4
Friday February 5  
2.4 3, 6abde, 10abe, 12bd, 29bc, 34ac Monday February 8  
5.1 6, 10, 32 Tuesday February 9 Answers for 5.1
  Gateway Quiz 2 Wednesday February 10  
10.1/10.2a 10.1)  4, 6, 8, 16
10.2a) 2, 8, 12
Wednesday February 10  
10.2b 20abde, 22, 24, 56, 58 Thursday February 11  
  Test 3 Friday February 12  
10.3a 6, 8, 12, 18, 26, 28, 30 Thursday February 18  
10.3b 36, 38, 42, 62 Friday February 19  
10.4 2, 6, 12, 14c, A, B
A)  For the graph in #33,
   a)  find all of the cut vertices.
   b)  find all of the bridges.
B)  Find the vertex connectivity (kappa), and state a vertex cut that justifies your answer, for
   a)  the graph G in #20.
   b)  the graph in #50c. 
Monday February 22  
10.5 4, 10, 20, 38, 40, 42 Monday February 22  
10.6 A, B, 25
A)  For the graph in #2, find the shortest path from a to z and the length of that path.
B)  For the graph in #17b, find the least cost for a route from Trenton to Cape May.
Tuesday February 23  
  Test 4 Wednesday February 24  
10.8 3, 8*, 10*
*For 8 and 10, color the graph with the fewest colors possible.  (Adding color labels, like the word "red" is the same as finding a red pen and actually coloring - it is up to you.)
Friday February 26  
11.1 2, 4/8/10, 12*
12*:  Both give the number and draw the non-isomorphic trees.
Monday February 29  
11.1b 18, 20, 22 Tuesday March 1  
11.2 2/4, A
A:  If you use a binary search tree to encode n items, what is the minimum value for the maximum number of coparisons needed to determine if an element is in the tree, where
a) n=10
b) n=1000
c) n=50,000
Wednesday March 2  
11.3 4, 8/11/14, 18*, 24
18*)  There are two expression given in the book, but do the problem for the first expression only.
Thursday March 3  
11.4 6*, 10, 14/16b*
6*)  Indicate the order in which you remove the edges.
16b*)  Do the problem for the graph in #14 only.
Thursday March 3  
  Test 5 Friday March 4  
11.5 4*, 7*
*) Indicate the order in which you add the edges and draw the tree that is formed.
Wednesday March 9  
12.1 (brief coverage, no homework for 12.1)    
12.3 2, 4, 6ad Wednesday March 9  
  Final Exam Part A Thursday March 10  
  Final Exam Part B Friday March 11  

Prof. Ellen Fagerstrom Home Page

Math 210 Home Page

Math 210 Syllabus