Java - Dynamic Stack Assignment - Revision history

Admin at 19:19, 15 November 2016

2016-11-15T19:19:53Z

Admin at 18:05, 10 November 2016

2016-11-10T18:05:54Z

Admin at 18:05, 10 November 2016

2016-11-10T18:05:25Z

Admin at 18:05, 10 November 2016

2016-11-10T18:05:02Z

Admin at 17:27, 10 November 2016

2016-11-10T17:27:03Z

Admin at 17:24, 10 November 2016

2016-11-10T17:24:37Z

Admin at 16:09, 10 November 2016

2016-11-10T16:09:51Z

Admin at 20:04, 9 November 2016

2016-11-09T20:04:59Z

Admin at 20:02, 9 November 2016

2016-11-09T20:02:54Z

Admin: Created page with "== Objectives == * You will implement a dynamically-sized queue using linked Nodes * You will implement queue methods (enqueue/add, dequeue/remove, etc.) * You will test your..."

2016-11-09T19:53:52Z

Created page with "== Objectives == * You will implement a dynamically-sized queue using linked Nodes * You will implement queue methods (enqueue/add, dequeue/remove, etc.) * You will test your..."

New page

== Objectives ==
* You will implement a dynamically-sized queue using linked Nodes
* You will implement queue methods (enqueue/add, dequeue/remove, etc.)
* You will test your dynamic queue in a main() method

== Resources ==
* [[Media:Stacks.ppt]]
* [[https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]]

== Directions ==

=== Before & After Visualizations ===
# Take out a pencil and paper or a dry-erase board and marker
# Load the [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
# Consider each of the following questions and use the visualization tool to help you answer them. Practice drawing each of the visualizations yourself.
#* What does an empty stack look like? (The top reference variable is null)
#* For each of the following actions, assess what the picture looks like Before? then After? What changes occurred to make the Before image become the After image?
#** push(4)
#** push(2)
#** pop()
#** pop()

=== Dynamic Stack class ===
# Create a new class called DynamicStack

==== Attributes ====
* What attribute must we keep track of when we talk about stacks? (Hint: rhymes with "mop")
* Create a Node reference for the most important stack attribute

==== Methods ====
** Implement '''void push(data)''' using Nodes.
*** push() should not return anything
*** push() creates a new Node with the data parameter, and set the new Node's next reference to the top
*** Don't forget to update the top to be the new node!
** Implement '''int pop()''' using Nodes
*** pop() removes the value on top of the stack, return it
*** pop() should also update the top
*** pop() returns '''null''' if the stack is empty
** Implement '''isEmpty()''' which returns true if the stack is empty, and false otherwise
** Implement '''print()''' which should print your entire stack from top down (to null)
** TEST YOUR STACK
*** Be sure to push A LOT of data to test the dynamic size
*** Also test popping A LOT of data to make sure it works too

@@ Line 66: / Line 66: @@
 === Testing ===
 # You should be able to reuse your main() method from the static stack assignment
-# Write a loop that pushes A LOT of data to test the dynamic size
+# Write a loop that pushes A LOT of data to test the dynamic stack
 # Write a loop that pops A LOT of data to make sure it works too

@@ Line 64: / Line 64: @@
 *# Hint: use the for loop that we covered in class
-==== Testing ====
+=== Testing ===
 # You should be able to reuse your main() method from the static stack assignment
 # Write a loop that pushes A LOT of data to test the dynamic size
 # Write a loop that pops A LOT of data to make sure it works too

@@ Line 21: / Line 21: @@
 #** pop()
-=== Dynamic Stack class ===
+=== Node class ===
 # Create a new class called Node
 #* Implement the code for the Node class using [[Media:Node.java]] as a guide
-#* You may want to add a specific constructor that takes in data as a parameter
+#* You will want to add a specific constructor that takes in data as a parameter, and saves the data into the num attribute
 ==== Attributes ====

@@ Line 44: / Line 44: @@
 *# pop() removes the value on top of the stack and returns it
 *# update the '''top''' so that it references its next Node (you need to update top before you return the data)
 * '''boolean isEmpty()'''
 *# return true if the stack is empty, and false otherwise
 *# Hint: What does '''top''' reference when the stack is empty?
 * '''void print()'''

@@ Line 41: / Line 41: @@
 * '''int pop()'''
-*# pop() returns '''null''' if the stack is empty
+*# pop() returns Integer.MIN_VALUE if the stack is empty
 *# pop() removes the value on top of the stack and returns it
 *# update the '''top''' so that it references its next Node (you need to update top before you return the data)

@@ Line 1: / Line 1: @@
 == Objectives ==
-* You will implement a dynamically-sized queue using linked Nodes
+* You will implement a dynamically-sized stack using linked Nodes
-* You will implement queue methods (enqueue/add, dequeue/remove, etc.)
+* You will implement stack methods (push(), pop(), isEmpty(), etc.)
-* You will test your dynamic queue in a main() method
+* You will test your dynamic stack in a main() method
 == Resources ==

@@ Line 6: / Line 6: @@
 == Resources ==
 * [[Media:Stacks.ppt]]
-* [[https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]]
+* [https://www.cs.usfca.edu/~galles/visualization/StackLL.html Dynamic Stack Visualization]
 == Directions ==
@@ Line 50: / Line 50: @@
 * '''void print()'''
-*# print your entire stack from top down (to null)
+*# print your entire stack starting at the '''top''' (to null)
-*# Use
+*# Hint: use the for loop that we covered in class
+==== Testing ====
-** TEST YOUR STACK
+# You should be able to reuse your main() method from the static stack assignment
-*** Be sure to push A LOT of data to test the dynamic size
+# Write a loop that pushes A LOT of data to test the dynamic size
-*** Also test popping A LOT of data to make sure it works too
+# Write a loop that pops A LOT of data to make sure it works too

@@ Line 22: / Line 22: @@
 === Dynamic Stack class ===
 # Create a new class called DynamicStack
 ==== Attributes ====
 * What attribute must we keep track of when we talk about stacks? (Hint: rhymes with "mop")
 * Create a Node reference for the most important stack attribute
 ==== Methods ====
-** Implement '''void push(data)''' using Nodes.
+* '''void push(int data)'''
-*** push() should not return anything
+*# push() should not return anything
-*** push() creates a new Node with the data parameter, and set the new Node's next reference to the top
+*# push() creates a new Node with the data parameter
-*** Don't forget to update the top to be the new node!
+*# assign the new Node's next reference to the '''top''' (so that the new Node is linked to the current top Node)
-** Implement '''int pop()''' using Nodes
+*# update the '''top''' to reference the new Node!
-*** pop() removes the value on top of the stack, return it
-*** pop() should also update the top
+* '''int pop()'''
-*** pop() returns '''null''' if the stack is empty
+*# pop() returns '''null''' if the stack is empty
-** Implement '''isEmpty()''' which returns true if the stack is empty, and false otherwise
+*# pop() removes the value on top of the stack and returns it
-** Implement '''print()''' which should print your entire stack from top down (to null)
+*# update the '''top''' so that it references its next Node (you need to update top before you return the data)
 ** TEST YOUR STACK
 *** Be sure to push A LOT of data to test the dynamic size
 *** Also test popping A LOT of data to make sure it works too