Basic Data Structures and Abstract Data Types
Lecture #7: Basic Data Structures — Arrays and Linked Lists
- Lecture Notes
- Questions for Review
- Additional Reading: The Amortized Cost of a Sequence of ArrayList Operations
Tutorial Exercise #8: Basic Data Structures — Arrays and Linked Lists
Lecture #8: Basic Abstract Data Types — Stacks and Queues
Lecture #8: Basic Abstract Data Types — Stacks and Queues
- Lecture Notes
-
Questions for Review
-
More about the Java Code for This Lecture
- Code for an Unbounded Stack
- Stack.java — Interace for an Unbounded Stack: [ Source ] [ Documentation ]
- ListStack.java — Linked-list Implementation of an Unbounded Stack: [ Source ] [ Documentation ]
- TestListStack.java — Tests for this Implementation:
[ Source ]
- Code for a Bounded Stack
- StackFullException.java — An Exception to be thrown if the Stack is full: [ Source ] [ Documentation ]
- BoundedStack.java — Interface for a Bounded Stack: [ Source ] [ Documentation ]
- ArrayStack.java — Array Implementation of a Bounded Stack: [ Source ] [ Documentation ]
- TestArrayStack.java — Tests for this Implementation: [ Source ]
Tutorial Exercise #9: Basic Abstract Data Types — Stacks and Queues
-
Problems To Be Solved
- Code for an Unbounded Queue
- Queue.java — Interface for an Unbounded Queue: [ Source ] [ Documentation ]
- ListQueue.java — Linked-List Implementation of an Unbounded Queue (Code To Be Supplied): [ Documentation ]
- TestListQueue.java — Test for This Implementation:
[ Source ]
- Code for a Bounded Queue
- QueueFull Exception.java — An Exception to be thrown if the Queue is Full: [ Source ] [ Documentation ]
- BoundedQueue.java — Interface for a Bounded Queue: [ Source ] [ Documentation ]
- ArrayQueue.java — Array Implementation of a Bounded Queue (To Be Supplied): [ Documentation ]
- TestArrayQueue.java — Tests for This Implementation: [ Source ]
