Overview
The quiz grades for linked lists were excellent (A: 11, B: 2, C: 1, D: 1), suggesting the group project approach to learn new data types might be working for us, so this week we will use it again as we study Chapter 18: Stacks.
Wednesday, February 26th and Friday, February 28th
Classwork / Homework
Work on your assigned group programming projects.
Monday, February 24th
Classwork
We're going to take a few minutes to go over the quiz. Johan, Isaac, Marin, Cody, Luis, Anar, Adonis and Jametheil, please sit near the white boards at the beginning of class. I'm going to discuss the single node case that several of you thought you had to handle specially, even though you didn't. Luis had a delightful solution for this special case we should also see, even though he didn't need it either. Anfal wrote a comment in his code that nicely points out why the special case isn't special.
I didn't see anyone sketch out a diagram, which I think would have really helped those of you who did struggle a bit with this. I'll say again that it is the abstraction that gives you the power to reason about this!
Next we will divide into groups for our stack projects.
I ran the python random group generator, which gave us the following groups for this next project:
- Towers of Hanoi: Adonis, Marin, Cody and Parker
- has_matching_tags: Turner, Ved, Issac and Caleb
- eval_postfix_expr: Anar, Anfal, Jamethiel and Johan
- is_valid_infix_expr: Luis, Trostin and Akshay
We will divide up the as yet incomplete Evaluating postfix expressions and the three projects in Chapter 18 Exercise Set 1: Stack Applications among the four groups.
We'll then discuss what it means to parse a string, and talk about how each group except the Towers of Hanoi group will have to write a parser.
Whatever time remains you can use to begin work on your projects.
Homework
Work on your assigned group programming project.