This shows you the differences between two versions of the page.
Both sides previous revision Previous revision Next revision | Previous revision | ||
mt2011:week9 [2010/11/15 09:38] Aman Yadav |
mt2011:week9 [2011/03/21 21:01] (current) Tim Korb |
||
---|---|---|---|
Line 7: | Line 7: | ||
===== Readings for Class Discussion ===== | ===== Readings for Class Discussion ===== | ||
Required Readings | Required Readings | ||
- | * Ormrod, J. E. (2006). Instructional Strategies | + | * Ormrod, J. E. (2011). Assessment Strategies |
+ | * Nørmark, K., Thomsen, L. L., and Torp, K. (2008) Mini Project Programming Exams. In J. Bennedsen et al. (Eds.): Teaching of Programming (pp. 228–242). Springer | ||
+ | * Bloom's Taxonomy | ||
- | ===== Topics ===== | + | ===== Assignment ===== |
+ | * Pick a topic (loops, recursion, etc) you would like to teach in a high school CS course. Create a homework assignment for students to assess their understanding of that topic. What rubric will you use to assess whether students understood the topic? What level of Bloom's Taxonomy does your assignment target and how will you measure whether students have achieved that level? | ||
===== Lab ====== | ===== Lab ====== | ||
+ | |||
+ | //Note from JTK: See Carl Wieman slide for an example of Java language assessment.// |