Skip to content

emabuza026j-maker/akani-sons

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 

Repository files navigation

akani-sons

Welcome to my exploration of the TaskManager project! This page is a guide to understanding how tasks are organized, prioritized, and managed through intelligent algorithms. Here, you’ll find clear explanations of key features, insights into how tasks are scored and sorted, and reflections on the thought process behind each solution. Whether you’re curious about task management logic or just want to see how complex systems are analyzed step by step, this page gives a detailed and approachable look into the project.

TaskManager Algorithm Project

A practical exercise demonstrating a task management algorithm with Python, including step-by-step explanation, AI analysis, and reflection.


Algorithm Chosen

Task Priority Sorting Algorithm

This algorithm sorts tasks based on priority from highest to lowest, helping a task management system show the most important tasks first.


Problem Overview

In a task management system, tasks have different priorities such as High, Medium, or Low.
To ensure users see the most important tasks first, this algorithm sorts the task list by priority.
It can also filter tasks based on specific criteria like due date or category.


Step-by-Step Algorithm

  1. Receive the list of tasks
    Each task has a name, priority, and optional deadline.

  2. Assign numeric values to priorities

    • High → 3
    • Medium → 2
    • Low → 1
  3. Compare tasks based on priority values
    Higher numbers come first.

  4. Sort the task list
    Use a sorting function or custom comparison to reorder tasks.

  5. Return the sorted list
    The output is a list with highest priority tasks at the top.


Example

Input

Task Manager Code Exploration

Algorithm / Feature Explored

Calculate Task Priority Score

This algorithm assigns a numeric score to each task based on priority and urgency, helping the system sort tasks from most to least important.


1️⃣ Function / Class Identification

  • File: calculate_priority_score.py
  • Function Name: calculate_task_score
  • Purpose: Computes a numeric score for each task based on its priority and due date.

2️⃣ AI Explanation

AI Plain English Description:
The calculate_task_score function takes a task, assigns a numeric value based on priority (High=3, Medium=2, Low=1), calculates urgency based on the number of days until the due date, combines these into a final score, and returns it.

Your Interpretation:
The function makes it easy to rank tasks by importance and urgency so that the most critical tasks appear at the top of the list.


3️⃣ Step-by-Step Walkthrough

AI Step-by-Step Breakdown:

  1. Receive a task object containing priority and optional due_date.
  2. Assign a numeric value to the priority (High=3, Medium=2, Low=1).
  3. Calculate urgency: fewer days until due date → higher urgency score.
  4. Add priority score and urgency score to compute final task score.
  5. Return the task score.

Optional Diagram:

About

Turning ideas into working software with Python. Always building.

Resources

Stars

1 star

Watchers

0 watching

Forks

Releases

No releases published

Packages

 
 
 

Contributors