ICS 211 | Modules

For any module not marked as “Coming Soon”, click on it to go to a page containing details.

1. Welcome to ICS 211

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

1/10 - 1/11

Mon, Jan 10 - Wed, Jan 12

2. RadGrad

RadGrad: Developing awesome computer scientists, one graduate at a time.

Sat, Feb 12 - Sat, Feb 19

3. Java Review

Review of the Java programming language.

1/12 - 1/18

Wed, Jan 12 - Wed, Jan 19

4. OOP and Class Hierarchies

Object-Oriented Programming and Java Class Hierarchy.

1/15 - 1/21

Sat, Jan 15 - Sat, Jan 22

5. Big-O Notation

Introduction to Big-O notation and code analysis.

1/22 - 1/28

Sat, Jan 22 - Sat, Jan 29

6. Simple Sorting Algorithms

Introduction to sorting data.

1/22 - 1/28

Sat, Jan 22 - Sat, Jan 29

7. Lists

Introduction to the List Abstract Data Type.

1/29 - 2/18

Sat, Jan 29 - Sat, Feb 19

8. Midterm Exam 1

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

2/23

Sat, Feb 19 - Sat, Feb 26

9. Stacks

Introduction to the Stack ADT.

2/26 - 3/4

Sat, Feb 26 - Sat, Mar 5

10. Queues

Introduction to the Queue and Dequeue ADT.

3/6 - 3/12

Sat, Mar 5 - Sat, Mar 12

11. Recursion

Introduction to Recursive algorithms and thinking.

3/19 - 3/25

Sat, Mar 19 - Sat, Mar 26

12. Midterm Exam 2

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

3/30

Sat, Mar 26 - Sat, Apr 2

13. Trees

Introduction to the Tree ADT.

Sat, Apr 2 - Sat, Apr 16

14. Hash Tables

Introduction to the Hash Table or Map ADT.

4/16 - 4/22

Sat, Apr 16 - Sat, Apr 23

15. Complex Sorting Algorithms

Introduction to more complex sorting algorithms.

4/23 - 4/29

Sat, Apr 23 - Sat, Apr 30

16. Final Exam

Demonstrate your mastery of all the material in this course.

5/13

Sat, Apr 30 - Sat, May 14

Modules Topics covered in this class