{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Feel free to ask your ta questions if you are stuck

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
efficient implementation after first reaching an inefficient way that works. Feel free to ask your TA questions if you are stuck at any step. The queue interface: import java.util.NoSuchElementException; public interface MyQueueI<K> / ** * Returns the element at the front of the queue * without removing it. * * @return element at the front of this queue * / public K peek() throws NoSuchElementException; 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full Document Right Arrow Icon
/ ** * Adds the specified element e at the back of this queue. * @param k * / public void enqueue(final K k); / ** * Deletes and returns the element at the front of this queue. * @return element at the front of this queue * / public K dequeue() throws NoSuchElementException; / ** * Tests if this queue is empty. * @return True on empty false otherwise. * / public boolean isEmpty(); JUnit Write JUnit tests to add to MyQueueTest to test your implementation of the interface MyQueueI . Your JUnit must individually test all four methods described in the interface. Remember that each test is inde- pendent (tests are not cumulative). You can take advantage of the setUp() and tearDown() methods which are run before and after every test (You may notice, they are annotated @Before and @After . In addition, every test method is annotated @Test so that JUnit knows which methods are tests to run. Challenge Question Reverse a stack without using extra stack (i.e. perform in place reversal). (Hint: Use recursion!) 2
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}