Topic 04

Algorithms and Data Structures

Lecture Material

• Time Complexity, Big O, Space Complexity: html, notebook

  • In-Class Activity - Time Complexity, Big O, Space Complexity - Practice: html, notebook

• Searching, sorting, hash tables: html, notebook

  • In-Class Activity - Searching, sorting, hash tables - Practice: html, notebook

• Recursive Algorithms: html, notebook

  • Image Folder: img.zip

  • In-Class Activity - Recursive Algorithms - Practice: html, notebook

• Recursive Data Structures: html, notebook

  • In-Class Activity - Recursive Data Structures - Practice: html, notebook

• Graphs: html, notebook

  • In-Class Activity - Graphs - Practice: html, notebook

Problem Set

• In groups (up to 3 members), conclude Recursive Data Structures and Graphs In-Class Activity (links and notebooks above).

• Extra Credit Opportunity: Within the Graphs In-Class Activity, there are optional exercises available. Should you choose to complete and submit these exercises successfully, up to 3% will be added to your final grade as a recognition of your additional effort. This is an excellent opportunity to enhance your understanding and improve your overall grade!

Recommended Readings/Videos

• Introduction to Big O Notation and Time Complexity (video)

• Binary search video - watch until 31:00.

• Graph traversals video

• brilliant.org on Graph Theory

• brilliant.org on Traversals

• brilliant.org on BSTs

• Data Structures and Algorithms in Python

• Algorithms

• Introduction to Algorithms

• Algorithm Design

Additional Resources

• P vs. NP and the Computational Complexity Zoo (video)

• Lecture Slides for Algorithm Design

• Visualizing Algorithms

• Professor Mike Gelbart (videos)

• Professor Scott Aaronson Blog

• Python: Recursion - Exercises, Practice, Solution

• StackOverflow post on generators

• Linear programming and discrete optimization with Python using PuLP

• Dynamic programming

• 500 Data Structures and Algorithms practice problems and their solutions