Both sides previous revision Previous revision Next revision | Previous revision | ||
mt2011f:start [2011/10/05 15:19] Tim Korb |
mt2011f:start [2012/02/20 09:59] (current) |
||
---|---|---|---|
Line 54: | Line 54: | ||
| 7 |Oct 10| [[mt2011f:week7|Teaching Variables and Control Flow]] | AP CS: Arrays and Array Lists | Korb | | | 7 |Oct 10| [[mt2011f:week7|Teaching Variables and Control Flow]] | AP CS: Arrays and Array Lists | Korb | | ||
| 8 |Oct 17| [[mt2011f:week8|Arrays and Loops]] | AP CS: Designing Classes; Interfaces and Polymorphism | Korb | | | 8 |Oct 17| [[mt2011f:week8|Arrays and Loops]] | AP CS: Designing Classes; Interfaces and Polymorphism | Korb | | ||
- | | 9 |Oct 24| [[mt2011f:week9|Object-Oriented Design]] | AP CS: Inheritance; Input/Output and Exception Handling | Korb | | + | | 9 |Oct 24| [[mt2011f:week9|Object-Oriented Design and Interfaces]] | AP CS: Inheritance; Input/Output and Exception Handling | Korb | |
- | | 10 |Oct 31| [[mt2011f:week10|Interfaces and Team Projects]] | AP CS: Object-Oriented Design | Korb | | + | | 10 |Oct 31| [[mt2011f:week10|Collaborative Learning and Team Projects]] | AP CS: Object-Oriented Design | Korb | |
- | | 11 |Nov 07| [[mt2011f:week11|Collaborative Learning and Assessment in CS]] | AP CS: Recursion | Yadav | | + | | 11 |Nov 07| [[mt2011f:week11|Computational Thinking]] | AP CS: Recursion | Yadav | |
| 12 |Nov 14| [[mt2011f:week12|Debugging and Unit Testing]] | AP CS: Sorting and Searching | Korb | | | 12 |Nov 14| [[mt2011f:week12|Debugging and Unit Testing]] | AP CS: Sorting and Searching | Korb | | ||
| -- |Nov 21| Thanksgiving Break | | | | | -- |Nov 21| Thanksgiving Break | | | | ||
- | | 13 |Nov 28| [[mt2011f:week13|AP CS Case Study and AP CS Exam]] | AP CS: GridWorld | Korb| | + | | 13 |Nov 28| [[mt2011f:week13|Assessment, AP CS Case Study, and AP CS Exam]] | AP CS: GridWorld | Korb| |
| 14 |Dec 05| [[mt2011f:week14|Microteaching & Peer Feedback]] | HS Observation (week tbd) | Yadav | | | 14 |Dec 05| [[mt2011f:week14|Microteaching & Peer Feedback]] | HS Observation (week tbd) | Yadav | | ||
Other Topics: | Other Topics: | ||
- | * Teaching Programming: Execution Flow, Variables, Memory | ||
* Teaching Tough Topics: Dynamic Data Structures and Recursion | * Teaching Tough Topics: Dynamic Data Structures and Recursion | ||
* Scratch (including BYOB) | * Scratch (including BYOB) | ||
Line 80: | Line 79: | ||
* //Reflections on the Teaching of Programming//, Jens Bennedsen, Michael Caspersen, and Michael Kolling, Springer Verlag, LNCS 4821, 2008. | * //Reflections on the Teaching of Programming//, Jens Bennedsen, Michael Caspersen, and Michael Kolling, Springer Verlag, LNCS 4821, 2008. | ||
* //Computer Science Unplugged//, Tim Bell, Ian Witten, and Mike Fellows, 2006. Available at http://www.csunplugged.org/. | * //Computer Science Unplugged//, Tim Bell, Ian Witten, and Mike Fellows, 2006. Available at http://www.csunplugged.org/. | ||
- | * //Guide to Computer Science Education//, Orit Hazzan, Tami Lapidot and Noa Ragonis, Springer Verlag, to be published in 2011. | + | * //Guide to Teaching Computer Science//, Orit Hazzan, Tami Lapidot and Noa Ragonis, Springer Verlag, 2011. |
* Selected papers from the proceedings of the annual //ACM Technical Symposium on Computer Science Education//, http://www.sigcse.org/. | * Selected papers from the proceedings of the annual //ACM Technical Symposium on Computer Science Education//, http://www.sigcse.org/. | ||