Lesson Objectives:

  • LO 1 Understand and implement common algorithm types using Python (Proficiency Level: B)

  • LO 2 Identify how big O notation describes algorithm efficiency (Proficiency Level: 1)

  • LO 3 Identify the uses and efficiency of common sorting algorithms (Proficiency Level: B)

Performance Objectives (Proficiency Level: 3c)

  • Conditions: Given access to (references, tools, etc.):

    • Access to specified remote virtual environment
    • Student Guide and Lab Guide
    • Student Notes

  • Performance/Behavior Tasks:

    • Implement search and sort algorithms in Python
    • Recognize the implications of big O notation
    • Implement common sorting algorithms in Python

  • Standard(s)

    • Criteria: Demonstration: Correctable to 100% in class
    • Evaluation: Students will have 4 hours to complete the timed evaluation consisting of both cognitive and performance components.
    • Minimum passing score is 80%