gaspersic/coding-interview-university
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Updated queues - complete.

Browse Source
This commit is contained in:
John Washam 2016-06-19 21:36:34 -07:00
parent 5084c9a2de
commit 21047daa49
1 changed files with 4 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
plan.txt
View File

@ -218,15 +218,16 @@ Then test it out on a computer to make sure it's not buggy from syntax.
* - https://class.coursera.org/algs4partI-010/lecture/19 * - https://class.coursera.org/algs4partI-010/lecture/19
* - https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html * - https://www.lynda.com/Developer-Programming-Foundations-tutorials/Using-stacks-last-first-out/149042/177120-4.html
* - Will not implement. Implementing with array is trivial. * - Will not implement. Implementing with array is trivial.
Queues * - Queues
* - https://class.coursera.org/algs4partI-010/lecture/20 * - https://class.coursera.org/algs4partI-010/lecture/20
* - https://www.coursera.org/learn/data-structures/lecture/EShpq/queue * - https://www.coursera.org/learn/data-structures/lecture/EShpq/queue
* - Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer * - Circular buffer/FIFO: https://en.wikipedia.org/wiki/Circular_buffer
- Implement using linked-list, with tail pointer: * - https://class.coursera.org/algs4partI-010/lecture/23
* - Implement using linked-list, with tail pointer:
- enqueue(value) - adds value at position at tail - enqueue(value) - adds value at position at tail
- dequeue() - returns value and removes least recently added element (front) - dequeue() - returns value and removes least recently added element (front)
- empty() - empty()
- Implement using fixed-sized array: * - Implement using fixed-sized array:
- enqueue(value) - adds item at end of available storage - enqueue(value) - adds item at end of available storage
- dequeue() - returns value and removes least recently added element - dequeue() - returns value and removes least recently added element
- empty() - empty()