Self-Learning Module
You'll need to sign into your MSOE account VidGrid to see the videos.
In this module, you will learn about the Deque
interface and multiple ways to implement it.
- How does the
Deque
differ from aStack
? - How does the
Deque
differ from aQueue
? - What methods are used to add/remove/access the front of the deque?
- What methods are used to add/remove/access the back of the deque?
- Why does the
Deque
discourage storingnull
values? - What class in the the JCF implements a linked-list based implementation of the
Deque
interface? - What class in the the JCF implements an array based implementation of the
Deque
interface? - How can a circular queue be used to implement a
Deque
? - What are the respective advantages of each of the following
Deque
implementations: linked-list, array, and circular queue based?
Requirements
- Take notes on the video below and upload your notes to Canvas to complete the assignment
- Watch [14:08] [link]