January 2024
M Tuesday W Thursday F

Class:
Class Rescheduled for Inclement Weather
Work on Project 1 - Menu
10 

Module 0: Orientation & Review
11 
12 

15 

Deadline for full refund; Module 1: Generic Type and Comparator Class
16 
Before Class:
Welcome and Syllabus Quiz (in CougarVIEW, 3 attempts allowed)
Generic Type
Generics (The Java Tutorials)
Comparable and Comparator
Register for a free codePost.io account

Class:
Enumeration Types
Generic Types (exercises)
Comparable versus Comparator (exercises)
17 

Module 2: Search Algorithms & Computational Complexity
18 
Due:
Project 1 - Menu
Before Class:
OpenDSA textbook icon Searching I: 7.1
Linear and Binary Search (optional)
Comparing Searching Algorithms Animations (optional)
OpenDSA textbook icon Algorithm Analysis: 8.1-8.3

Class:
Comparable versus Comparator (exercises)

Class Notes
Linear and Binary Search
Algorithm Analysis (exercises)
Computational Complexity of Search Algorithms (exercises)
19 

22 

23 
24 

25 
Before Class:
OpenDSA textbook icon Algorithm Analysis: 8.7-8.15
Algorithm Analysis: Case Study (9:26)

Class:
CodeWorkout Registration
Algorithm Analysis (exercises, table of values)
Class Notes
26 

29 

Module 3: Linked Lists, Stacks & Queues
30 
Due:
Algorithm Analysis Homework (CougarVIEW Quiz [not-automatically graded] with unlimited time and unlimited attempts)
Before Class:
OpenDSA textbook icon Linear Structures: 9.1 - 9.7

Class:
Linked Lists (exercises)

Due:
CodeWorkout Big Oh Exercises
31 


February 2024
M Tuesday W Thursday F
Before Class:
OpenDSA textbook icon Linear Structures: 9.8 - 9.11

Class:
Doubly-Linked Lists (exercises)



Class:
Stacks (exercises)
Queues (exercises)
Class Notes

Due:
Stacks Practice Assignments
Due:
Two Exam 1 Preparation Game Questions (a CougarVIEW Quiz)

12 

13 
14 

15 
Class:
Presentation by the Career Center
Exam 1 (topics)
16 

19 

Module 4: Recursion
20 
College Career Fair (SCCT Lobby 10 AM - 2 PM)
Before Class:
OpenDSA textbook icon Recursion: 10.1-10.5
Recursion

Class:
Recursion (exercises)
21 

22 
Before Class:
OpenDSA textbook icon Recursion: 10.6-10.9

Class:
Project 3 - Recursive Maze Solver Demo
Recursion (exercises)
Making Change

Due:
Self-review recursion problems: https://codingbat.com/java/Recursion-1
CodeWorkout Recursion Exercises
23 

26 

Module 5: Trees
27 
Before Class:
OpenDSA textbook icon Binary Trees: 12.1 - 12.6 (Note: Definitions of level and height are different than used in this course)
Trees: Terminology A (12:07) (use these definitions of level and height for this course)
Trees: Terminology B (4:33)
Tree Traversal Methods (optional)
OpenDSA textbook icon Binary Trees: 12.7 - 12.10

Class:
Binary Trees Intro Game
Binary Tree Traversals (exercises)
28 

29 
Before Class:
OpenDSA textbook icon Binary Trees: 12.11 - 12.15
Trees: Efficiency (9:12)

Class:
Binary Tree Traversals (exercises)
Binary Search Trees (exercises)

Due:
Project 3 - Recursive Maze Solver

March 2024
M Tuesday W Thursday F
Deadline to Withdraw with a WP


Before Class:
Trees Intro Homework (a CougarVIEW Quiz)
OpenDSA textbook icon Search Structures: 26.1 - Balanced Trees
OpenDSA textbook icon Search Structures: 26.2 - The AVL Tree (see also AVL Tree Visualization)

Class:
Binary Search Trees (exercises)
Balanced Trees
AVL Trees (exercises, handout)


11 

Module 6: Heaps
12 
13 

14 
Class:
Exam 2 Preparation Game (on Teams) (topics)

Due:
BST Practice Exercises
15 

18 
Spring Break
19 
Spring Break
20 
Spring Break
21 
22 
Spring Break
Seniors can Register
25 

Juniors can Register
26 
Class:
Exam 2 (topics)
Sophomores can Register
27 

Freshman can Register; Module 7: Sorting Algorithms
28 
29 


April 2024
M Tuesday W Thursday F

Before Class:
OpenDSA textbook icon Sorting: 13.8 - 13.11
Mergesort (16:17)
Quicksort (16:52)
OpenDSA textbook icon Sorting: 13.12
Heapsort (6:12)

Class:
Sorting Algorithms (exercises)



Module 8: Hashing
Before Class:
OpenDSA textbook icon Hashing: 15.1 - 15.4
Hashing: Introduction (11:54)
Hashing: Handling Collisions (14:53)
Hashing Basics Pre Quiz

Class:
Hash Table Basics (exercises)
  1. Hash Functions

Resolving Collisions (exercises)
  1. Open Hashing / Separate Chaining
  2. Closed Hashing / Open Addressing


Due:
Sorting Homework (CougarVIEW quiz with 3 attempts, no time limit and questions available in feedback)
10 

11 
Before Class:
OpenDSA textbook icon Hashing: 15.5 - 15.10
Hashing: Rehashing (1:46)
Hashing: Efficiency (9:27)
Hashing Efficiency Quiz

Class:
Resolving Collisions (exercises)
  1. Open Hashing / Separate Chaining
  2. Closed Hashing / Open Addressing

Rehashing (exercises)
Efficiency of Hashing (exercises)
12 

15 

Module 9: Graphs
16 
Before Class:
OpenDSA textbook icon Graphs: 19.1-19.3
Graph Traversals (16:20)
Graphs and traversal methods (optional)

Class:
Graphs Intro (exercises) (terminology)
Graph Traversals (exercises)

Due:
17 

18 
Before Class:
OpenDSA textbook icon Graphs: 19.4-19.5
Graphs: Topological Sorting (3:58)
Graphs: Topological Sorting Example (4:25)
Graphs: Shortest Paths (9:01)

Class:
Graph Traversals (exercises)
Topological Sorting (exercises)
Shortest Path (exercises)
19 

22 

23 
24 

Last Day of Class
25 
Class:
Final Exam Preparation Game (topics)
26 

29 

Course Evaluation Surveys close; Study Day
30 


May 2024
M Tuesday W Thursday F


Final Exam
Final (topics): 8:00 - 10:30 AM in SCCT 407

Legend

Read
Open DSA textbook icon Open DSA sections
Watch video
Assignment (submit through CougarVIEW)
Project (submit through CougarVIEW)
CougarVIEW Quiz
CodeWorkout*
Exam / Test