Overview
This week will study a discrete mathematical object very important to computer scientists: trees.
Thursday, March 13
Classwork
We will begin class by discussing the Graph Quiz 1 Solution
We will then have the promised new short quiz based on the homework exercises.
I am then going to use class time to talk more about something mentioned in section 2.2, but not developed (with promised development being promised in a later section) - Mathematical induction. We will look at José Ejemplo's induction proofs.
We will also discuss constructive proofs, spanning trees, and rooted trees, and take a look at some of José's musings on the Tree ADT
Homework
Complete all Additional Problems from Section 2.2: Trees, paying particular attention to problems 2, 4, 5, and 6. Come to class next Tuesday prepared with questions on any problems that give you pause.
Tuesday, March 11th
Classwork
We will begin class with the promised short quiz based on the homework exercises.
We will then discuss the ideas presented in Section 2.2: Trees in our textbook.Homework
Complete all Practice Problems and as many Additional Problems from Section 2.2: Trees as time enables. Come to class on Thursday prepared with questions on any problems that give you pause.