Governor's Career & Technical Academy Arlington

Computer Science 202: Week 12


This week we will finish with the stack ADT and learn about the queue ADT.

Tuesday, May 3rd


As we discussed in class last Thursday, each of you will present a program that takes an arbitray infix expression and evaluates it for balanced brackets - (), [], and {} - and returns valid if the brackents are balanced and invalid if they are not.

Additionally, Leila will share her visualization of the algorithm she discussed last class, and Rachael will share her further investigation into prefix and postfix notations for mathematical expressions.

At the end of class, divide up Chapter 8: Queues for presentation in class on Thursday.


Prepare a summary presentation of the section of Chapter 8: Queues which you were given in class.