Java - Static Queue Assignment - Revision history

Admin at 18:14, 15 November 2018

2018-11-15T18:14:21Z

2018-11-15T16:59:59Z

2018-11-15T16:21:31Z

2018-11-13T07:58:22Z

2017-11-09T17:24:27Z

2017-11-09T15:41:25Z

2017-11-06T19:43:21Z

‎Queue Methods

2017-11-06T15:40:04Z

‎Queue Methods

2016-10-28T15:24:53Z

2015-11-02T16:07:29Z

Protected "Java - Static Queue Assignment" ([edit=sysop] (indefinite) [move=sysop] (indefinite)) [cascading]

@@ Line 59: / Line 59: @@
 # Copy and paste your static queue code
 # Add a new attribute named '''size''' to keep track of the number of added elements
-# Modify your the code in the rest of circular queue so that both head and tail are able to wrap around back to the beginning.  You will need to use your '''size''' attribute in several methods
+# Modify your the code in the rest of circular queue so that both head and tail are able to wrap around back to the beginning.  You will need to use your '''size''' attribute in several methods (isFull(), print(), and toString())
 # Hint: Any method that changes the head and tail...check if either goes out of bounds...then force it to go back to 0 instead

@@ Line 44: / Line 44: @@
 * boolean isFull() - returns true if the queue is full (tail has hit the end of the array), false otherwise
 * boolean isEmpty() - returns true if the queue is empty (head and tail are not valid indices), false otherwise
-* int peek() - returns data element at the head (but does not remove it)
+* int peek() - if the queue is not empty, then return data element at the head (but does not remove it), otherwise return Integer.MIN_VALUE
 * void print() - prints out the queue from head to tail
 * String toString() - returns the String representation of a queue

← Older revision		Revision as of 16:21, 15 November 2018
Line 60:		Line 60:
	# Add a new attribute named '''size''' to keep track of the number of added elements		# Add a new attribute named '''size''' to keep track of the number of added elements
	# Modify your the code in the rest of circular queue so that both head and tail are able to wrap around back to the beginning. You will need to use your '''size''' attribute in several methods		# Modify your the code in the rest of circular queue so that both head and tail are able to wrap around back to the beginning. You will need to use your '''size''' attribute in several methods
		+	# Hint: Any method that changes the head and tail...check if either goes out of bounds...then force it to go back to 0 instead

@@ Line 5: / Line 5: @@
 == Resources ==
-* [[Media:Queues.ppt]]
+* [https://docs.google.com/presentation/d/1Wckb8R3om4RGi9O8HWu0yYdkaFek5y0_GI1ak0H89yU/edit?usp=sharing Queue slides] (newer)
 * [https://www.cs.usfca.edu/~galles/visualization/Algorithms.html Data Structure Visualizations]

@@ Line 26: / Line 26: @@
 *# check if the queue is not full
 *## check if the queue is empty (in case you want to change head b/c you're adding to an empty queue)
-*# increment the tail
+*### increment the head or set to 0 b/c you're adding the first item to an empty queue
-*# put the data in the tail
+*## increment the tail
 * void add(int data) - adds data to the tail of the queue if it is not full
 *# make a method call to enqueue() -- DO NOT COPY AND PASTE enqueue() code
 * int dequeue() - removes and returns data from the head of the queue if it is non-empty
 *# check if queue is not empty
-*# save the head into a new int variable named oldHead
+*## save the head into a new int variable named oldHead
-*# increment the head
+*## increment the head
-*# check if the head is beyond the tail now (because now the queue should be empty and you reset both head and tail
+*## check if the head is beyond the tail now (because now the queue should be empty and you reset both head and tail
-*# return the data at the old head
+*### reset both the head and tail to -1 b/c you should have an empty queue now
 * int remove() - removes and returns data from the head of the queue if it is non-empty
 *# make a method call to dequeue() -- DO NOT COPY AND PASTE dequeue() code

@@ Line 35: / Line 35: @@
 === Testing Queue ===
 * Test your queue class to see if it works (Hint: use the Stack main() as an example)
 == Circular Queue Challenge ==

← Older revision	Revision as of 16:07, 2 November 2015
(No difference)