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/20 - 8/21

2. Java Review

Review of the Java programming language.

8/22 - 8/28

3. OOP and Class Hierarchies

Object-Oriented Programming and Java Class Hierarchy.

8/25 - 8/31

4. Big-O Notation

Introduction to Big-O notation and code analysis.

9/1 - 9/7

5. Simple Sorting Algorithms

Introduction to sorting data.

9/1 - 9/7

6. Lists

Introduction to the List Abstract Data Type.

9/8 - 9/28

7. Midterm Exam 1

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

10/3

8. Stacks

Introduction to the Stack ADT.

10/6 - 10/12

9. Queues

Introduction to the Queue and Dequeue ADT.

10/12 - 10/19

10. Recursion

Introduction to Recursive algorithms and thinking.

10/20 - 10/26

11. Midterm Exam 2

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

10/31

12. Trees

Introduction to the Tree ADT.

11/3 - 11/16

13. Hash Tables

Introduction to the Hash Table or Map ADT.

11/17 - 11/23

14. Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

11/24 - 11/30

15. Final Exam

Demonstrate your mastery of all the material in this course.

Section 1: 12/14 Section 2: 12/10