Download
cs principles lesson writing guide n.
Skip this Video
Loading SlideShow in 5 Seconds..
CS Principles Lesson Writing Guide PowerPoint Presentation
Download Presentation
CS Principles Lesson Writing Guide

CS Principles Lesson Writing Guide

107 Views Download Presentation
Download Presentation

CS Principles Lesson Writing Guide

- - - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

  1. CS Principles Lesson Writing Guide

  2. Themes, values, pedagogy

  3. Themes and Values • Equity, Access, Diversity • Creative Engagement • Authenticity – Real World • Active – not passive • Computational Thinking • Appeal through content and pedagogy!

  4. CS P Pedagogy Ideas • Inquiry • Peer Instruction • Paired Work/Programming • Intentional Method • Flipped Model

  5. 8 Steps to a CSP Lesson

  6. 8 Steps to a CSP Lesson • Content: What do they need to know? • Computational thinking: What do they need to learn to do? • Evaluation: How do I confirm they learned it? (Start with end in mind) • Activity: How do they show they learned it? • Instruction: How do they get to the point of being successful? • Resources: What do others need to implement this lesson? • Misc: Wrapping up the lesson doc • Reflection: Was this a good lesson?

  7. Lesson Plan Doc • Title • Time • Prior Knowledge • Overview • Objectives • Guiding Questions • Resources • Lesson Outline • Lesson Instructions • Assessment, Rubrics • Standards

  8. Order of Construction • Standards • Objectives • Guiding Questions • Assessment, Rubrics • Lesson Outline • Lesson Instructions • Resources • Title • Prior Knowledge • Overview • Time

  9. What do they need to know? • Pick Learning Objective, Essential Knowledge Statement, and CSTA standard • Cover many in the same lesson experience • Craft Essential/Guiding Question(s) • What question(s) need to be answered to lead a student to the essential knowledge statements? • Example: • EK 4.1.1.a Sequencing, selection, iteration, and recursion are building blocks of algorithms. • Selection uses a Boolean condition to determine which of two parts of an algorithm are used. • EQ: How are different instructions in an algorithm selected?

  10. What do they need to learn to do? • Computational thinking • Identify the skills/practices • Come from the EK and EQ • Example: • EK 4.1.1.a Sequencing, selection, iteration, and recursion are building blocks of algorithms. • Selection uses a Boolean condition to determine which of two parts of an algorithm are used. • EQ: How are different instructions in an algorithm selected? • P2: Developing computational artifacts • Cc. Use appropriate algorithmic and information- management principles.

  11. How do I confirm they learned? • Create Summative Assessment idea • Examples: Project, Essay, Test (selected response, short answer) • How will they hand in the work? • Labeled screenshots that connect to rubric • Electronically? Self-grade/Peer-reviewed? • Create rubric, exemplar, or answer key first (or in conjunction with handout)

  12. How do they show they learned? • Create the assessment handout • Provide links to extra resources

  13. How do they get to be successful? • Lesson Outline • Lesson Details • Teaching strategies • Activities (Handouts) • Formative Assessment – Checking for understanding

  14. What do others need to teach this? • Materials – Software, websites • Content Support – Links, Docs, Textbook references Title, Summary • Title • Summary – short paragraph

  15. Lesson Evaluation • Can I imagine what the students create? • Do the assessments match the CSP objectives? • Does the lesson appeal to a wide audience? • Is my pedagogy tuned to the content and is it engaging?