Assignment 4
Stacks
Introduction
In this assignment, you will be using the List ADT to solve a number of problems in Part 1, and then will
implement a generic stack in Part 2.
The automated grading of your assignment will include some different and additional tests to those found in
the [Link] file, as it does not include a comprehensive set of sets for each method. You are expected
to write additional tests until you are convinced each method has full test coverage. The displayResults and
test coverage videos provide more information about code testing.
Objectives
Upon finishing this assignment, you should be able to:
○ Solve problems using only the methods available in the List ADT
○ Implement a reference-based (node) implementation of a stack
○ Implement a stack in Java that supports generics
Submission and Grading
Attach [Link] and [Link] to the BrightSpace assignment page. Remember to click
submit afterward. You should receive a notification that your assignment was successfully submitted.
If you chose not to complete some of the methods required, you must provide a stub for the incomplete
method(s) in order for our tester to compile. If you submit files that do not compile with our tester, you will
receive a zero grade for the assignment. It is your responsibility to ensure you follow the specification and
submit the correct files. Additionally, your code must not be written to specifically pass the test cases in the
tester, instead, it must work on all valid inputs. We may change the input values during grading and we will
inspect your code for hard-coded solutions. This video explains stubs.
Be sure you submit your assignment, not just save a draft. All late and incorrect submissions will be given a
zero grade. A reminder that it is OK to talk about your assignment with your classmates, but not to share
code electronically or visually (on a display screen or paper). Plagiarism detection software will be run on all
submissions.
1/2
Instructions
Part 1:
1. Download all of the .java files found in the Assignments > Assignment 4 page on BrightSpace.
2. Part 1 uses files [Link], [Link], [Link], [Link], and [Link].
3. Read through the documentation provided in the [Link] interface. You will be using these methods
to solve problems specified in [Link]. The exercises work with a list of rocks ([Link]
and [Link]).
4. Compile and run [Link]. Work through implementing each exercise one at a time. Debug the
method until all of the tests pass for that method before proceeding to the next method. I have made a
short video to clarify what you are being asked to do for a number of the methods.
Part 2:
1. For Part 2, you will complete the A4Stack class so that it implements the Stack interface. You will write
a reference-based implementation using the node class provided ([Link])
2. Read through the documentation provided in the [Link] interface. There is a lot of information
there that will help you set up your generic types when implementing the Stack interface.
3. Compile and run [Link]. Work through implementing each stack method one at a time. Debug
the method until all of the tests pass for that method before proceeding to the next method.
CRITICAL: Any compile or runtime errors will result in a zero grade (if the tester crashes it will not be able
to award you any points for any previous tests that may have passed). Make sure to compile and run your
program before submitting it!
2/2
