Skip to main content
ICT
Lesson AB31 - Stacks and Queues
 
Main Previous Next
Title Page >  
Summary >  
Lesson A1 >  
Lesson A2 >  
Lesson A3 >  
Lesson A4 >  
Lesson A5 >  
Lesson A6 >  
Lesson A7 >  
Lesson A8 >  
Lesson A9 >  
Lesson A10 >  
Lesson A11 >  
Lesson A12 >  
Lesson A13 >  
Lesson A14 >  
Lesson A15 >  
Lesson A16 >  
Lesson A17 >  
Lesson A18 >  
Lesson A19 >  
Lesson A20 >  
Lesson A21 >  
Lesson A22 >  
Lesson AB23 >  
Lesson AB24 >  
Lesson AB25 >  
Lesson AB26 >  
Lesson AB27 >  
Lesson AB28 >  
Lesson AB29 >  
Lesson AB30 >  
Lesson AB31 >  
Lesson AB32 >  
Lesson AB33 >  
Vocabulary >  
 

AB31 Introduction page 1 of 10

Earlier in Lesson A9, Recursion, the concept of a stack was introduced. A stack is a linear data structure with well-defined insertion and deletion routines. Data is both placed and taken from the ‘top’ of the stack. Queues are very similar to stacks, except that Queues remove data from the front while adding data at the end.

The key topics for this lesson are:

  1. Stacks
  2. The Java Stack Class
  3. Queues
  4. The Java Queue Interface
Main Previous Next
Contact
 © ICT 2006, All Rights Reserved.