During class today we will share and discuss our stack application code. Joseph and Nate won't be here, but those of us who are will share what we have.

Nate has an excellent summary of the Applications of Stacks with which we all need to become familiar.

While we will move on to queues for tonight's homework, I'll work on a formal evaluation (i.e. a test) for our stack study over Spring break.

Read the first three sections of Chapter 3: Queues on pages 253 to 260, taking notes in your git repo. We will once again implement this ADT using both linked lists and arrays, only this time the array implementation is a bit more ornery then it was for stacks, while the linked list implementation is just as easy.

We'll start class with a quick check-in as to the completed state of our two stack implementations in libcsc223.

Then we'll work in the groups you decided upon while I was out sick on the stack applications you planned last week. I still don't know what those are, so you will have to share them with me.

According to the three folks here today (Edward, Cyrus, and Sheel), Julissa is working on parentheses matching, Joseph is going to reverse a list using a stack, and Nate is working on the two recursive algorithms, Fibinacci and Towers of Hanoi.

Sheel is working infix to postfix and infix to prefix, Edward is working evaluating postfix expressions, and Cyrus is working evaluating prefix expressions.