Lesson Objectives:

  • LO 1 Identify and implement advanced data structures in Python (Proficiency Level: B)
    • MSB 1.1 Identify types and uses of linked lists in Python (Proficiency Level: B)
    • MSB 1.2 Identify queue and stack structures in Python (Proficiency Level: B)
    • MSB 1.3 Identify the use cases for tree structures in Python (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 linked lists in Python
    • Use stack functions in Python
    • Implement binary tree traversal 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%