Developed and Enhanced Activity Selection Algorithms

1 min read

📅 2024-04-17 — Session: Developed and Enhanced Activity Selection Algorithms

🕒 00:10–03:00
🏷️ Labels: Activity Selection, Algorithm Design, Verbose Output, Visualization, Python, Education
📂 Project: Dev
⭐ Priority: MEDIUM

Session Goal: The session aimed to design and implement various activity selection algorithms using different techniques, including backtracking, dynamic programming, and greedy approaches.

Key Activities:

  • Mapped exercises to Chapter 5 of Kleinberg and Tardos’s Algorithm Design, focusing on divide and conquer techniques.
  • Implemented a verbose version of the BacktrackingSelector class to provide a clear visual representation of the decision-making process.
  • Enhanced the DynamicProgrammingSelector class with verbose outputs to illustrate the dynamic programming algorithm’s decision-making.
  • Developed a verbose implementation of the GreedySelector class to demonstrate the greedy algorithm’s decision-making process.
  • Utilized matplotlib for visualizing the activity selection process on a timeline.

Achievements:

  • Successfully implemented and enhanced three versions of the activity selection algorithm, providing educational insights through verbose outputs.
  • Created visualizations to aid in understanding the algorithm’s operations.

Pending Tasks:

  • Further testing and optimization of the implemented algorithms to ensure efficiency and correctness.
  • Integration of the visualizations with the algorithm implementations for a comprehensive educational tool.

Graph View

Backlinks