Individual seed

Justification for 100% (3.0/3.0) seed based on individual work:

As a group, only 2 of our members were active contributors. The other 2 members were completely inactive and did not contrinute to the success of the project much. However, as an individual, I rallied us together and pushed for active contribution every day leading up to the presentation of the CPT project. In many instances, I called for meetings in order to set definite tasks for every person in the group. In terms of the CPT project, I created the sign up and login features along with adding a new email parameter to our SQLite database. This allows users to enter their email address while creating an account, allowing the application to store the email to be constantly used in the application process for each college. Additionally, I created the welcome page that greeted the users upon visiting the website and allowed them to navigate to the login page. I also created the error pages that redirected the user to the appropriate error page when using the wrong login credentials or trying to navigate to a non-existent subpage.

I created the project ideation issue and the team agile manifesto, which are linked in the project issues below: CollegeApp Scout issues

alt text

Binary bits: A bit is the smallest unit of data that a computer can process and store. A bit state is represented using 1s and 0s as each bit is always in one of two physical states. Usually, all 8 bits are used. However, in some cases, not all bits are required, as seen in Q49:
Internet Protocol (IPv6): The Internet Protocol (IP) is a protocol, or set of rules, for routing and addressing packets of data so that they can travel across networks and arrive at the correct destination. IPv6 is the most recent version of Internet Protocol (IP). It’s designed to supply IP addressing and additional security to support the predicted growth of connected devices in IoT, manufacturing, and emerging areas like autonomous driving.
Algorithm run-times: We can categorize the run time of an algorithm according to how the number of steps increases as the input size increases. According to CollegeBoard, accessing elements 2n times, or 2 times per element, is considered reasonable run-time. Also, accessing elements n^2 times, or n times per element, is considered reasonable run-time. This is seen in Q50, which I got wrong:

Alt text