Category: Class Recaps (Page 1 of 5)

The final exam is tomorrow Wednesday, May 21, during our usual class time.

Yesterday in class I went over an outline of the topics that will be covered on the final exam. The final exam will be similar in length and format to the midterm exams, so the best way to prepare for the final is to study the midterm exams.

You can find solutions to the midterm exams at OpenLab Files–you can also study related examples and homework exercises.

In particular, focus on the exam questions that cover the following topics:

• recursively defined functions and algorithms (Exam #1)
• counting principles (Product Rule & Sum Rule), permutations (Exams #1 and #3); also review combinations
• graphs (types of graphs, degrees and neighborhoods, Euler paths/circuits, applications of graphs, special graphs) – Exams #2 and #3
• trees (Exam #3)

The format for Exam #3 will be similar to Exam #2: I will distribute a set of take-home exercises next Wednesday (May 14), to be handed in the following Monday (May 19). There will also be a short in-class exam that Monday, similar to the take-home. Then the final exam is Wednesday, May 21.

Exam #3 will cover some more material on graphs (Euler path/circuits) and material on trees, which we started and will continue with next week. It will also include some material from earlier in the semester, as review for the final.

Please work on HW#4:

Sec 10.5: #1-3, 7, 9

Sec 11.1: #3-4 (with more TBA)

Here is a recap of the upcoming schedule:

April 28-30:

May 5-7:

Here is the schedule for the next week–for Exam #2, I will distribute a set of take-home exercises tomorrow (Wednesday, 4/23), to be handed in next Monday. There will also be a short in-class exam on Monday, similar to the take-home; the take-home and in-class exercises will each be 50% of Exam #2:

Also, as noted above and announced in class, I will collect Sec 10.3, #8 (writing down the adjacency matrix for the graph in #4) tomorrow. We worked through #7 in class together, after reviewing and introducing adjacency lists and adjacency matrices:

We reintroduced the “Bridges of Konigsburg” problem above, which Euler formulated in the late 1700s and led to the development of graph theory, by looking at this video: