public_html/cs230-assignments/ps06) folder upload a zip file of all materials.
LinkedQueue.java, CircularArrayQueue.javaand a text file
bigO.txtwith your answers to Task 2.
Before starting this task make sure you review the handout on Queues and read section 15.1-15.5 of the textbook.
In class we discussed one full implementation of the
Queue interface (
ArrayQueue) and two partial implementations. For this task, you are asked to complete and test the partial implementations:
For your convenience we have started a QueueImplementations.zip template. It includes the beginning of a driver aimed to show that your implementation works correctly. You need to complete it and also provide javadoc documentation for the classes you will edit.
Before starting this task make sure you review the handout on Efficiency of Algorithms and read Chapter 12 of the textbook.
Consider the following method that removes a CD from a linear collection (e.g. array).
Assume that the collection has
n CDs to start with. Answer each of the questions below. Provide your answer by writing a sentence for each Question, and then explaining the Big-O notation associated with the relevant statement. Note: If you find any of the Questions ambiguous (that is, it may mean two different things and you are not sure which one is the correct interpretation), explain why and give your answer for each alternative.
Write your answer on a text .txt file (not a Word .doc or other special format, just plain text) and submit it in the proper assignment folder.