CSE331 Project 2: Deques solved

$35.00 $21.00

Category: You will receive a download link of the .ZIP file upon Payment


5/5 - (1 vote)

1 Assignment Overview
For this project you will be implementing a double-ended queue (or deque). Your deque will be used to
store and manipulate data from a given text file. In addition to the standard deque methods, you will be
implementing three bulk methods for modifying the whole deque.
2 Assignment Deliverables
You must turn in completed versions of the following files:
Be sure to use the specified file name and to submit your files for grading via Mimir before the project
3 Assignment Specifications
Your task will be to complete the methods listed below:
• iter
• len
• clear
• count if
• extend
• drop between
• peek front
• peek back
• push front
• push back
• pop front
• pop back
The pop, push, peek, and len functions should run in amortized constant time. Each of the other
methods should run in O(n) time. Your deque must use O(n) space.
The peek and pop methods should raise an IndexError if the deque is empty. drop between should
raise an IndexError if the start of the range is below 0 or the end of the range is above the len() of the
Deque. No other exceptions should be thrown.
You should include comments where appropriate. In particular, you should describe the overall method
used to implement your deque.
4 Assignment Notes
• Points will be deducted if your solution has warnings of any type.
• You have been supplied with stubs for the required methods. You must complete these methods to
complete the project. You may add more functions than what was provided, but you may not modify
the signatures or return types of the provided methods.
• You do not have to worry about error checking for valid input. You may assume that the supplied
reader function correctly reads the input file.
• You do have to worry about accessing elements from an empty deque.
• Implementations for is empty and repr have been provided. Note that these rely on the len and iter
functions, respectively, so you may want to complete these functions early.
• You have been provided with some unit tests that can be used to assess your solution. There are
additional test cases that will be kept hidden.
• It is your responsibility to check for potential edge cases. The supplied unit tests do not account for
all possible valid inputs
• The criteria parameter in the count if method is a function pointer. You can invoke it with
criteria(e) just like you would for a regular function.
• For the iter method, you may want to use the yield keyword.
• You may not use any of the classes in the collections module.