Spring 2017

Professor: Erika L.C. King

Email:eking@hws.edu

Office: Lansing 304

Phone: (315)781-3355

**Our second exam is Tuesday (April 11th) 7:15PM-9:15PM in Napier 101. You will turn in your journal at the beginning of the exam. I will
randomly grade three to five of the entries
completely. Then I will count to see how many total entries you have. Note that it is highly likely that
the graded entries will be those things we did not specifically go over in class. Remember to follow the
journal guidelines (hightlighting exercise/problem numbers or the start of a question, etc.).**

- Vocabulary List
- One Question you had followed by an answer for each journal assignment for a total of 12 questions with answers.
- Section 3.3.1, numbers 3, 4 and 5
- DeMorgan's First Law: For homework on Friday (February 24th) you proved the Generalized Version of DeMorgan's Second Law. Now prove the Generalized Version of DeMorgan's First Law.
- Section 3.3.2, numbers 1, 2, 3 and 4
- Problem 7 in Section 3.13
- Continue to play the Dot Game with your friends, and see if you can come up with any new conjectures, ideas to support your claims, or counterexamples to show your claims were false. All three are important mathematical tasks! Add these attempts to your work in your journal reflecting on the questions on page 65 about the Dot Game. We discuss your results and will play the game in Tuesday's class.
- Check Yourself problems 6-10 at the end of Section 3.5
- Check Yourself problems 1, 2 and 3 at the end of Section 3.6
- Check Yourself problems 1, 2 and 3 at the end of Section 3.7
- Problems 2 and 5 in Section 3.8
- Problems 1, 6, 7, and 8 in Section 3.8
- Check Yourself problems 1 and 2 at the end of Section 3.9
- Problems 1, 9 and 12 in Section 3.13
- We saw a presentation of a solution to Problem 4 from Section 3.8 that used degrees of vertices. In your journal, write another solution to the problem that uses the formula from Problem 3 of Section 3.8 about edges. That is, show that the only cycle that is isomorphic to its complement is C5.
- In your journal, using the ideas we discussed at the end of Tuesday's class, write a NICE proof of the theorem that states: Every tree with at least two vertices has at least one leaf.
- Problems 4, 5 and 6 in Section 3.13
- Check Yourself problems 1-5 at the end of Section 4.2
- Problem 16 in Section 3.13
- Check Yourself problems 1-2 at the end of Section 4.4
- Problems 14 and 17 in Section 3.13
- Problems 2 and 3 from Section 4.11
- Problems 18 in Section 3.13
- You Try It problems 1.1-1.4 from the Relations handout
- Problems 5, 6 and 7 from Section 4.11
- You Try It problem 1.5 parts (1), (2), (4) and (5) from the Relations handout
- You Try It problem 1.6 parts (1) and (2) from the Relations handout
- You Try It problems 1.7 and 1.8 from the Relations handout
- Problems 20 and 25 from Section 4.12 (page 114)
- Check Yourself problems 1 and 3 at the end of Section 4.5
- Problem 1 from Section 4.6
- You Try It problems 1.9 and 1.11-1.15 from the Relations handout
- Problem 2 from Section 1.3 (Problems) from the Relations handout