Computer Science 2 courses vary widely, so it might also be useful to consider activities designed for Computer Science 1 and/or Algorithms and Computation.
Clif Kussmaul - Computer Science 2 - Java
These activities were developed by Clif Kussmaul for Computer Science 2 in Java.
For sample versions, click here. For full access, contact Clif Kussmaul.
| Stage | Activity Name |
|---|---|
| 3: Refined | Code Reading I: Notice and Focus |
| 3: Refined | Code Reading II: Functions |
| 2: Piloted | Code Reading III: Files |
| 3: Refined | Java Style |
| 3: Refined | Java Types & References |
| 3: Refined | Java Unit Testing I: Concepts; II: JUnit & Strategies |
| 3: Refined | Java Inheritance I: Concepts; II: Details, III: Interfaces |
| 3: Refined | Java Error Handling I: Strategies; II: Exceptions |
| 3: Refined | Java Files I: Approaches; II: API Classes |
| 3: Refined | Java Generics & Collections |
| 1: Drafted | JDK Math |
| 1: Drafted | JDK Arrays |
| 1: Drafted | JDK ArrayList |
| 1: Drafted | JDK String |
Clif Kussmaul - Algorithms and Computation - Java
These activities were developed by Clif Kussmaul for Computer Science 2 in Java.
For sample versions, click here. For full access, contact Clif Kussmaul.
| Stage | Activity Name |
|---|---|
| 5: Endorsed | Searching in Hi-Lo (listed in Computer Science 0) |
| 3: Refined | Hash Tables: I: Concepts; II: Collisions |
| 3: Refined | (Linked) Lists: I: Abstraction; II: Implementation |
| 3: Refined | Stacks & Queues I: Stacks; II: Queues |
| 3: Refined | Sorting I: Sort & Compare |
| (not yet written) | Sorting II: Simple Sorts |
| 3: Refined | Sorting III: Merge Sort |
| 3: Refined | Sorting IV: Split Sort (Quicksort) |
| 2: Piloted | Sequence Analysis |
| 2: Piloted | Graphs I, II, III |
Tammy VanDeGrift - Computer Science 2 - C/C++
These activities were developed by Tammy VanDeGrift for Computer Science 2 using C/C++.
For full versions, click here.
| Stage | Activity Name |
|---|---|
| 2: Piloted | 01. C Syntax |
| 2: Piloted | 02. C Pointers |
| 2: Piloted | 03. C Arrays and Strings |
| 2: Piloted | 04. C Structs |
| 2: Piloted | 05. C Files |
Tammy VanDeGrift - Algorithms and Computation - C/C++
These activities were developed by Tammy VanDeGrift for Computer Science 2 using C/C++.
For full versions, click here.
| Stage | Activity Name |
|---|---|
| 2: Piloted | 06. Binary Search & Complexity |
| 2: Piloted | 07. Complexity Practice |
| 2: Piloted | 08. Linked Lists |
| 2: Piloted | 09. Stacks |
| 2: Piloted | 10. Queues |
| 2: Piloted | 11. Binary Trees |
| 2: Piloted | 12. Binary Search Trees |
| 2: Piloted | 13. Selection and Insertion Sort |
| 2: Piloted | 14. Quicksort and Mergesort |
| 2: Piloted | 15. Graphs |
| 2: Piloted | 16. DFS and BFS |
| 2: Piloted | 17. Dijkstra |
| 2: Piloted | 18. Hashing |
| 2: Piloted | 19. Collisions |
Peter Drake - Computer Science 2 - Java
Peter Drake is Associate Professor of Computer Science at Lewis and Clark College. These activities were developed for Computer Science 2 as part of the project Learn Java in N Games, which includes other (non-POGIL) activities. The activities are at: http://ljing.org.
| Stage | Activity Name | Notes |
|---|---|---|
| 3: Refined | 01. Shut The Box - arrays. loops, teamwork | EngageCSEdu Engagement Excellence Award |
| 3: Refined | 04. Tic-Tac-Toe - Javadoc, 2D arrays, teamwork | EngageCSEdu |
| 3: Refined | 07. Anagrams - trace calls, JUnit, info processing | EngageCSEdu |
| 3: Refined | 10. Towers of Hanoi - recursion, critical thinking | EngageCSEdu Engagement Excellence Award |
| 3: Refined | 13. Beetle - classes, problem solving | EngageCSEdu Engagement Excellence Award |
| 3: Refined | 16. Pong - objects, UML, communication | |
| 3: Refined | 19. High Scores I - insertion sort, merge sort | |
| 3: Refined | 22. Railyard - stacks, queues, interfaces | |
| 3: Refined | 25. High Scores II - binary search, collections, info processing | |
| 3: Refined | 28. Hex - graphs, depth-first, critical thinking |