Overview
This week we will again continue with our study of binary trees, culminating with Jelkner's favorite topic, heaps.
Wednesday, Thursday and Friday, March 11th, 12th and 13th
Classwork /Homework / Evaluation
We delayed testing the expect script Liam is writing since he is again making significant changes to it, and we have moved it to a new CS with CP/M git repository that we will use to aggragate the resources we are developing for this course.
Once ready, runoncpm.sh greatly improve our BSD C on CP/M workflow,
so stay tuned.
Period 1A has yet to share their binary tree presentations, so we will do that on Wednesday. Period 3B can use class time for their max heap programs.
I will be out on Friday, so the 1A section can use class time to work on their max heap programs.
Monday and Tuesday, March 9th and 10th
Classwork
Today you will share your presentations of the binary tree topics you selected (or were assigned) last week.
Homework
Section 12.1: Binary Heaps on pages 361 to 365 in our text. Write a program for BSD C that manages a max heap, interactively allowing users to insert and remove items from the heap. Be prepared to demo your running program at the beginning of class next Monday or Tuesday (March 16 or 17).