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.

8/22

2. Java Review

Review of the Java programming language.

8/24 - 8/30

3. OOP and Class Hierarchies

Object-Oriented Programming and Java Class Hierarchy.

8/27 - 9/2

4. Big-O Notation

Introduction to Big-O notation and code analysis.

9/3 - 9/9

5. Simple Sorting Algorithms

Introduction to sorting data.

9/3 - 9/9

6. Lists

Introduction to the List Abstract Data Type.

9/10 - 9/30

7. Midterm Exam 1

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

10/05

8. Stacks

Introduction to the Stack ADT.

10/8 - 10/14

9. Queues

Introduction to the Queue and Dequeue ADT.

10/15 - 10/21

10. Recursion

Introduction to Recursive algorithms and thinking.

10/22 - 10/28

11. Midterm Exam 2

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

11/02

12. Trees

Introduction to the Tree ADT.

11/5 - 11/18

13. Hash Tables

Introduction to the Hash Table or Map ADT.

11/19 - 11/25

14. Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

11/26 - 12/2

15. Final Exam

Demonstrate your mastery of all the material in this course.

12/16