Trio Issues: Vivian, Sri, Aliya

[aliyatang]

Roles

Technical Lead / DevOps Lead: Sri Kotturi (guidance on technical tasks, deployment, code starting) - Review Topics Frontend Developer: Vivian Ni (frontend coding for project) - Procedures Backend Developer: Aliya Tang (backend coding for project) - Selections

Group Responsibilities

The primary reason for this trio is to create the format for the lessons in our project. This includes creating a sort of blueprint for including different points in College Board materials, creating reasonable but engagingly challenging interactions for students, and ensuring the length of the lesson is within the bounds of a single class period.

The comments below may be utilized for relevant communication and organization.

[SRIHITAKOTT1213]

Sri's Lesson Plan:

• There will be a Black Jack Simulation that will be the "center" of out project.
• I will try to tie my topic to the simulation in some way so that way the entire thing is connected (all of of our topics)
• My topics are 3.1-3.5, which are Variables and Assignment, Data Abstraction, Mathematical Expressions, Strings, and Booleans.
• The Simulation will definitely have all of these so I can use the code from the simulation for the lecture and just modify it so it works in the code cell, independent of any other code. The Boolean lesson might be little hard because the Simulation might not have that, in that case I would have to make my own.
• I might also make other code segments that relate to the topic just because there needs to be than one example, and only one piece of code from the Simulation should be enough to tie into the simulation piece.

[aliyatang]

Conditionals, Nested Conditionals, Binary Search (Selection)

[vivianknee]

The Plan

Lesson 1: Introduction to Algorithms

Objectives:

• Define what an algorithm is and why they are important in computer science.
• Understand the basic components of an algorithm.
• Create and analyze simple algorithms.

Activities:

• Introduce the concept of an algorithm, providing examples such as a recipe or directions to a location.
• Discuss the key components of an algorithm, including input, output, control structures, and computation.
• Work through a few examples of simple algorithms, such as finding the maximum value in a list or sorting a list of numbers.

Lesson 2: Calling and Developing Procedures

Objectives:

• Understand the benefits of using procedures in programming.
• Understand how to define and call procedures in a program.
• Develop procedures for specific tasks.

Activities:

• Introduce the concept of procedures and discuss their benefits, such as reducing code duplication and increasing code readability.
• Discuss how to define and call procedures in a program using examples.
• Have students work through a few examples of developing procedures for specific tasks, such as finding the length of a string or calculating the area of a circle.

Lesson 3: Algorithmic Efficiency

Objectives:

• Understand the importance of algorithmic efficiency.
• Identify ways to improve the efficiency of an algorithm.
• Analyze the time complexity of an algorithm.

Activities:

• Introduce the concept of algorithmic efficiency and why it is important in programming.
• Discuss ways to improve the efficiency of an algorithm, such as reducing the number of operations or using more efficient data structures.
• Have students work through a few examples of improving the efficiency of an algorithm, such as using a binary search instead of a linear search.

Possible Hacks

• Have students create their own algorithms for simple tasks, such as finding the average of a list of numbers or searching for a specific value in a list.
• Ask students to create their own procedures for tasks such as calculating the perimeter of a rectangle or checking if a number is prime.