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/11 - 1/12

2. Java Review

Review of the Java programming language.

1/13 - 1/19

3. OOP and Class Hierarchies

Object-Oriented Programming and Java Class Hierarchy.

1/16 - 1/22

4. Big-O Notation

Introduction to Big-O notation and code analysis.

1/23 - 1/29

5. Simple Sorting Algorithms

Introduction to sorting data.

1/23 - 1/29

6. Lists

Introduction to the List Abstract Data Type.

1/30 - 2/19

7. Midterm Exam 1

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

2/24

8. Stacks

Introduction to the Stack ADT.

2/27 - 3/5

9. Queues

Introduction to the Queue and Dequeue ADT.

3/6 - 3/12

10. Recursion

Introduction to Recursive algorithms and thinking.

3/20 - 3/26

11. Midterm Exam 2

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

3/31

12. Trees

Introduction to the Tree ADT.

4/2 - 4/15

13. Hash Tables

Introduction to the Hash Table or Map ADT.

4/16 - 4/22

14. Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

4/23 - 4/29

15. Final Exam

Demonstrate your mastery of all the material in this course.

5/14