Modules Topics covered in this class.

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.

1. Welcome to ICS 211

Overview of ICS 211, and some simple initial tasks to get oriented and ready for the course.

1/9 - 1/10

2. Java Review

Review of the Java programming language.

1/11 - 1/17

3. OOP and Class Hierarchies

Object-Oriented Programming and Java Class Hierarchy.

1/13 - 1/19

4. Big-O Notation

Introduction to Big-O notation and code analysis.

1/20 - 1/26

5. Simple Sorting Algorithms

Introduction to sorting data.

1/20 - 1/26

6. Lists

Introduction to the List Abstract Data Type.

1/27 - 2/16

7. Midterm Exam 1

Demonstrate your mastery of OOP, Big O, and Lists.

2/22

8. Stacks

Introduction to the Stack ADT.

2/24 - 3/2

9. Queues

Introduction to the Queue and Dequeue ADT.

3/3 - 3/9

10. Recursion

Introduction to Recursive algorithms and thinking.

3/10 - 3/16

11. Midterm Exam 2

Demonstrate your mastery of Stacks, Queues, recursion and Trees.

3/22

12. Trees

Introduction to the Tree ADT.

3/24 - 4/13

13. Hash Tables

Introduction to the Hash Table or Map ADT.

4/14 - 4/20

14. Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

4/21 - 4/27

15. Final Exam

Demonstrate your mastery of all the material in this course.

5/8