We are using Python. DO NOT USE CONTINUE, BREAK,

Question

We are using Python. DO NOT USE CONTINUE, BREAK, OR SORTED(). also DO NOT IMPORT ANYTHING ELSE. This is the question. I have my own code and plan to submit my own code, but I can’t figure out how to get past the point i am stuck on. Again, even a nudge in the correct direction would be helpful. from typing import List, Tuple, Dict, TextIO def recommend_clubs( person_to_friends: Dict[str, List[str]], person_to_clubs: Dict[str, List[str]], person: str,) –

## This is from Statistics and Probability, Jupyter Project 2 written

Question This is from Statistics and Probability, Jupyter Project 2 written in python. Having trouble with the coding for step 4.. Step 3: Hypothesis Test for the Population Mean (I)A relative skill level of 1420 represents a critically low skill level in the league. The management of your team has hypothesized that the average relative skill level of your team in the years 2013-2015 is greater than 1420. Test this claim using a 5% level of significance. For this test, assume that the population standard deviation for relative skill level is unknown. Make the following edits to the code block below: -Replace jQuery22407530793663682149_1575394441358DATAFRAME_YOUR_TEAMjQuery22404996412957777534_1575394519195 with the name of your team’s dataframe. See Step 2 for the name of your team’s dataframe. -Replace ??RELATIVE_SKILL?? with the name of the variable for relative skill. See the table included in the Project Two instructions above to pick the variable name. Enclose this variable in single quotes. For example, if the variable name is var2 then replace ??RELATIVE_SKILL?? with ‘var2’. -Replace ??NULL_HYPOTHESIS_VALUE?? with the mean value of the relative skill under the null hypothesis.After you are done with your edits, click the block of code below and hit the Run button above.In [3]:import scipy.stats as st # Mean relative skill level of your team mean_elo_your_team = your_team_df[‘elo_n’].mean() print(“Mean Relative Skill of your team in the years 2013 to 2015 =”, round(mean_elo_your_team,2)) # Hypothesis Test # —- TODO: make your edits here —- test_statistic, p_value = st.ttest_1samp(your_team_df[‘elo_n’], 1420) print(“Hypothesis Test for the Population Mean”) print(“Test Statistic =”, round(test_statistic,2)) print(“P-value =”, round(p_value,4)) Output: Mean Relative Skill of your team in the years 2013 to 2015 = 1440.49 Hypothesis Test for the Population Mean Test Statistic = 4.04 P-value = 0.0001 Step 4: Hypothesis Test for the Population Mean (II)A team averaging 110 points is likely to do very well during the regular season. The coach of your team has hypothesized that your team scored at an average of less than 110 points in the years 2013-2015. Test this claim at a 1% level of significance. For this test, assume that the population standard deviation for relative skill level is unknown. -The dataframe for your team is called your_team_df. -The variable ‘pts’ represents the points scored by your team. -Calculate and print the mean points scored by your team during the years you picked. -Identify the mean score under the null hypothesis. You only have to identify this value and do not have to print it. (Hint: this is given in the problem statement) -Assuming that the population standard deviation is unknown, use Python methods to carry out the hypothesis test. -Calculate and print the test statistic rounded to two decimal places. -Calculate and print the P-value rounded to four decimal places.

## Python : The CNN Money’s Market Movers website (money.cnn.com/data/hotstocks/ )

Question Python : The CNN Money’s Market Movers website (money.cnn.com/data/hotstocks/ ) tracks the most active stocks on a real time basis. Specifically, the most active, the top gainers andtop losers are listed at any instance in time. Write Python scripts that collect the list ofmost actives, gainers and losers from the above website. Next, programs should take the tickersymbols and names of these companies (and categories) and build a csv file (called stocks.csv) withdata about each stock from the website: finance.yahoo.com/quote/AMD?p=AMD

## How can I include an attachment? I need corrections on a flowchart provided.

Question How can I include an attachment? I need corrections on a flowchart provided. Suppose matinee movie tickets are priced at $5.50 each for movies BEFORE 6:00 PM (less than), and $10.00 each after that time. The following program flowchart was designed to prompt the user for the time of the movie and how many tickets the user wishes to purchase, then makes and displays the price using the correct calculation. (For this problem, do not worry about AM versus PM.)However, there are a number of errors. Use the directions posted in this folder and make the corrections.

## Using pandas

Click on the following link and download the dataset.

Question Using pandas

Click on the following link and download the dataset. The dataset contains information about more than 37000 bank accounts. https://www.dropbox.com/s/j41kxvjc6uraurn/Banking Dataset.csv?dl=0Describe all the numeric variables. • The duration variable have very small and very large numbers. create a new column and divide all the duration values by 30 and add it to that new column (call this column ‘duration_month’). In fact you are creating a new column in which you can see the duration in months. To learn how to add a new calculated column to a pandas dataframe open the following link. https://stackoverflow.com/questions/18504967/pandas-dataframe-create-new-columns-and-fill-with-calculated-values-from-same-df

## The program accepts a student’s data as follows: GID number

Question The program accepts a student’s data as follows: GID number first and last name major field of study grade point averageDisplay the words, “HONOR ROLL” if the student’s grade point average is 3.0 or better. The input comes from the keyboard, not a file, and an array is not needed. Please find and correct the errors according to the direction in this folder.start declarations num gid num firstName num lastName num majorStudy num gpa num QUIT = “YES” num quitNow housekeeping() while quitNow QUIT processLoop() endwhile eoj()stop housekeeping() quitNow=”N”return processLoop()input gidinput firstNameinput lastNameinput majorStudyinput GPAif gpa<=3.0output "HONOR ROLL"endifoutput "Do you want to quit? Y or N?" eoj() output "End of program."stop

## Hello, looking for help on this Java program below: import java.util.Random;

Question Hello, looking for help on this Java program below: import java.util.Random; /** This class compares the efficiency of Selection Sort, Insertion Sort, Shell Sort, Other Shell Sort, Bubble Sort, and Better Bubble Sort. @author */public class SortComparisons{ private int counter; private Random r; private int[] list1, list2, list3, list4, list5, list6; public SortComparisons() { counter = 0; r = new Random(); testComparisons(); } /** Tests the number of comparisons between the different sorting algorithms. */ public void testComparisons() { for (int x = 2; x <= 4096; x *= 2) { populateLists(x); System.out.println("With arrays of size " x "…"); counter = 0; selectionSort(list1, 0, x – 1); System.out.println("Selection Sort makes " counter " comparisons"); counter = 0; insertionSort(list2, 0, x – 1); System.out.println("Insertion Sort makes " counter " comparisons"); counter = 0; shellSort(list3, 0, x – 1); System.out.println("Shell Sort makes " counter " comparisons"); counter = 0; otherShellSort(list4, 0, x – 1); System.out.println("A modified Shell Sort makes " counter " comparisons"); counter = 0; bubbleSort(list5, 0, x – 1); System.out.println("A Bubble Sort makes " counter " comparisons"); counter = 0; betterBubbleSort(list6, 0, x – 1); System.out.println("A better Bubble Sort makes " counter " comparisons"); System.out.println(); } // end for } // end testComparisons /** Fills each list with random integers in the same order. @param size The number of random integers to fill in. */ public void populateLists(int size) { list1 = new int[size]; list2 = new int[size]; list3 = new int[size]; list4 = new int[size]; list5 = new int[size]; list6 = new int[size]; int index = 0; while (index 0. */ public void selectionSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the private method getIndexOfSmallest. } // end selectionSort // Finds the index of the smallest value in a portion of an array a. // Precondition: a.length > last >= first >= 0. // Returns the index of the smallest value among // a[first], a[first 1], . . . , a[last]. private int getIndexOfSmallest(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD } // end getIndexOfSmallest /** Sorts using the recursive Insertion Sort algorithm. @param a The array to sort. @param first The index of the first element to sort. @param last The index of the last element to sort. */ public void insertionSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the private method insertInOrder. } // end insertionSort // Inserts an element into the appropriate location in the given // array, between first and last. private void insertInOrder(int element, int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD } // end insertInOrder /** Sorts using the Shell Sort algorithm. @param a The array to sort. @param first The index of the first element to sort. @param last The index of the last element to sort. */ public void shellSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the private method incrementalInsertionSort. } // end shellSort /** Sorts equally spaced elements of an array into ascending order, used for shell sort. @param a an array of Comparable objects. @param first An integer >= 0 that is the index of the first array element to consider. @param last An integer >= first and < a.length that is the index of the last array element to consider. @param space The difference between the indices of the elements to sort. */ private void incrementalInsertionSort(int[] a, int first, int last, int space) { // ADD CODE HERE TO MISSING METHOD } // end incrementalInsertionSort /** Sorts using the modified Shell Sort algorithm. @param a The array to sort. @param first The index of the first element to sort. @param last The index of the last element to sort. */ public void otherShellSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the method incrementalInsertionSort. } // end otherShellSort /** Sorts using the Bubble Sort algorithm. @param a The array to sort. @param first The index of the first element to sort. @param last The index of the last element to sort. */ public void bubbleSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the private method order. } // end bubbleSort // Swaps the array the array entries a[i] and a[j] if necessary private void order(int[] a, int i, int j) { // ADD CODE HERE TO MISSING METHOD } // end order // ——————————————————————————- /** Sorts using a better Bubble Sort algorithm. @param a The array to sort. @param first The index of the first element to sort. @param last The index of the last element to sort. */ public void betterBubbleSort(int[] a, int first, int last) { // ADD CODE HERE TO MISSING METHOD // using the private method swap. } // end betterBubbleSort // Swaps the array entries a[i] and a[j]. private static void swap(int[] a, int i, int j) { int temp = a[i]; a[i] = a[j]; a[j] = temp; } // end swap // Tests various sorting methods public static void main(String[] args) { new SortComparisons(); } // end main} // end SortComparisons