Earning Criteria

• Earners of this badge have successfully completed 4 mini projects listed below.
• In mini project 1, earners of this badge used Python to compute Mersenne numbers, using the Lucas-Lehmer test to identify Mersenne numbers that are prime. They had to use Python data structures and core programming principles such as for loops to implement their solution. Further, they had to implement the Sieve of Eratosthenes as a faster solution for checking if numbers are prime, learning about the importance of algorithm time complexity.
• In mini project 2, earners of this badge used Object Oriented Programming to create a class that represents a geometric point. They define methods that describe common operations with points such as adding two points together and finding the distance between two points. Finally, they wrote a K-means clustering algorithm that uses the previous defined point class.
• In mini project 3, earners of this badge used basic Python data structures, functions, and control program flow to answer posed questions over medical data from the British NHS on prescription drugs. They had to use fundamental data wrangling techniques such as joining data sets together, splitting data into groups, and aggregating data into summary statistics.
• In mini project 4, earners of this badge used the Python package pandas to perform data analysis on a prescription drug data set from the British NHS. They answered questions such as identifying what medical practices prescribe opioids at an usually high rate and what practices are prescribing substantially more rare drugs compared to the rest of the medical practices. They used statistical concepts like z-score to help identify the aforementioned practices.