Algorithms, Data Structures, and Security

This unit develops practical skills in core data structures, fundamental algorithms, and secure application practices while integrating user interfaces, database access, and object-oriented design. Students will apply debugging and testing workflows and learn to evaluate trade-offs to prepare for larger project development in the final unit.

Learning Objectives

• Analyze and compare the time/space trade-offs and appropriate use cases for common data structures including resizable arrays, sets, linked lists, hash tables, deques, trees, and multidimensional arrays
• Apply standard and specialized search and sort techniques (e.g., insertion sort, shell sort, adversarial search, phonetic search, regular-expression search) to implement and optimize problem solutions
• Demonstrate software development practices by designing user interfaces, separating styles, using object-oriented decomposition, performing database access, and employing debugging and testing tools (breakpoints, stepping, watches, and unit tests)
• Evaluate basic cybersecurity concepts and implement secure coding practices, including symmetric/asymmetric encryption fundamentals, secure storage/access patterns, and ethical considerations when handling sensitive data