python - Data Structures - Part I

KSATs: K0015, K0045, K0055, K0057, K0058, K0060, K0120, K0203, K0751, K0752, K0772, S0078

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 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%

References

1. https://realpython.com/how-to-implement-python-stack/
2. https://realpython.com/linked-lists-python/
3. https://www.geeksforgeeks.org/binary-tree-data-structure/
4. https://www.geeksforgeeks.org/linked-list-set-1-introduction/
5. https://www.geeksforgeeks.org/queue-in-python/
6. https://www.geeksforgeeks.org/stack-in-python/
7. https://www.openbookproject.net/thinkcs/python/english2e/ch21.html
8. https://www.tutorialspoint.com/python_data_structure/python_binary_tree.htm