Everyone should work with one lab partner on this assignment.
Create a BlueJ project named inlab7 and add the ArrayStack.java file that we developed in lecture on Monday to it.
Take the original ArrayStack.java code and modify it so that it detects all error conditions in the push, peek and pop methods using exceptions instead of calls to full and empty.
When you are finished, have either Mike or one of the lab consultants come to your computer. That person will examine your program visually and will test it manually to see if it is working properly. That person will report the results to Mike who will record the grade.
Take the original ArrayStack.java code (the one without exceptions in it) and modify it so that the stack is implemented with a singly linked list instead of an array. Add the Node.java class that we developed in lecture on February 18th to the project. Use Node.java as the basis for your linked list solution. Do not use the built-in LinkedList class to solve this problem.
E-mail the linked list solution to Mike Thiesen at mthiesen@gmail.com in one message. The subject of the message should be: CS221-xx inlab7 your-names. The xx is the number of your lab section.
Delete any BlueJ projects that you created and empty the recycle bin. Thanks.
Use any remaining time to prepare for tomorrow's midterm. Feel free to ask Mike or the consultants for help with any concepts that are giving you trouble. Good luck preparing!