Data Structures & Algorithms I: ArrayLists, LinkedLists, Stacks and Queues

Module 0: Introduction and Review
Review of important Java principles involved in object-oriented design
The Iterator & Iterable design patterns, and the Comparable & Comparator interfaces
Basic “Big-Oh” notation and asymptotic analysis
Module 1: Arrays, ArrayLists and Recursion
The array class, access vs. search of an array, static allocation and efficiency
The List abstract data type (ADT) which is backed by an array and uses dynamic resizing and amortized analysis
Recursive methods that are applied to the array and ArrayList data structures
Module 2: LinkedLists
The Singly LinkedList data structure, its implementation, methods and time complexity
The use of the iterable interface and recursive methods in LinkedLists
Creating variations of LinkedLists such as Doubly-Linked and Circularly-Linked
Module 3: Stacks, Queues, and Deques
The Stack ADT based on the last-in, first-out principle, and its implementations using Arrays and LinkedLists
The Queue ADT based on the first-in, first-out principle, and its implementations using Arrays and LinkedLists
Creating variations of Stacks and Queues such as Priority Queues and Deques