Presentation: Master of One

Group Formation

1. Group Size:
   Form groups of 5 students.

Individual Responsibilities

1. Research and Algorithm Assignment:
   Each student is responsible for researching and presenting one unique algorithm.

   • Algorithm Selection:
     Example algorithms include: Sorting algorithms (e.g., QuickSort, MergeSort), Graph algorithms (e.g., Dijkstra's, BFS), Dynamic Programming (e.g., Knapsack problem), and more.

   • Presentation Content:
     Each student’s presentation must include the following key areas:

     • Background:
       Provide a brief history and context of the algorithm.
     • Use Case:
       Explore a real-world application where this algorithm is commonly used.
     • How It Works:
       Explain the key principles and step-by-step process behind the algorithm.
     • Time/Space Complexity:
       Discuss the algorithm's efficiency in terms of time and space, using Big O notation where applicable.
     • Advantages/Disadvantages:
       Highlight the strengths and weaknesses of the algorithm.

   • Demonstration:
     If applicable, include a simple code demonstration to show the algorithm in action.

     • Use Replit and provide a link so that the audience can try the code in real-time.

Presentation Guidelines

1. Slide Creation:

   • Each student must create a set of slides covering their assigned topics.
   • Use visuals, diagrams, and examples to help explain the algorithm.
   • Ensure consistency in the slide format for a cohesive group presentation.

2. Time Allocation:

   • Each student should aim for a 10-minute presentation, ensuring balanced time for each algorithm.
   • Be concise but informative.

3. Q&A Session:

   • After each presentation, allocate time for a brief Q&A session. This will encourage engagement and allow for clarification.

4. Final Collation:

   • Merge all individual slides into a single presentation deck.
   • Ensure a logical flow between each section and that transitions between topics are smooth.