This page presents the “modules”, or the topics that are covered in this course.
Click on the tile associated with a module to go to a page containing that module’s contents.
Overview of ICS 211, and some simple initial tasks to get oriented and ready for the course.
1/8 - 1/12
Review of the Java programming language.
1/12 - 1/18
Object-Oriented Programming and Java Class Hierarchy.
1/19 - 1/25
Introduction to Big-O notation and code analysis.
1/26 - 2/1
Introduction to sorting data.
Introduction to the List Abstract Data Type.
2/2 - 2/22
Demonstrate your mastery of OOP, Big O, and Lists.
2/23
Introduction to the Stack ADT.
3/2 - 3/8
Introduction to the Queue and Dequeue ADT.
3/9 - 3/15
Introduction to Recursive algorithms and thinking.
3/16 - 3/22
Demonstrate your mastery of Stacks, Queues, recursion and Trees.
3/23
Introduction to the Tree ADT.
4/6 - 4/20
Introduction to the Hash Table or Map ADT.
4/20 - 4/26
Introduction to more complex sorting algorithms.
4/27 - 5/3
Demonstrate your mastery of all the material in this course.
5/7