M | Tuesday | W | Thursday | F |
---|---|---|---|---|
8
|
9
|
10
|
Module 0: Orientation & Review
11
Before Class:
Syllabus Programming Tutorials: 3.2 - Parsing Command Line Parameters In Your Program Design I: 4.1 - Abstract Data Types Design I: 4.2 - Introduction to Object Oriented Programming Arrays of basic types (1 of the following): Arrays of Objects (up to Section 12.6) ArrayLists of Objects Enumeration Type Class: Introductions Review Game:
Enumeration Types Due: Self-review array problems: CodingBat: Array 1 and CodingBat: Array 2 |
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: Searching I: 7.1 Linear and Binary Search (optional) Comparing Searching Algorithms Animations (optional) 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
Before Class:
Algorithm Analysis: 8.4-8.6 Algorithm Analysis: Growth Rates (16:46) Introduction to Big-O notation (optional) Verify CodeWorkout account Class: Algorithm Analysis (exercises) |
24
|
25
Before Class:
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: Linear Structures: 9.1 - 9.7 Class: Linked Lists (exercises) Due: CodeWorkout Big Oh Exercises |
31
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
|
|||
5
|
6
Before Class:
Linear Structures: 9.12 - 9.14 Class: Stacks (exercises) Class Notes Due: Lists Practice Assignments |
7
|
8
Class:
Stacks (exercises) Queues (exercises) Class Notes Due: Stacks Practice Assignments Due: Two Exam 1 Preparation Game Questions (a CougarVIEW Quiz) |
9
|
12
|
13
|
14
|
15
|
16
|
19
|
Module 4: Recursion
20
College Career Fair (SCCT Lobby 10 AM - 2 PM)
Before Class: Recursion: 10.1-10.5 Recursion Class: Recursion (exercises) |
21
|
22
Before Class:
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:
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) Binary Trees: 12.7 - 12.10 Class: Binary Trees Intro Game Binary Tree Traversals (exercises) |
28
|
29
Before Class:
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 |
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
Before Class:
Sorting: 13.8 - 13.11 Mergesort (16:17) Quicksort (16:52) Sorting: 13.12 Heapsort (6:12) Class: Sorting Algorithms (exercises) |
3
|
4
Before Class:
Sorting: 13.13 - 13.17 Comparing Sorting Algorithms Animations Comparing Sorting Animations Linear Sorts (11:33) External Sorting (11:54) (Optional) Class: Sorting Algorithms (exercises) |
5
|
8
|
Module 8: Hashing
9
Before Class:
Hashing: 15.1 - 15.4 Hashing: Introduction (11:54) Hashing: Handling Collisions (14:53) Hashing Basics Pre Quiz Class: Hash Table Basics (exercises)
Resolving Collisions (exercises)
Due: Sorting Homework (CougarVIEW quiz with 3 attempts, no time limit and questions available in feedback) |
10
|
11
Before Class:
Hashing: 15.5 - 15.10 Hashing: Rehashing (1:46) Hashing: Efficiency (9:27) Hashing Efficiency Quiz Class: Resolving Collisions (exercises)
Rehashing (exercises) Efficiency of Hashing (exercises) |
12
|
15
|
Module 9: Graphs
16
Before Class:
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:
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
Before Class:
Graphs: 19.6-19.8 Graphs: Spanning Trees (11:25) Graphs: Circuits (11:40) A Guide from Google Engineers (Graphs: Your Path to Success) (42:45) (Optional) Class: Topological Sorting (exercises) Shortest Path (exercises) Circuits (exercises) Class Notes Due: Due: Optional Project 4 - Stock Price Tracker (using Hash Tables) |
24
|
Last Day of Class
25
Class:
Final Exam Preparation Game (topics) |
26
|
29
|
Course Evaluation Surveys close; Study Day
30
|
M | Tuesday | W | Thursday | F |
---|---|---|---|---|
1
|
2
|
Final Exam
3
Final (topics): 8:00 - 10:30 AM in SCCT 407
|