Lessons: 16Length: 2.4 hours
- Overview
- Transcript
4.3 Queues
In the last lesson we learned about stacks, in this lesson we’ll learn about another collection called the queue which is rather similar to a stack but it stores and retrieves its data in a “first in, first out” fashion. Let’s take a look.
1.Introduction
1.1Introduction01:19
1.1
Introduction
01:19
2.Intermediate Topics
2.1Interfaces06:02
2.1
Interfaces
06:02
2.2Practical Interface Example19:34
2.2
Practical Interface Example
19:34
3.Array Algorithms
3.1Searching an Array08:06
3.1
Searching an Array
08:06
3.2Filling & Deleting Array Elements09:05
3.2
Filling & Deleting Array Elements
09:05
3.3Selection Sort08:35
3.3
Selection Sort
08:35
3.4Calculating Min/Max Values05:37
3.4
Calculating Min/Max Values
05:37
3.5Calculating Sums and Averages04:06
3.5
Calculating Sums and Averages
04:06
4.Other Data Structures
4.1LinkedList & The Iterator15:33
4.1
LinkedList & The Iterator
15:33
4.2Stacks05:45
4.2
Stacks
05:45
4.3Queues04:47
4.3
Queues
04:47
5.Software Creation Process
5.1Software Development Process06:29
5.1
Software Development Process
06:29
5.2Class Creation Tips06:24
5.2
Class Creation Tips
06:24
5.3Class Relationships06:34
5.3
Class Relationships
06:34
5.4Software Creation Process In-Practice32:51
5.4
Software Creation Process In-Practice
32:51
6.Conclusion
6.1Conclusion00:35
6.1
Conclusion
00:35
