ICS4U-Linked List & Stacks & Queues

Read Chapter 12 pages 478 - 498
Read Section 9.2 Linked Lists and answer the following:
1. Define pointer, linked list, node and null
2. What is the basic algorithm to
  - delete a node
  - insert a node
  - search for an item in the list
Download and compile the StringList class, go over the code to understand the main methods - insert, delete and find
Download the file ListDemo and replace TextIO statements for System.out.println and Scanner input statements. Run the ListDemo program to be sure it works.
Read Section 9.3 Stacks and Queues and answer the following:
1. Define ADT, FIFO, LIFO
2. What is the major difference between a stack and a queue?
3. What are the three operations on an existing stack?
Complete quiz questions 1-6 (answer is linked, but try before peeking).

Report abuse