python - Algorithms - Part I

KSATs: A0087, A0093, K0045, K0046, K0047, K0049, K0132, K0133, K0134, K0135, K0136, K0137

Measurement: Written, Performance

Lecture Time:

Demo/Performance Time:

Instructional Methods: Informal Lecture & Demonstration/Performance

Multiple Instructor Requirements: 1:8 for Labs

Classification: UNCLASSIFIED

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%

References

  1. https://github.com/TheAlgorithms/Python/tree/master/data_structures
  2. https://github.com/TheAlgorithms/Python/tree/master/searches
  3. https://github.com/TheAlgorithms/Python/tree/master/sorts
  4. https://realpython.com/sorting-algorithms-python/
  5. https://stackabuse.com/sorting-algorithms-in-python/
  6. https://www.tutorialspoint.com/python_data_structure/python_big_o_notation.htm
  7. https://www.tutorialspoint.com/python_data_structure/python_sorting_algorithms.htm